| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noncombatant (0) - 1 freq concomitant (3) - 1 freq nonchalant (4) - 2 freq combatants (4) - 1 freq noncommittal (5) - 1 freq incompetent (5) - 2 freq non-sibilant (5) - 1 freq inconstant (5) - 1 freq accountant (6) - 1 freq compaart (6) - 1 freq concairnt (6) - 3 freq consonant (6) - 15 freq oonimportant (6) - 4 freq commaand (6) - 4 freq compliant (6) - 1 freq consultant (6) - 6 freq accoontant (6) - 5 freq joecovenant (6) - 4 freq nonchalantly (6) - 1 freq encompasst (6) - 1 freq competent (6) - 3 freq oncomin (6) - 4 freq conglomerant (6) - 1 freq competan (6) - 2 freq constant (6) - 72 freq |
noncombatant (0) - 1 freq concomitant (5) - 1 freq incompetent (7) - 2 freq nonchalant (7) - 2 freq combatants (7) - 1 freq inconstant (8) - 1 freq noncommittal (8) - 1 freq non-sibilant (8) - 1 freq incumbent (8) - 2 freq competent (9) - 3 freq non-existent (9) - 5 freq acoontant (10) - 1 freq enunciatin (10) - 1 freq incoman (10) - 1 freq combat (10) - 5 freq concoctin (10) - 1 freq non-committal (10) - 1 freq enjambment (10) - 1 freq encampment (10) - 1 freq incompetence (10) - 3 freq recumbent (10) - 2 freq contestant (10) - 1 freq non-commonity (10) - 1 freq incubation (10) - 1 freq nechatan (10) - 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 - NNKMTNT noncombatant - 1 freq |
NONCOMBATANT |
| Time to execute Levenshtein function - 0.285598 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.544233 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.028756 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.037230 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.000843 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. |