7 TermsHome > 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
0
Improve it
- Part of Speech: noun
- Synonym(s):
- Blossary:
- Industry/Domain: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
- Product:
- Acronym-Abbreviation:
Other Languages:
Member comments
Terms in the News
Featured Terms
Industry/Domain: Holiday Category: Observances
Steve Jobs Day
Launched by digital advertising agency Studiocom, Steve Jobs Day is in celebration of the greatness that Jobs achieved during his lifetime. People ...
Contributor
Featured blossaries
Browers Terms By Category
- American culture(1308)
- Popular culture(211)
- General culture(150)
- People(80)
Culture(1749) Terms
- Yachting(31)
- Ship parts(4)
- Boat rentals(2)
- General sailing(1)
Sailing(38) Terms
- Characters(952)
- Fighting games(83)
- Shmups(77)
- General gaming(72)
- MMO(70)
- Rhythm games(62)
Video games(1405) Terms
- Inorganic pigments(45)
- Inorganic salts(2)
- Phosphates(1)
- Oxides(1)
- Inorganic acids(1)
Inorganic chemicals(50) Terms
- Dictionaries(81869)
- Encyclopedias(14625)
- Slang(5701)
- Idioms(2187)
- General language(831)
- Linguistics(739)