Edit distance
In computational linguistics and computer science, edit distance is a way of quantifying how dissimilar two strings (e.g., words) are to one another by counting the minimum number of operations required to transform one string into the other. Edit distances find applications in natural language processing, where automatic spelling correction can determine candidate corrections for a misspelled word by selecting words from a dictionary that have a low distance to the word in question. In bioinformatics, it can be used to quantify the similarity of DNA sequences, which can be viewed as strings of the letters A, C, G and T.
Approximate string matchingAutocompleteChvátal–Sankoff constantsDNA encryptionDamerau–Levenshtein distanceData synchronizationDeniable encryptionDiffDistanceDouble Cut and Join ModelDynamic programmingError-tolerant designFibonacci codingFile comparisonFull-text searchGad LandauGap penaltyGraph edit distanceHamming distanceHeavy path decompositionJaro–Winkler distanceJewels of StringologyKristin LauterLevehstein distanceLevenshtein algorithmLevenshtein distanceLevenshtein string distanceList of terms relating to algorithms and data structuresList of unsolved problems in computer scienceLongest common subsequence problemMethod of Four RussiansMetric (mathematics)Metric spaceOptimal string alignmentProximity search (text)RebusSecure multi-party computationSequence alignmentSpatial complexitySpeech recognition
Link from a Wikipage to another Wikipage
primaryTopic
Edit distance
In computational linguistics and computer science, edit distance is a way of quantifying how dissimilar two strings (e.g., words) are to one another by counting the minimum number of operations required to transform one string into the other. Edit distances find applications in natural language processing, where automatic spelling correction can determine candidate corrections for a misspelled word by selecting words from a dictionary that have a low distance to the word in question. In bioinformatics, it can be used to quantify the similarity of DNA sequences, which can be viewed as strings of the letters A, C, G and T.
has abstract
En informatique théorique, en ...... ppliqués à un nœud d'un arbre.
@fr
In computational linguistics a ...... changeably with edit distance.
@en
編輯距離是針對二個字符串(例如英文字)的差異程度的量化量測, ...... aro 距离只允许字符转置。
* 汉明距离只允許取代字元。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,018,609,720
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
En informatique théorique, en ...... èmes de tutorats intelligents.
@fr
In computational linguistics a ...... of the letters A, C, G and T.
@en
編輯距離是針對二個字符串(例如英文字)的差異程度的量化量測, ...... aro 距离只允许字符转置。
* 汉明距离只允許取代字元。
@zh
label
Distance d'édition sur les arbres
@fr
Edit distance
@en
編輯距離
@zh