An Analysis of Levenshtein Distance Using Dynamic Programming Method

Title

An Analysis of Levenshtein Distance Using Dynamic Programming Method

Creator

Arockiya Jerson J.; Preethi N.

Description

An edit distance (or Levenshtein distance) amongst dual verses refers to the slightest amount of replacements, additions and omissions of signs essential to turn one name addicted to the additional is referred to as the edit distance (or Levenshtein distance) amongst dual verses. The challenge of calculating the edit distance of a consistent verbal, that is the set of verses recognised by a fixed mechanism, is addressed in this research. The Levenshtein distance is a straightforward metric for calculating the distance amongst dual words using a string approximation. After witnessing its efficiency, this approach was refined by combining certain comparable letters and minimising the biased modification between associates of the similar set. The findings displayed a considerable enhancement over the old Levenshtein distance method. 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

Source

Lecture Notes in Networks and Systems, Vol-540, pp. 525-532.

Date

2023-01-01

Publisher

Springer Science and Business Media Deutschland GmbH

Subject

Approximation; Levenshtein distance; Similarity between words; Similarity calculation; String; The longest common subsequence

Coverage

Arockiya Jerson J., Christ University, Pune, Lavasa, India; Preethi N., Christ University, Pune, Lavasa, India

Rights

Restricted Access

Relation

ISSN: 23673370; ISBN: 978-981196087-1

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1007/978-981-19-6088-8_46

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85149819721&doi=10.1007%2f978-981-19-6088-8_46&partnerID=40&md5=dbd536625539a80ba9dda578cb9a0e89