| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utd (0) - 11 freq upd (1) - 1 freq td (1) - 9 freq std (1) - 1 freq utj (1) - 1 freq und (1) - 12 freq ftd (1) - 1 freq uid (1) - 1 freq utq (1) - 2 freq utb (1) - 1 freq uth (1) - 1 freq ltd (1) - 8 freq ut (1) - 9 freq ud (1) - 4 freq usd (1) - 1 freq utv (1) - 1 freq cpd (2) - 3 freq ªt (2) - 6 freq ctf (2) - 1 freq rtt (2) - 1 freq end (2) - 1198 freq wfd (2) - 1 freq nud (2) - 1 freq ™t (2) - 2 freq rtz (2) - 2 freq |
utd (0) - 11 freq td (1) - 9 freq ootd (2) - 2 freq ud (2) - 4 freq usd (2) - 1 freq tyd (2) - 4 freq tad (2) - 54 freq tod (2) - 275 freq tid (2) - 25 freq outed (2) - 2 freq ut (2) - 9 freq ted (2) - 13 freq utv (2) - 1 freq ltd (2) - 8 freq std (2) - 1 freq und (2) - 12 freq utj (2) - 1 freq upd (2) - 1 freq ftd (2) - 1 freq uth (2) - 1 freq utq (2) - 2 freq utb (2) - 1 freq uid (2) - 1 freq 'ad (3) - 1 freq it- (3) - 5 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 - UTT utd - 11 freq |
UTD |
| Time to execute Levenshtein function - 0.190992 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.335412 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.028308 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.037420 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.000786 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. |