This is an automatic view based on data from ଉଇକିଡାଟା.
There is not a complete article yet, but you can help creating one.
computer science metric for string similarity
External resources
| ଫ୍ରୀବେସ ସୂଚକ | |
| Microsoft Academic ID | |
| Dictionary of Algorithms and Data Structures ID | |
| Quora topic ID | |
| OpenAlex ID | |
ଏହାର ମୁଖ୍ୟଶ୍ରେଣୀ
distance
norm
string metric
edit distance
ନାମରେ ନାମିତ
Vladimir Levenshtein
studied in
category theory
defining formula
![{\displaystyle \operatorname {lev} (a,b)={\begin{cases}|a|&{\text{if }}|b|=0\\|b|&{\text{if }}|a|=0\\\operatorname {lev} (\operatorname {tail} (a),\operatorname {tail} (b))&{\text{if }}a[0]=b[0]\\1+\min {\begin{cases}\operatorname {lev} (\operatorname {tail} (a),b)\\\operatorname {lev} (a,\operatorname {tail} (b))\\\operatorname {lev} (\operatorname {tail} (a),\operatorname {tail} (b))\\\end{cases}}&{\text{otherwise}}\end{cases}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/990fcba749a6c9e873d6c819e7e9e53a1dd203d6)
in defining formula
symbol represents: string length
symbol represents: minimum
uses
logical negation
insertion mutation
deletion
substitution
maintained by WikiProject
WikiProject Mathematics
different from
Damerau–Levenshtein distance
Levenshtein automaton
edit distance
ଆଧାର
- ↑ Freebase Data Dumps, ୨୮ ଅକ୍ଟୋବର 2013
- ↑ Quora
- ↑ OpenAlex, ୨୬ ଜାନୁଆରୀ 2022, https://docs.openalex.org/download-snapshot/snapshot-data-format
