| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tionurtj (0) - 1 freq thourt (3) - 1 freq tinpot (4) - 3 freq tint' (4) - 3 freq pourt (4) - 2 freq snurts (4) - 1 freq aiorts (4) - 1 freq tintit (4) - 3 freq toult (4) - 1 freq fourth (4) - 34 freq i'north (4) - 1 freq ignurnt (4) - 1 freq tourin (4) - 5 freq timurd (4) - 1 freq tonto (4) - 5 freq timbuktu (4) - 2 freq tooners (4) - 1 freq toonty (4) - 2 freq tenures (4) - 1 freq torturt (4) - 1 freq tibur (4) - 2 freq dinnur (4) - 1 freq thougt (4) - 1 freq trout (4) - 6 freq himnorth (4) - 2 freq |
tionurtj (0) - 1 freq thourt (5) - 1 freq towart (6) - 54 freq tinints (6) - 2 freq toner (6) - 1 freq foonert (6) - 17 freq towarts (6) - 5 freq tint (6) - 218 freq inert (6) - 3 freq ignort (6) - 3 freq tinct (6) - 1 freq tinto (6) - 3 freq trouts (6) - 3 freq tints (6) - 3 freq snurty (6) - 1 freq innarts (6) - 1 freq tirrt (6) - 4 freq atourt (6) - 1 freq towert (6) - 1 freq tenure (6) - 4 freq athourt (6) - 5 freq tinkte (6) - 1 freq tonite (6) - 6 freq tourit (6) - 2 freq torty (6) - 1 freq |
SoundEx code - T563 thunnert - 2 freq temerity - 1 freq thunnered - 4 freq timmert - 1 freq timurd - 1 freq thunner-rider - 1 freq thummart - 2 freq €˜thummart - 1 freq timmered - 1 freq temerat - 1 freq tounward - 1 freq tenortuesday - 1 freq tionurtj - 1 freq timmorton - 1 freq |
MetaPhone code - XNRTJ tionurtj - 1 freq |
TIONURTJ |
| Time to execute Levenshtein function - 0.188983 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.384231 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.033343 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.039875 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.000960 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. |