| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-smoker (0) - 1 freq on-spoken (3) - 1 freq non-speakers (4) - 3 freq boneshaker (4) - 1 freq non-starter (4) - 1 freq non-scots (4) - 3 freq non-spikkers (4) - 2 freq non-stop (4) - 5 freq smoker (4) - 2 freq non-runner (4) - 1 freq connswater (5) - 2 freq hooker (5) - 4 freq consolet (5) - 1 freq on-come (5) - 1 freq onceover (5) - 1 freq handsomer (5) - 1 freq monastier (5) - 6 freq nonsence (5) - 1 freq november (5) - 86 freq non-votin (5) - 1 freq pensioner (5) - 12 freq nonsense- (5) - 2 freq consither (5) - 10 freq smoke (5) - 116 freq non-violent (5) - 1 freq |
non-smoker (0) - 1 freq non-speakers (6) - 3 freq on-spoken (6) - 1 freq non-stop (7) - 5 freq non-runner (7) - 1 freq non-spikkers (7) - 2 freq smoker (7) - 2 freq non-scots (7) - 3 freq non-starter (7) - 1 freq boneshaker (7) - 1 freq non-work (8) - 1 freq bonnetmaker (8) - 3 freq non-members (8) - 1 freq dinsmore (8) - 2 freq dressmaker (8) - 1 freq non-folk (8) - 1 freq consumer (8) - 1 freq an-soor (8) - 1 freq dinsmoor (8) - 1 freq handsomer (8) - 1 freq conker (9) - 1 freq stoker (9) - 4 freq onysake (9) - 1 freq pipe-smokin (9) - 1 freq snooker (9) - 16 freq |
SoundEx code - N525 nonsense - 77 freq nonsense' - 1 freq non-accent - 1 freq nonagenarian - 1 freq non-committal - 1 freq non-commonity - 1 freq nansense - 1 freq name-caain - 1 freq nine-coonty - 1 freq noncommittal - 1 freq non-smoker - 1 freq noncombatant - 1 freq €œnonsense - 1 freq nonsensicaledonian - 1 freq naehamecomforts - 1 freq nonsinse - 1 freq nonsense- - 2 freq nonsence - 1 freq nonsensical - 1 freq nonacjiims - 1 freq |
MetaPhone code - NNSMKR non-smoker - 1 freq |
NON-SMOKER |
| Time to execute Levenshtein function - 0.207369 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.378274 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.033803 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.040035 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.000886 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. |