| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nonsence (0) - 1 freq nonsense (1) - 77 freq nansense (2) - 1 freq nonsense' (2) - 1 freq nonsinse (2) - 1 freq nonense (2) - 1 freq nonsense- (2) - 2 freq noteece (3) - 1 freq offence (3) - 35 freq commence (3) - 4 freq conscience (3) - 45 freq nopiece (3) - 2 freq consented (3) - 1 freq consent (3) - 11 freq confrence (3) - 1 freq vosene (3) - 1 freq insece (3) - 1 freq consentet (3) - 1 freq convince (3) - 41 freq donenae (3) - 1 freq condense (3) - 2 freq sence (3) - 1 freq €œnonsense (3) - 1 freq concience (3) - 1 freq onyene (3) - 1 freq |
nonsence (0) - 1 freq nonsense (2) - 77 freq nansense (3) - 1 freq nonsinse (3) - 1 freq ninepence (4) - 1 freq nuisance (4) - 8 freq nonsense- (4) - 2 freq nonense (4) - 1 freq nonsense' (4) - 1 freq innocence (5) - 18 freq presence (5) - 69 freq conveence (5) - 1 freq concience (5) - 1 freq essence (5) - 12 freq nsync (5) - 1 freq annoonce (5) - 4 freq sence (5) - 1 freq countence (5) - 1 freq sentence (5) - 136 freq absence (5) - 20 freq insense (5) - 7 freq consent (5) - 11 freq conscience (5) - 45 freq insece (5) - 1 freq convince (5) - 41 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 |
NONSENCE |
| Time to execute Levenshtein function - 0.201164 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.373963 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.028324 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.038166 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.000892 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. |