| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ugliest (0) - 1 freq uglies (1) - 1 freq holiest (2) - 2 freq giest (2) - 1 freq glist (2) - 1 freq ugliness (2) - 1 freq uglier (2) - 1 freq erliest (2) - 1 freq aaldest (3) - 8 freq aldest (3) - 1 freq wurdiest (3) - 1 freq owldest (3) - 5 freq totiest (3) - 1 freq girst (3) - 2 freq luvlies (3) - 1 freq niest (3) - 2 freq juiciest (3) - 2 freq giess (3) - 5 freq puggies (3) - 25 freq aul'est (3) - 1 freq 'blist (3) - 1 freq bullies (3) - 6 freq grist (3) - 36 freq lies (3) - 143 freq dullies (3) - 2 freq |
ugliest (0) - 1 freq uglies (2) - 1 freq glist (2) - 1 freq erliest (3) - 1 freq giest (3) - 1 freq holiest (3) - 2 freq allest (4) - 1 freq glint (4) - 29 freq leest (4) - 12 freq loest (4) - 1 freq gist (4) - 12 freq earliest (4) - 19 freq guest (4) - 42 freq glert (4) - 1 freq blest (4) - 1 freq list (4) - 193 freq glegest (4) - 1 freq laest (4) - 48 freq airliest (4) - 6 freq 'lest (4) - 1 freq polist (4) - 4 freq oulest (4) - 5 freq gainst (4) - 3 freq ageest (4) - 2 freq glosst (4) - 1 freq |
SoundEx code - U242 uselessness - 1 freq uisless - 6 freq useless - 36 freq ugliest - 1 freq usless - 1 freq uiseless - 4 freq usual''s - 1 freq uissless - 1 freq uglies - 1 freq ukclx - 1 freq uaslkeuonw - 1 freq uclzxd - 1 freq uoacollections - 1 freq uselessfactsfaedavie - 1 freq ujlzla - 1 freq |
MetaPhone code - UKLST ugliest - 1 freq |
UGLIEST |
| Time to execute Levenshtein function - 0.316224 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.463712 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.029372 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.038255 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.000886 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. |