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

Add an image

Part of Speech: noun
Synonym(s):
Blossary:
Industry/Domain: Computer science
Category: Algorithms & data structures
Government Agency: NIST
Product:
Acronym-Abbreviation:

Collect to Blossary

Other Languages:

Related terms

distance

Archaeology; Evolution

In taxonomy, referring to the quantitatively measured difference between the phenetic appearance of two groups of individuals, such as populations or species (phenetic distance), ...

distance

Language; Linguistics

One of the four schematic categories in the perspectival system. This category relates to distance of a referent relative to a speaker or hearer and is encoded by closed class ...

distance

Physics; General physics

The actual path length covered by a body. It is a scalar quantity.

distance

Literature; Literary techniques

Used in two main senses: 1) the narrator’s emotional distance fromthe characters and the action (the degree of his or her involvement in the story); and 2) the distance between ...

distance

Telecommunications; GPS (global positioning system)

The length (in feet, meters, miles, etc.) between two waypoints or from your current position to a destination waypoint. This length can be measured in straight-line (rhumb line) ...