| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-thraan (0) - 1 freq ill-thoat (3) - 1 freq ice-thrawn (3) - 1 freq ill-taen (3) - 2 freq ill-turn (3) - 1 freq ill-burnan (3) - 1 freq ill-dain (4) - 1 freq gull-threap (4) - 1 freq thraan (4) - 12 freq ill-teen (4) - 1 freq ill-farrand (4) - 1 freq ill-farrant (4) - 1 freq wind-thrawn (4) - 1 freq illiterate (4) - 3 freq win-thrawn (4) - 1 freq ill-thoche (4) - 1 freq ill-hertit (5) - 7 freq illustrate (5) - 14 freq ill-gotten (5) - 1 freq ill-wysin (5) - 1 freq blythman (5) - 1 freq ill-place (5) - 2 freq ill-tidins (5) - 1 freq ill-fun (5) - 1 freq thraa (5) - 5 freq |
ill-thraan (0) - 1 freq ill-turn (4) - 1 freq ill-thoat (5) - 1 freq ill-taen (5) - 2 freq ill-teen (6) - 1 freq gull-threap (6) - 1 freq ill-burnan (6) - 1 freq ill-thoche (6) - 1 freq ice-thrawn (6) - 1 freq lutheran (7) - 1 freq blethrin (7) - 1 freq win-thrawn (7) - 1 freq bletheran (7) - 1 freq ill-farrand (7) - 1 freq thraan (7) - 12 freq ill-dain (7) - 1 freq illiterate (7) - 3 freq ill-farrant (7) - 1 freq blakthoarn (7) - 1 freq clestrain (8) - 1 freq glentoran (8) - 1 freq intherain (8) - 1 freq ill-omen (8) - 1 freq sky-train (8) - 2 freq glitteran (8) - 1 freq |
SoundEx code - I436 ill-daers - 1 freq ill-trickit - 14 freq illtrickit - 2 freq ill-traetit - 1 freq ill-turn - 1 freq ill-trickid - 3 freq ill-thraan - 1 freq ill-trivven - 1 freq ill-treatit - 1 freq illeeterate - 2 freq ill-doers - 1 freq illiterate - 3 freq €˜illiteracy - 1 freq ill-trikkit - 1 freq ‘illiterate - 1 freq |
MetaPhone code - IL0RN ill-thraan - 1 freq |
ILL-THRAAN |
| Time to execute Levenshtein function - 0.281774 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.543004 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.031613 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.039779 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.000918 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. |