| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whorls (0) - 1 freq whirls (1) - 3 freq whores (1) - 2 freq worls (1) - 5 freq whurls (1) - 1 freq houls (2) - 10 freq whirl (2) - 10 freq who's (2) - 77 freq whore (2) - 1 freq thors (2) - 1 freq thorns (2) - 20 freq whore' (2) - 1 freq horns (2) - 43 freq who'll (2) - 6 freq whorlin (2) - 1 freq whoors (2) - 1 freq whoor's (2) - 1 freq shoals (2) - 2 freq whar's (2) - 9 freq chirls (2) - 2 freq whurs (2) - 1 freq wheres (2) - 9 freq whur's (2) - 1 freq worms (2) - 22 freq worl's (2) - 1 freq |
whorls (0) - 1 freq whirls (1) - 3 freq whurls (1) - 1 freq whores (2) - 2 freq worls (2) - 5 freq wheils (3) - 1 freq whirlt (3) - 3 freq whaals (3) - 4 freq whurs (3) - 1 freq warls (3) - 4 freq wheres (3) - 9 freq whur's (3) - 1 freq wharas (3) - 1 freq thirls (3) - 5 freq whirlies (3) - 2 freq whars (3) - 3 freq chirls (3) - 2 freq whurl (3) - 2 freq hurls (3) - 4 freq wheels (3) - 83 freq whorlin (3) - 1 freq whar's (3) - 9 freq whoors (3) - 1 freq whirl (3) - 10 freq whoor's (3) - 1 freq |
SoundEx code - W642 warlock - 43 freq weerless - 2 freq whirligig - 2 freq whirlies - 2 freq warlocks - 5 freq warl's - 6 freq whirliegig - 1 freq wireless - 55 freq warls - 4 freq worls - 5 freq wirelesses - 1 freq worl's - 1 freq warliewise - 1 freq warlie-wise - 1 freq warlockry - 3 freq warlock's - 8 freq wheer-laek - 1 freq wyreless - 4 freq whurls - 1 freq whirls - 3 freq whorls - 1 freq warlock-kirtle - 1 freq weirlik - 1 freq 'wireless' - 1 freq wirelessheid - 1 freq weiralison - 3 freq |
MetaPhone code - WRLS weerless - 2 freq whirlies - 2 freq warl's - 6 freq wireless - 55 freq warls - 4 freq worls - 5 freq worl's - 1 freq whurls - 1 freq whirls - 3 freq whorls - 1 freq 'wireless' - 1 freq |
WHORLS |
| Time to execute Levenshtein function - 0.234577 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.415186 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.032984 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.045626 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.000940 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. |