| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nonsense- (0) - 2 freq nonsense' (1) - 1 freq nonsense (1) - 77 freq nonsinse (2) - 1 freq nonsence (2) - 1 freq nonense (2) - 1 freq nansense (2) - 1 freq condense (3) - 2 freq consentet (3) - 1 freq insense (3) - 7 freq €œnonsense (3) - 1 freq insenses (3) - 1 freq condensed (3) - 5 freq condenser (3) - 1 freq consented (3) - 1 freq consensus (3) - 9 freq insensed (3) - 4 freq offense (4) - 1 freq nories- (4) - 1 freq convened (4) - 3 freq converses (4) - 1 freq contened (4) - 1 freq conseider (4) - 9 freq noses (4) - 20 freq conserve (4) - 2 freq |
nonsense- (0) - 2 freq nonsense (2) - 77 freq nonsense' (2) - 1 freq nansense (3) - 1 freq nonsinse (3) - 1 freq nonense (4) - 1 freq nonsence (4) - 1 freq insensed (5) - 4 freq consensus (5) - 9 freq insenses (5) - 1 freq insense (5) - 7 freq consented (6) - 1 freq nonsensical (6) - 1 freq consensual (6) - 1 freq condenser (6) - 1 freq insensin (6) - 2 freq consentet (6) - 1 freq condense (6) - 2 freq €œnonsense (6) - 1 freq condensed (6) - 5 freq noises (7) - 33 freq absenses (7) - 1 freq incensed (7) - 3 freq sensed (7) - 18 freq senses (7) - 56 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 - NNSNS nonsense - 77 freq nonsense' - 1 freq nansense - 1 freq €œnonsense - 1 freq nonsinse - 1 freq nonsense- - 2 freq nonsence - 1 freq |
NONSENSE- |
| Time to execute Levenshtein function - 0.204635 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.383309 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.028527 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.039442 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.001213 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. |