| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nonsensical (0) - 1 freq consensual (3) - 1 freq congenial (4) - 2 freq nonsense (4) - 77 freq notseasick (4) - 1 freq nosenicky (4) - 1 freq nonsence (4) - 1 freq nonsense- (4) - 2 freq nonsense' (4) - 1 freq nansense (5) - 1 freq polemical (5) - 1 freq canonical (5) - 1 freq ronseal (5) - 1 freq classical (5) - 28 freq poetical (5) - 3 freq nonpolitical (5) - 1 freq insensin (5) - 2 freq nonsinse (5) - 1 freq consensus (5) - 9 freq forensic (5) - 3 freq sansica (5) - 1 freq conventicle (5) - 10 freq numerical (5) - 1 freq consonantal (5) - 1 freq identical (5) - 19 freq |
nonsensical (0) - 1 freq consensual (5) - 1 freq nonsense- (6) - 2 freq nonsence (6) - 1 freq nonsense' (6) - 1 freq nonsense (6) - 77 freq nosenicky (7) - 1 freq nansense (7) - 1 freq nonsinse (7) - 1 freq notseasick (7) - 1 freq clessical (8) - 6 freq consonantal (8) - 1 freq unseasonal (8) - 1 freq nonense (8) - 1 freq conventicle (8) - 10 freq donnanicol (8) - 2 freq oonsocial (8) - 1 freq louisenicol (8) - 152 freq sansica (8) - 1 freq nonpolitical (8) - 1 freq canonical (8) - 1 freq classical (8) - 28 freq insensin (8) - 2 freq congenial (8) - 2 freq consensus (8) - 9 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 - NNSNSKL nonsensical - 1 freq |
NONSENSICAL |
| Time to execute Levenshtein function - 0.425853 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.695757 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.030484 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.040102 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.002351 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. |