Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nonacjiims (0) - 1 freq conscious (5) - 24 freq conceits (5) - 2 freq oncoms (5) - 1 freq donations (5) - 2 freq loganjimt (5) - 1 freq notaries (5) - 2 freq oncums (5) - 2 freq nooatimes (5) - 1 freq nocardia's (5) - 1 freq monarchists (5) - 2 freq novations (5) - 1 freq aonachain (5) - 1 freq racisms (5) - 1 freq nonces (5) - 2 freq concious (5) - 4 freq nomadism (5) - 1 freq confirms (5) - 10 freq nancies (5) - 1 freq doactirs (5) - 1 freq concairns (5) - 1 freq foarjir's (5) - 1 freq solecisms (5) - 2 freq paackies (6) - 2 freq poraamis (6) - 1 freq |
nonacjiims (0) - 1 freq nancies (7) - 1 freq oncums (7) - 2 freq oncoms (7) - 1 freq nonces (7) - 2 freq concairns (8) - 1 freq concious (8) - 4 freq solecisms (8) - 2 freq nuncy's (8) - 1 freq nancy's (8) - 1 freq nickums (8) - 1 freq unicorms (8) - 1 freq racisms (8) - 1 freq confirms (8) - 10 freq conceits (8) - 2 freq nooatimes (8) - 1 freq nance's (8) - 1 freq connections (9) - 35 freq conundrums (9) - 1 freq unclips (9) - 1 freq oncomin (9) - 4 freq sclims (9) - 10 freq menaces (9) - 1 freq nannies (9) - 2 freq re-claims (9) - 1 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 - NNKJMS nonacjiims - 1 freq |
NONACJIIMS |
Time to execute Levenshtein function - 0.491488 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.689749 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.037483 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.069586 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.000848 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. |