Levenshtein distance
Computer science metric for string similarity
In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. For two strings, it is the minimum number of single-symbol edits—insertions, deletions, or substitutions—required to transform one string into the other.
Nº Q496939 ★★★
Rare · Knowledge
Levenshtein distance
Computer science metric for string similarity
In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. For two strings, it is the minimum number of single-symbol edits—insertions, deletions, or substitutions—required to transform one string into the other.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. For two strings, it is the minimum number of single-symbol edits—insertions, deletions, or substitutions—required to transform one string into the other. Each edit has unit cost in the classical definition. The distance is named after Soviet mathematician Vladimir Levenshtein, who introduced it in 1965 in the context of error-correcting codes. Levenshtein distance is a particular form of edit distance; the latter term is also used for broader models in which the set of allowed operations or their costs differ. It is closely related to sequence alignment.
Text: Wikipédia, CC BY-SA 4.0. · Image: Napsternxg (CC BY-SA 4.0) ·
Related cards
Chebyshev distance
Distance between vectors defined by the maximum difference between coordinates
Nº Q573482 ★★
Hamming distance
Number of bits that differ between two strings
Nº Q272172 ★★
LEB128
Compact representation for big-integer data types
Nº Q6457577 ★★
String (computer science)
Data type representing a finite sequence of encoded characters
Nº Q184754 ★★
Levenberg–Marquardt algorithm
Algorithm
Nº Q1426494 ★★
LLVM
Compiler backend for multiple programming languages
Nº Q223490 ★★★