A Comparative Study of Text Embedding Models for Semantic Text Similarity in Bug Reports
Not on the map. Why?
Abstract (arXiv)
Bug reports are an essential aspect of software development, and it is crucial to identify and resolve them quickly to ensure the consistent functioning of software systems. Retrieving similar bug reports from an existing database can help reduce the time and effort required to resolve bugs. In this paper, we compared the effectiveness of semantic textual similarity methods for retrieving similar bug reports based on a similarity score. We explored several embedding models such as TF-IDF (Baseline), FastText, Gensim, BERT, and ADA. We used the Software Defects Data containing bug reports for various software projects to evaluate the performance of these models. Our experimental results showed that BERT generally outperformed the rest of the models regarding recall, followed by ADA, Gensim, FastText, and TFIDF. Our study provides insights into the effectiveness of different embedding methods for retrieving similar bug reports and highlights the impact of selecting the appropriate one for this task. Our code is available on GitHub.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 26 references that are in the map. First posted on arXiv 17 Aug 2023.
Builds on
7 of 26 references.
References · 7
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2016Enriching Word Vectors with Subword Informationcited by 1,578
- 2022A Comprehensive Survey of Regression Based Loss Functions for Time Series Forecastingcited by 33
- 2020An Overview of Deep Learning Architectures in Few-Shot Learning Domaincited by 16
- 2023Leveraging Generative AI Models for Synthetic Data Generation in Healthcare: Balancing Research and Privacycited by 7
- 2022Auto-labelling of Bug Report using Natural Language Processingcited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.