| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utv (0) - 1 freq uv (1) - 12 freq uth (1) - 1 freq atv (1) - 1 freq stv (1) - 12 freq vtv (1) - 1 freq utj (1) - 1 freq utd (1) - 11 freq tv (1) - 208 freq utq (1) - 2 freq itv (1) - 4 freq mtv (1) - 2 freq ut (1) - 9 freq btv (1) - 1 freq dutv (1) - 2 freq utb (1) - 1 freq viv (2) - 1 freq upn (2) - 1 freq luv (2) - 183 freq rov (2) - 1 freq atr (2) - 1 freq wt (2) - 5 freq uce (2) - 1 freq ulg (2) - 1 freq hqv (2) - 1 freq |
utv (0) - 1 freq itv (1) - 4 freq atv (1) - 1 freq tv (1) - 208 freq mtv (2) - 2 freq btv (2) - 1 freq utb (2) - 1 freq uv (2) - 12 freq dutv (2) - 2 freq ut (2) - 9 freq stv (2) - 12 freq utq (2) - 2 freq utj (2) - 1 freq vtv (2) - 1 freq uth (2) - 1 freq utd (2) - 11 freq ett (3) - 97 freq bv (3) - 2 freq tc (3) - 3 freq gv (3) - 11 freq ebv (3) - 1 freq t (3) - 5648 freq nv (3) - 5 freq auto (3) - 5 freq ate (3) - 117 freq |
SoundEx code - U310 utv - 1 freq utopia - 1 freq utb - 1 freq |
MetaPhone code - UTF utv - 1 freq |
UTV |
| Time to execute Levenshtein function - 0.313810 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.600270 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.040193 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.050524 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001166 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |