![](/template/termwiki/images/likesmall.jpg)
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
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: Philosophy Category: General philosophy
Sungazing
The act of staring directly at the rising or setting sun in the belief that such act will provide nourishment or spiritual fulfillment. Some sungazers ...
Contributor
Featured blossaries
Browers Terms By Category
- Gardening(1753)
- Outdoor decorations(23)
- Patio & lawn(6)
- Gardening devices(6)
- BBQ(1)
- Gardening supplies(1)
Garden(1790) Terms
- Aeronautics(5992)
- Air traffic control(1257)
- Airport(1242)
- Aircraft(949)
- Aircraft maintenance(888)
- Powerplant(616)
Aviation(12294) Terms
- Lingerie(48)
- Underwear(32)
- Skirts & dresses(30)
- Coats & jackets(25)
- Trousers & shorts(22)
- Shirts(17)
Apparel(222) Terms
- Material physics(1710)
- Metallurgy(891)
- Corrosion engineering(646)
- Magnetics(82)
- Impact testing(1)
Materials science(3330) Terms
- Misc restaurant(209)
- Culinary(115)
- Fine dining(63)
- Diners(23)
- Coffehouses(19)
- Cafeterias(12)