| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheelchair (0) - 14 freq wheelchairs (1) - 1 freq wheelcheer (2) - 4 freq creel-chair (3) - 1 freq wheelchyre (3) - 3 freq wheechin (3) - 40 freq wheechit (3) - 2 freq wheecher (3) - 2 freq weel-faur (4) - 1 freq wheechs (4) - 10 freq weelcam (4) - 2 freq heecher (4) - 1 freq wheech (4) - 90 freq heetchid (4) - 1 freq weel-lairt (4) - 1 freq wheechin' (4) - 1 freq wheelie (4) - 13 freq wheeshtin (4) - 2 freq wheeshtit (4) - 7 freq deckchair (4) - 2 freq wheichit (4) - 1 freq wheelbarra (4) - 4 freq weechil (4) - 2 freq whethir (4) - 3 freq wheelin (4) - 12 freq |
wheelchair (0) - 14 freq wheelcheer (2) - 4 freq wheelchairs (2) - 1 freq wheelchyre (3) - 3 freq wheecher (4) - 2 freq wheechit (5) - 2 freq wheechin (5) - 40 freq whethir (6) - 3 freq wheecht (6) - 10 freq wheichit (6) - 1 freq wheelbarra (6) - 4 freq wheeched (6) - 47 freq heecher (6) - 1 freq wheelter (6) - 16 freq wheeler (6) - 4 freq creel-chair (6) - 1 freq wheechs (6) - 10 freq wheech (6) - 90 freq sheanchara (7) - 1 freq wheelhouse (7) - 2 freq wheelhoose (7) - 9 freq welcomer (7) - 1 freq wheel-nave (7) - 2 freq wheither (7) - 1 freq helcht (7) - 1 freq |
SoundEx code - W426 walker - 25 freq weel-wishers - 3 freq weel-wushers - 1 freq wheelchair - 14 freq walker's - 5 freq waalker's - 2 freq walkers - 18 freq walkers' - 1 freq weel-creeshed - 1 freq weel-cared - 1 freq wheelcheer - 4 freq weill-cordit - 1 freq willsher - 1 freq weill-graithit - 1 freq weel-groomed - 1 freq wheelchairs - 1 freq wheelchyre - 3 freq weel-grundit - 1 freq walkcork - 1 freq wlsqqraasf - 1 freq wilshire - 2 freq walkers - 1 freq |
MetaPhone code - WLXR wheelchair - 14 freq wheelcheer - 4 freq willsher - 1 freq wheelchyre - 3 freq wilshire - 2 freq |
WHEELCHAIR |
| Time to execute Levenshtein function - 0.179984 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.376907 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.027169 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.037780 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.000828 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. |