| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utility (0) - 7 freq futility (1) - 3 freq uteelity (2) - 1 freq utiltiy (2) - 1 freq humility (2) - 2 freq agility (2) - 1 freq ability (2) - 44 freq ility (2) - 1 freq tilts (3) - 9 freq civility (3) - 1 freq abeility (3) - 2 freq activity (3) - 30 freq jollity (3) - 2 freq sailit (3) - 10 freq spirity (3) - 1 freq reality (3) - 115 freq quality (3) - 138 freq ettlit (3) - 3 freq sterility (3) - 1 freq tilt (3) - 30 freq coilit (3) - 1 freq stilly (3) - 1 freq unitit (3) - 29 freq unity (3) - 45 freq stilt (3) - 1 freq |
utility (0) - 7 freq uteelity (2) - 1 freq utiltiy (2) - 1 freq futility (2) - 3 freq tilt (3) - 30 freq uteilitie (3) - 1 freq ility (3) - 1 freq telit (3) - 1 freq agility (3) - 1 freq ability (3) - 44 freq quaality (4) - 5 freq futilitie (4) - 1 freq til't (4) - 40 freq teltye (4) - 1 freq tolta (4) - 1 freq vitality (4) - 4 freq lilty (4) - 1 freq polity (4) - 4 freq guilty (4) - 74 freq metaility (4) - 1 freq rilit (4) - 1 freq tilth (4) - 4 freq tunity (4) - 1 freq tltu (4) - 4 freq tilley (4) - 2 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 |
UTILITY |
| Time to execute Levenshtein function - 0.213988 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.358965 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.031022 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.038241 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.000878 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. |