International Journal of Scientific and Research Publications

IJSRP, Volume 9, Issue 9, September 2019 Edition [ISSN 2250-3153]


Edit distance computation with minimum number of edit operations in database management system and information retrieval
      Yi Mar Myint
Abstract: In information theory, linguistics and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. The edit distance between two sequences is the minimum number of weighted transformation-operations that are required to transform one string into the

Reference this Research Paper (copy & paste below code):

Yi Mar Myint (2019); Edit distance computation with minimum number of edit operations in database management system and information retrieval; International Journal of Scientific and Research Publications (IJSRP) 9(9) (ISSN: 2250-3153), DOI: http://dx.doi.org/10.29322/IJSRP.9.09.2019.p9385
©️ Copyright 2011-2022 IJSRP - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.