| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uaslkeuonw (0) - 1 freq waalkeen (5) - 1 freq almeron (5) - 1 freq walken (5) - 1 freq asken (5) - 4 freq unslung (5) - 1 freq basketbaw (5) - 5 freq walkeen (5) - 1 freq castleton (5) - 1 freq esslemont (5) - 3 freq askew (5) - 2 freq carleton (5) - 1 freq takecon (5) - 1 freq caledons (5) - 2 freq makeen (6) - 1 freq alhena (6) - 1 freq basket (6) - 62 freq walterin (6) - 3 freq allow (6) - 36 freq simeon (6) - 8 freq fashun (6) - 2 freq upthedons (6) - 2 freq darkening (6) - 1 freq mastodon (6) - 1 freq unkent (6) - 52 freq |
uaslkeuonw (0) - 1 freq sleekin (7) - 5 freq askew (7) - 2 freq sulken (7) - 1 freq sleekan (7) - 1 freq walkeen (7) - 1 freq silken (7) - 10 freq walken (7) - 1 freq asken (7) - 4 freq waalkeen (7) - 1 freq talking (8) - 56 freq kilkenny (8) - 1 freq malkyne (8) - 10 freq slunk (8) - 8 freq talkan (8) - 18 freq saltoun (8) - 3 freq skew (8) - 1 freq walkin (8) - 299 freq balkan (8) - 1 freq salmon (8) - 46 freq askin' (8) - 5 freq waalkin (8) - 6 freq saloons (8) - 1 freq laeken (8) - 1 freq slung (8) - 14 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 - USLKN uaslkeuonw - 1 freq |
UASLKEUONW |
| Time to execute Levenshtein function - 0.193063 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.411415 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.028971 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.040434 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.000971 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. |