Enhancing Short Text Semantic Similarity Measurement Using Pretrained Word Embeddings and Big Data

Measuring semantic similarity between short texts is a fundamental task in natural language processing with applications in information retrieval, question answering, and machine translation. Traditional methods such as term frequency (tf) and term frequency-inverse document frequency (tfidf) rely on lexical matching and fail to capture semantic meanings. This paper introduces Word Embeddings for Semantic Similarity (WESS), leveraging pretrained Word2Vec embeddings to capture semantic relationships. We fine-tune the Word2Vec model on the Quora Question Pairs dataset, containing 404,290 pairs of questions labeled as duplicate or non-duplicate. Our approach calculates text similarity by aggregating word embedding similarities. Experimental results demonstrate that WESS outperforms traditional methods, achieving an accuracy of 0.675, a 9.4% improvement over tf (0.617), a 6.5% improvement over tfidf (0.634), a 3.8% improvement over tfidf combined with Word2Vec (0.636), and a 1.9% improvement over standalone Word2Vec (0.662). These findings underscore the importance of semantic understanding in text similarity tasks and validate the effectiveness of pretrained word embeddings for capturing nuanced semantic relationships. The SSST method offers a robust and accurate approach for measuring semantic similarity between short texts, providing significant improvements over traditional approaches.

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1109/ibdap62940.2024.10689695
Citations
3
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing Short Text Semantic Similarity Measurement Using Pretrained Word Embeddings and Big Data

Ratchakoon Pruengkarn, Supakpong Jinarat
3 citations
Topic Modeling
1.04
article

Enhancing Short Text Semantic Similarity Measurement Using Pretrained Word Embeddings and Big Data

Ratchakoon Pruengkarn, Supakpong Jinarat
article en
3 citations

Abstract

Measuring semantic similarity between short texts is a fundamental task in natural language processing with applications in information retrieval, question answering, and machine translation. Traditional methods such as term frequency (tf) and term frequency-inverse document frequency (tfidf) rely on lexical matching and fail to capture semantic meanings. This paper introduces Word Embeddings for Semantic Similarity (WESS), leveraging pretrained Word2Vec embeddings to capture semantic relationships. We fine-tune the Word2Vec model on the Quora Question Pairs dataset, containing 404,290 pairs of questions labeled as duplicate or non-duplicate. Our approach calculates text similarity by aggregating word embedding similarities. Experimental results demonstrate that WESS outperforms traditional methods, achieving an accuracy of 0.675, a 9.4% improvement over tf (0.617), a 6.5% improvement over tfidf (0.634), a 3.8% improvement over tfidf combined with Word2Vec (0.636), and a 1.9% improvement over standalone Word2Vec (0.662). These findings underscore the importance of semantic understanding in text similarity tasks and validate the effectiveness of pretrained word embeddings for capturing nuanced semantic relationships. The SSST method offers a robust and accurate approach for measuring semantic similarity between short texts, providing significant improvements over traditional approaches.

Dhurakij Pundit University (TH)
Openalex Percentile: Top 19%
Topic Modeling
1.04
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.