| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-committal (0) - 1 freq noncommittal (1) - 1 freq un-committal (2) - 1 freq non-commonity (5) - 1 freq pre-committin (5) - 1 freq committit (6) - 12 freq noncombatant (6) - 1 freq commita (6) - 1 freq concomitant (6) - 1 freq post-coital (6) - 1 freq non-lethal (6) - 1 freq committin (6) - 2 freq committee (6) - 25 freq committed (6) - 23 freq nonpolitical (6) - 1 freq comical (7) - 4 freq discomfittit (7) - 1 freq documenttak (7) - 1 freq non-scots (7) - 3 freq in-comin (7) - 1 freq committaris (7) - 1 freq nominal (7) - 1 freq non-creative (7) - 2 freq committees (7) - 2 freq commited (7) - 2 freq |
non-committal (0) - 1 freq noncommittal (2) - 1 freq un-committal (3) - 1 freq non-commonity (7) - 1 freq pre-committin (8) - 1 freq non-lethal (10) - 1 freq committee (10) - 25 freq committin (10) - 2 freq noncombatant (10) - 1 freq committit (10) - 12 freq committed (10) - 23 freq non-creative (11) - 2 freq committees (11) - 2 freq commitit (11) - 5 freq non-hamelt (11) - 2 freq sun-cossetted (11) - 1 freq nonpolitical (11) - 1 freq concomitant (11) - 1 freq commita (11) - 1 freq commeittit (11) - 1 freq non-politically (12) - 1 freq conflummixt (12) - 8 freq miscomfittin (12) - 1 freq commits (12) - 7 freq conceptual (12) - 3 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 - NNKMTL non-committal - 1 freq noncommittal - 1 freq |
NON-COMMITTAL |
| Time to execute Levenshtein function - 0.229057 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.426860 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.029560 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.040577 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.001014 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. |