Similarity Based Information Retrieval Using Levenshtein Distance Algorithm

Authors

  • Daw Khin Po

DOI:

https://doi.org/10.31695/IJASRE.2020.33780

Keywords:

Sentence Similarity, Levenshtein Distance, Tokenization, Stop words, Information Retrieval.

Abstract

Sentence similarity plays an important role in many text-related research and applications such as information retrieval, information recommendation, natural language processing, machine translation and translation memory, and etc. Calculating similarity between sentences is the basis of measuring the similarity between texts which is the key to document classification and clustering. Sentence similarity partially depends on the word similarity. This system will display a similar text of field, areas and other facts in document retrieval. This paper uses a sentence matching method of the Levenshtein Distance algorithm. The
similarity between words can be calculated from the spelling of words or the meaning of words. Sentence similarity: The similarities between words in different sentences have a great influence on the similarity between two sentences. This system is retrieved from a similar sentence that included Theories, Methods and other facts in the document database.

Downloads

How to Cite

Daw Khin Po. (2020). Similarity Based Information Retrieval Using Levenshtein Distance Algorithm. International Journal of Advances in Scientific Research and Engineering (IJASRE), ISSN:2454-8006, DOI: 10.31695/IJASRE, 6(4), 06–10. https://doi.org/10.31695/IJASRE.2020.33780