Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uteilitie (0) - 1 freq futilitie (2) - 1 freq abeilitie (2) - 2 freq civilitie (3) - 1 freq nobilitie (3) - 1 freq uinitie (3) - 1 freq utility (3) - 7 freq abeelitie (3) - 4 freq utiltiy (3) - 1 freq habeilitie (3) - 1 freq speiritie (3) - 2 freq futilities (3) - 1 freq eternitie (3) - 8 freq civeilitie (3) - 1 freq uteelity (3) - 1 freq abilitie (3) - 1 freq stabilitie (3) - 1 freq humilitie (3) - 1 freq humelitie (3) - 1 freq realitie (3) - 2 freq acteivitie (3) - 2 freq abeilities (3) - 2 freq raelitie (3) - 2 freq sweirtie (4) - 2 freq authoritie (4) - 5 freq |
uteilitie (0) - 1 freq utility (3) - 7 freq utiltiy (3) - 1 freq uteelity (3) - 1 freq futilitie (3) - 1 freq abeilitie (3) - 2 freq teltye (4) - 1 freq realitie (4) - 2 freq abeelitie (4) - 4 freq raelitie (4) - 2 freq abilitie (4) - 1 freq telit (4) - 1 freq tuilyie (5) - 2 freq toilet (5) - 93 freq telt (5) - 1569 freq equalitie (5) - 4 freq tellie (5) - 13 freq kiltie (5) - 5 freq veilit (5) - 1 freq taistie (5) - 1 freq qualitie (5) - 12 freq delite (5) - 4 freq lealtie (5) - 9 freq abeility (5) - 4 freq tuilie (5) - 1 freq |
SoundEx code - U343 utiltiy - 1 freq utility - 7 freq uteilitie - 1 freq utilitarianism - 1 freq uteelity - 1 freq €˜uteelitarian - 1 freq uteelitarianism - 1 freq 'utilitza - 1 freq utilitafootball - 1 freq |
MetaPhone code - UTLT utiltiy - 1 freq utility - 7 freq uteilitie - 1 freq uteelity - 1 freq |
UTEILITIE |
Time to execute Levenshtein function - 0.238084 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.412921 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.032012 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.046957 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.001363 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. |