Semantic search system for name of government work package using BERT

This study develops a semantic search system to improve query matching for government work packages using data from SIRUP (General Procurement Plan Information System) and KBLI 2020 (Indonesian Standard Industrial Classification). The existing SIRUP search system relies on keyword matching, which often fails to capture semantic relationships between queries and data. To address this, a two-stage approach was introduced: first, matching queries with main KBLI categories, and second, refining results by aligning queries with work package names under the identified category. The system leverages IndoBERT as its base model and incorporates fine-tuning to adapt to the procurement domain. While fine-tuning enhanced semantic relationships, it was insufficient to handle irrelevant data with high similarity scores. To overcome this, Triplet Loss was employed to optimize embeddings, improving the separation of relevant and irrelevant data. The evaluation involved 30 queries, with each query individually assessed for precision, recall, and F1 score. The system achieved an overall precision of 0.84, recall of 0.78, and F1 score of 0.80, demonstrating its ability to retrieve semantically relevant results effectively. This approach highlights the potential of semantic search to enhance query accuracy and relevance in the government procurement domain.

Authors

Institutions

Publication Details

Journal
IET conference proceedings.
Published
2025-03-01
DOI
https://doi.org/10.1049/icp.2025.0305
Primary Topic
Service-Oriented Architecture and Web Services
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Semantic search system for name of government work package using BERT

Ingrid Nurtanio, Zulkifli Tahir, Khaeruddin Asdar
IET conference proceedings.
Service-Oriented Architecture and Web Services
article

Semantic search system for name of government work package using BERT

Ingrid Nurtanio, Zulkifli Tahir, Khaeruddin Asdar
article en

Abstract

This study develops a semantic search system to improve query matching for government work packages using data from SIRUP (General Procurement Plan Information System) and KBLI 2020 (Indonesian Standard Industrial Classification). The existing SIRUP search system relies on keyword matching, which often fails to capture semantic relationships between queries and data. To address this, a two-stage approach was introduced: first, matching queries with main KBLI categories, and second, refining results by aligning queries with work package names under the identified category. The system leverages IndoBERT as its base model and incorporates fine-tuning to adapt to the procurement domain. While fine-tuning enhanced semantic relationships, it was insufficient to handle irrelevant data with high similarity scores. To overcome this, Triplet Loss was employed to optimize embeddings, improving the separation of relevant and irrelevant data. The evaluation involved 30 queries, with each query individually assessed for precision, recall, and F1 score. The system achieved an overall precision of 0.84, recall of 0.78, and F1 score of 0.80, demonstrating its ability to retrieve semantically relevant results effectively. This approach highlights the potential of semantic search to enhance query accuracy and relevance in the government procurement domain.

IET conference proceedings.Vol. 2024(30)
Hasanuddin University (ID)
Decent work and economic growth
Openalex Percentile: Top 95%
Service-Oriented Architecture and Web Services
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.