Home > Terms > English, UK (UE) > Levenshtein distance

Levenshtein distance

(1) The smallest number of insertions, deletions, and substitutions required to change one string or tree into another. (2) A Θ(m × n) algorithm to compute the distance between strings, where m and n are the lengths of the strings.

This is auto-generated content. You can help to improve it.
0
Collect to Blossary

Member comments

You have to log in to post to discussions.

Terms in the News

Featured Terms

Harry8L
  • 0

    Terms

  • 0

    Blossaries

  • 1

    Followers

Industry/Domain: Religion Category: Catholic church

Historical reconciliation

On Thursday (August 16th, 2012)the church leaders of the Russian-orthodox and the Polish Roman-catholic churches met and signed a peace-document, ...

Contributor

Featured blossaries

10 Best Bali Luxury Resorts

Category: Travel   1 10 Terms

Julius Caesar

Category: Education   1 20 Terms

Browers Terms By Category