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

Sysop02
  • 0

    Terms

  • 0

    Blossaries

  • 1

    Followers

Industry/Domain: Food (other) Category: Herbs & spices

Celery seed

Spice (whole or ground, sometimes mixed with salt - celery salt) Description: Seeds from wild Indian celery called lovage. Slightly bitter, strong ...

Contributor

Featured blossaries

Best Beaches In The World

Category: Travel   1 10 Terms

Richest Women in the U.S

Category: Business   1 4 Terms