| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-dairy (0) - 1 freq non-pairty (2) - 1 freq donsdaiiy (3) - 6 freq non-paid (3) - 1 freq monday (4) - 231 freq modairn (4) - 7 freq non-binary (4) - 3 freq contrair (4) - 8 freq boondary (4) - 5 freq yin-pairty (4) - 2 freq notary (4) - 2 freq concaity (4) - 1 freq to-day (4) - 1 freq dairy (4) - 28 freq bin-cairt (4) - 1 freq concairn (4) - 8 freq non-work (4) - 1 freq conthrairy (4) - 1 freq jonsbaird (4) - 5 freq nonbinary (4) - 1 freq honorary (4) - 2 freq one-day (4) - 1 freq cowdary (4) - 1 freq nor-aist (4) - 3 freq onymair (4) - 38 freq |
non-dairy (0) - 1 freq non-pairty (4) - 1 freq non-paid (5) - 1 freq nonbinary (6) - 1 freq one-day (6) - 1 freq annidir (6) - 1 freq non-work (6) - 1 freq anundir (6) - 1 freq boondary (6) - 5 freq boundary (6) - 2 freq donsdaiiy (6) - 6 freq non-binary (6) - 3 freq nadir (7) - 1 freq open-air (7) - 3 freq doon-cry (7) - 1 freq unnder (7) - 1 freq bandeira (7) - 1 freq bandara (7) - 11 freq donder (7) - 2 freq anndra (7) - 2 freq neddir (7) - 3 freq ndry (7) - 2 freq win-dried (7) - 1 freq sundry (7) - 5 freq ran-dan (7) - 2 freq |
SoundEx code - N536 name-drappin - 2 freq non-adherence - 1 freq non-dramein - 1 freq non-traivellers - 1 freq nendrum - 3 freq neanderthals - 19 freq neanderthal - 4 freq no-entirely-reliable - 1 freq non-dairy - 1 freq naewonderfokegettoothachewhentheysiyow - 1 freq |
MetaPhone code - NNTR non-dairy - 1 freq |
NON-DAIRY |
| Time to execute Levenshtein function - 0.221342 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.410255 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.030254 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.042139 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.001026 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. |