| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weel-heeled (0) - 1 freq well-heeled (1) - 1 freq weel-waled (3) - 1 freq weel-kenned (3) - 1 freq weel-leared (3) - 3 freq weel-shewed (3) - 1 freq weel-iled (3) - 1 freq weel-fed (4) - 2 freq weel-earned (4) - 2 freq weel-wirked (4) - 1 freq weel-seen (4) - 2 freq weel-settle (4) - 1 freq weel-needit (4) - 1 freq mell-heided (4) - 2 freq weel-lo'ed (4) - 1 freq weel-yaised (4) - 2 freq weel-heukit (4) - 1 freq weel-lared (4) - 4 freq weel-used (4) - 1 freq weel-blessed (4) - 1 freq weel-thoomed (4) - 1 freq weelthoumed (4) - 1 freq weel-developed (4) - 1 freq weel-creeshed (4) - 1 freq weel-looed (4) - 1 freq |
weel-heeled (0) - 1 freq well-heeled (2) - 1 freq weel-waled (4) - 1 freq weel-iled (4) - 1 freq weel-looed (5) - 1 freq weel-shewed (5) - 1 freq weel-leared (5) - 3 freq weel-wared (6) - 2 freq wheeled (6) - 14 freq weel-airmed (6) - 2 freq weel-luved (6) - 1 freq weelthoumed (6) - 1 freq weel-tuned (6) - 1 freq weel-cared (6) - 1 freq weel-thoomed (6) - 1 freq weel-faured (6) - 3 freq weel-loved (6) - 1 freq weel-chowed (6) - 1 freq weel-uised (6) - 1 freq weel-earned (6) - 2 freq weel-fed (6) - 2 freq weel-yaised (6) - 2 freq weel-lo'ed (6) - 1 freq weel-heukit (6) - 1 freq weel-lared (6) - 4 freq |
SoundEx code - W443 weel-iled - 1 freq weel-heeled - 1 freq weel-waled - 1 freq well-heeled - 1 freq |
MetaPhone code - WLHLT weel-heeled - 1 freq well-heeled - 1 freq |
WEEL-HEELED |
| Time to execute Levenshtein function - 0.270844 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.420467 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.028086 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.039306 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.000967 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. |