| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheelchair (0) - 14 freq wheelchairs (1) - 1 freq wheelcheer (2) - 4 freq wheecher (3) - 2 freq wheelchyre (3) - 3 freq wheechit (3) - 2 freq wheechin (3) - 40 freq creel-chair (3) - 1 freq wheeshtin (4) - 2 freq ex-chair (4) - 1 freq weel-faur (4) - 1 freq heetchid (4) - 1 freq wheelan (4) - 1 freq weelcam (4) - 2 freq wheecht (4) - 10 freq cheenchis (4) - 2 freq wheeshtit (4) - 7 freq wheeler (4) - 4 freq wheichit (4) - 1 freq wheeshtie (4) - 3 freq wheelbarra (4) - 4 freq weel-lairt (4) - 1 freq weechil (4) - 2 freq wheechs (4) - 11 freq wheechled (4) - 1 freq |
wheelchair (0) - 14 freq wheelcheer (2) - 4 freq wheelchairs (2) - 1 freq wheelchyre (3) - 3 freq wheecher (4) - 2 freq wheechin (5) - 40 freq wheechit (5) - 2 freq wheechs (6) - 11 freq wheelbarra (6) - 4 freq wheichit (6) - 1 freq wheech (6) - 91 freq wheelter (6) - 16 freq wheeched (6) - 47 freq heecher (6) - 1 freq whethir (6) - 3 freq wheeler (6) - 4 freq wheecht (6) - 10 freq creel-chair (6) - 1 freq sheanchara (7) - 1 freq melchior (7) - 1 freq whaethur (7) - 1 freq wheichs (7) - 1 freq wheither (7) - 1 freq welch (7) - 4 freq wheelhouse (7) - 2 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.206626 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.383950 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.027351 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.037467 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.000914 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. |