| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whirls (0) - 3 freq thirls (1) - 5 freq whirl (1) - 10 freq whurls (1) - 1 freq whorls (1) - 1 freq whirlt (1) - 3 freq chirls (1) - 2 freq wheels (2) - 83 freq while (2) - 1458 freq weires (2) - 1 freq whirrr (2) - 2 freq nirls (2) - 1 freq whirlin (2) - 5 freq whisps (2) - 1 freq wires (2) - 27 freq wills (2) - 3 freq weirs (2) - 25 freq phials (2) - 1 freq whits (2) - 47 freq wirlds (2) - 3 freq wheils (2) - 1 freq wirks (2) - 50 freq whirlies (2) - 2 freq whirlan (2) - 1 freq hurls (2) - 4 freq |
whirls (0) - 3 freq whorls (1) - 1 freq whurls (1) - 1 freq whirlt (2) - 3 freq whirlies (2) - 2 freq chirls (2) - 2 freq whirl (2) - 10 freq thirls (2) - 5 freq whiles (3) - 479 freq whurs (3) - 1 freq whirlit (3) - 1 freq whirlan (3) - 1 freq hurls (3) - 4 freq whurl (3) - 2 freq whirlie (3) - 2 freq worls (3) - 5 freq whur's (3) - 1 freq whar's (3) - 9 freq warls (3) - 4 freq wheils (3) - 1 freq wheres (3) - 9 freq whars (3) - 3 freq whores (3) - 2 freq wheels (3) - 83 freq wharas (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 |
WHIRLS |
| Time to execute Levenshtein function - 0.501079 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.724929 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.074179 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.082467 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.001214 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. |