| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ut (0) - 9 freq ug (1) - 6 freq xut (1) - 1 freq uz (1) - 50 freq nt (1) - 34 freq rut (1) - 7 freq out (1) - 773 freq gt (1) - 9 freq tut (1) - 67 freq un (1) - 31 freq utb (1) - 1 freq lt (1) - 5 freq utd (1) - 11 freq qt (1) - 5 freq uf (1) - 1 freq jt (1) - 19 freq 't (1) - 21 freq uu (1) - 3 freq žt (1) - 1 freq sut (1) - 161 freq ht (1) - 8 freq unt (1) - 1 freq us (1) - 3606 freq um (1) - 142 freq lut (1) - 59 freq |
ut (0) - 9 freq it (1) - 32760 freq t (1) - 5646 freq out (1) - 773 freq ot (1) - 18 freq yt (1) - 12 freq at (1) - 20079 freq et (1) - 256 freq ct (2) - 8 freq ita (2) - 10 freq but (2) - 13122 freq oto (2) - 1 freq te (2) - 1569 freq oot (2) - 13735 freq iuta (2) - 1 freq yte (2) - 1 freq up (2) - 12983 freq yto (2) - 1 freq dt (2) - 3 freq ªt (2) - 6 freq utq (2) - 2 freq uh (2) - 8 freq wut (2) - 26 freq wt (2) - 3 freq ul (2) - 9 freq |
SoundEx code - U300 ut - 9 freq uid - 1 freq ¸'ut - 1 freq uth - 1 freq ud - 4 freq utha - 1 freq uydh - 1 freq utd - 11 freq uydo - 1 freq |
MetaPhone code - UT ut - 9 freq uid - 1 freq ¸'ut - 1 freq ud - 4 freq uydh - 1 freq uydo - 1 freq |
UT |
| Time to execute Levenshtein function - 0.163110 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.302795 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.027425 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.039248 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.000823 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. |