Levenshtein distance
In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. It is named after the Soviet mathematician Vladimir Levenshtein, who considered this distance in 1965.
known for
Wikipage disambiguates
AgrepApache LuceneApproximate string matchingAutomated Similarity Judgment ProgramBK-treeBit error rateBitap algorithmComputer-aided audit toolsCosine similarityDamerau–Levenshtein distanceDiffDistanceDynamic programmingDynamic time warpingEdit distanceEntropy (information theory)Error correction codeEvaluation of machine translationFuzzy extractorGraph edit distanceHamming distanceHierarchical clusteringHirschberg's algorithmHunt–Szymanski algorithmIndex of combinatorics articlesJaro–Winkler distanceKolmogorov complexityLDLetter bankLevenshtein DistanceLevenshtein automatonLevenshtein distanceLevenshtein metricLevensteinLevenstein DistanceLevenstein distanceLinguistic distanceList of Russian IT developersList of Russian mathematiciansList of Russian people
Link from a Wikipage to another Wikipage
known for
primaryTopic
Levenshtein distance
In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. It is named after the Soviet mathematician Vladimir Levenshtein, who considered this distance in 1965.
has abstract
Dalam teori informasi, linguis ...... enal secara kolektif sebagai .
@in
Em teoria da informação, a dis ...... é por exemplo o caso com os .
@pt
In de informatica is de Levens ...... n 1965 een artikel aan wijdde.
@nl
In information theory, linguis ...... to pairwise string alignments.
@en
La distance de Levenshtein est ...... de la distance de Levenshtein.
@fr
La distancia de Levenshtein, d ...... (A,B) + Dist(B,C) >= Dist(A,C)
@es
La distància de Levenshtein ta ...... at en la memòria de traducció.
@ca
Levenshtein distantzia, hitzen ...... ) + Dist (B, C)> = Dist (A, C)
@eu
Levenshteinavståndet är inom i ...... r föreslås som rättstavat ord.
@sv
Levenštejnova vzdálenost (také ...... lgoritmech korektorů překlepů.
@cs
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,011,098,657
Link from a Wikipage to another Wikipage
code
d[i,j]
@en
s[1..i]
@en
t[1..j]
@en
lang
C
@en
wikiPageUsesTemplate
hypernym
type
comment
Dalam teori informasi, linguis ...... kan jarak ini pada tahun 1965.
@in
Em teoria da informação, a dis ...... é por exemplo o caso com os .
@pt
In de informatica is de Levens ...... n 1965 een artikel aan wijdde.
@nl
In information theory, linguis ...... sidered this distance in 1965.
@en
La distance de Levenshtein est ...... ment en reconnaissance vocale.
@fr
La distancia de Levenshtein, d ...... los correctores ortográficos.
@es
La distància de Levenshtein ta ...... at en la memòria de traducció.
@ca
Levenshtein distantzia, hitzen ...... rtografikoekin esate baterako.
@eu
Levenshteinavståndet är inom i ...... as, som i stavningskontroller.
@sv
Levenštejnova vzdálenost (také ...... lgoritmech korektorů překlepů.
@cs
label
Distance de Levenshtein
@fr
Distancia de Levenshtein
@es
Distanza di Levenshtein
@it
Distància de Levenshtein
@ca
Distância Levenshtein
@pt
Jarak Levenshtein
@in
Levenshtein distance
@en
Levenshtein distantzia
@eu
Levenshtein-Distanz
@de
Levenshteinafstand
@nl