Skip to main content

An Efficient Approach for Findings Document Similarity Using Optimized Word Mover’s Distance

  • Conference paper
  • First Online:
Pattern Recognition and Machine Intelligence (PReMI 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14301))

  • 600 Accesses

Abstract

We introduce Optimized Word Mover’s Distance (OWMD), a similarity function that compares two sentences based on their word embeddings. The method determines the degree of semantic similarity between two sentences considering their interdependent representations. Within a sentence, all the words may not be relevant for determining contextual similarity at the aspect level with another sentence. To account for this fact, we designed OWMD in two ways: first, it decreases system’s complexity by selecting words from the sentence pair according to a predefined set of dependency parsing criteria; Second, it applies the word mover’s distance (WMD) method to previously chosen words. When comparing the dissimilarity of two text sentences, the WMD method is used because it represents the minimal “journey time” required for the embedded words of one sentence to reach the embedded words of another sentence. Finally, adding an exponent function to the inverse of the OWMD dissimilarity score yields the resulting similarity score, called Optimized Word Mover’s Similarity (OWMS). Using STSb-Multi-MT dataset, the OWMS measure decreases MSE, RMSE, and MAD error rates by \(66.66\%\), \(40.70\%\), and \(37.93\%\) respectively than previous approaches. Again, OWMS reduces MSE, RMSE, and MAD error rates on Semantic Textual Similarity (STS) dataset by \(85.71\%\), \(62.32\%\), and \(60.17\%\) respectively. For STSb-Multi-MT and STS datasets, the suggested strategy reduces run-time complexity by \(33.54\%\) and \(49.43\%\), respectively, compared to the best of existing approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://huggingface.co/datasets/stsb_multi_mt/viewer/en/train.

  2. 2.

    https://github.com/anantm95/Semantic-Textual-Similarity/tree/master/data.

References

  1. Kusner, M., Sun, Y., Kolkin, N., Weinberger, K.: From word embeddings to document distances. In: International Conference on Machine Learning, pp. 957–966. PMLR (2015)

    Google Scholar 

  2. Hassan, B., Abdelrahman, S.E., Bahgat, R., Farag, I.: UESTS: an unsupervised ensemble semantic textual similarity method. IEEE Access 7, 85462–85482 (2019)

    Article  Google Scholar 

  3. Clark, E., Celikyilmaz, A., Smith, N.A.: Sentence mover’ similarity: automatic evaluation for multi-sentence texts. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 2748–2760 (2019)

    Google Scholar 

  4. Brychcín, T., Svoboda, L.: UWB at SemEval-2016 task 1: semantic textual similarity using lexical, syntactic, and semantic information. In: Proceedings of the 10th International Workshop on Semantic Evaluation (SemEval-2016), pp. 588–594 (2016)

    Google Scholar 

  5. Wu, H., Huang, H.Y., Jian, P., Guo, Y., Su, C.: BIT at SemEval-2017 task 1: using semantic information space to evaluate semantic textual similarity. In: Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval-2017), pp. 77–84 (2017)

    Google Scholar 

  6. Tian, J., Zhou, Z., Lan, M., Wu, Y.: ECNU at SemEval-2017 task 1: leverage kernel-based traditional NLP features and neural networks to build a universal model for multilingual and cross-lingual semantic textual similarity. In: Proceedings of the 11th international workshop on semantic evaluation (SemEval-2017), pp. 191–197 (2017)

    Google Scholar 

  7. Nguyen, H.T., Duong, P.H., Cambria, E.: Learning short-text semantic similarity with word embeddings and external knowledge sources. Knowl.-Based Syst. 182, 104842 (2019)

    Google Scholar 

  8. Lin, C.Y.: ROUGE: a package for automatic evaluation of summaries. In: Text Summarization Branches Out, pp. 74–81 (2004)

    Google Scholar 

  9. Pennington, J., Socher, R., Manning, C.D.: GloVe: global vectors for word representation. In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1532–1543 (2014)

    Google Scholar 

  10. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018)

  11. Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)

  12. Sato, R., Yamada, M., Kashima, H.: Re-evaluating word mover’ distance. In: International Conference on Machine Learning, pp. 19231–19249. PMLR (2022)

    Google Scholar 

  13. Kashyap, A.L., et al.: Meerkat mafia: multilingual and cross-level semantic textual similarity systems. In: Proceedings of the 8th International Workshop on Semantic Evaluation, pp. 416–423 (2014)

    Google Scholar 

  14. Qiu, G., Liu, B., Jiajun, B., Chen, C.: Opinion word expansion and target extraction through double propagation. Comput. Linguist. 37(1), 9–27 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Atanu Dey .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dey, A., Jenamani, M., De, A. (2023). An Efficient Approach for Findings Document Similarity Using Optimized Word Mover’s Distance. In: Maji, P., Huang, T., Pal, N.R., Chaudhury, S., De, R.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2023. Lecture Notes in Computer Science, vol 14301. Springer, Cham. https://doi.org/10.1007/978-3-031-45170-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45170-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45169-0

  • Online ISBN: 978-3-031-45170-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics