| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| useless (0) - 36 freq uiseless (1) - 4 freq usless (1) - 1 freq uisless (2) - 6 freq ageless (2) - 5 freq daeless (2) - 4 freq eeseless (2) - 6 freq eyeless (2) - 1 freq rueless (2) - 1 freq yuiseless (2) - 2 freq luveless (2) - 1 freq uissless (2) - 1 freq unless (2) - 139 freq tuneless (2) - 2 freq sealess (2) - 1 freq wameless (3) - 1 freq teenless (3) - 1 freq seeds (3) - 47 freq furmless (3) - 1 freq giless (3) - 4 freq recess (3) - 3 freq tashless (3) - 3 freq restless (3) - 15 freq jagless (3) - 3 freq dinless (3) - 1 freq |
useless (0) - 36 freq uiseless (1) - 4 freq usless (1) - 1 freq yuiseless (2) - 2 freq eeseless (2) - 6 freq sealess (2) - 1 freq uisless (2) - 6 freq sloss (3) - 2 freq yisless (3) - 3 freq daeless (3) - 4 freq unless (3) - 139 freq uissless (3) - 1 freq eyeless (3) - 1 freq rueless (3) - 1 freq ageless (3) - 5 freq noiseless (4) - 1 freq sunless (4) - 1 freq soles (4) - 17 freq bless (4) - 44 freq serss (4) - 1 freq 'aless (4) - 1 freq airless (4) - 1 freq seamless (4) - 5 freq isles (4) - 84 freq cless (4) - 131 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 - USLS uisless - 6 freq useless - 36 freq usless - 1 freq uiseless - 4 freq usual''s - 1 freq uissless - 1 freq |
USELESS |
| Time to execute Levenshtein function - 0.213810 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.368875 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.028565 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.042286 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.000862 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. |