| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noncommittal (0) - 1 freq non-committal (1) - 1 freq un-committal (3) - 1 freq committin (5) - 2 freq committed (5) - 23 freq nonpolitical (5) - 1 freq committit (5) - 12 freq commita (5) - 1 freq committee (5) - 25 freq concomitant (5) - 1 freq noncombatant (5) - 1 freq societal (6) - 4 freq pre-committin (6) - 1 freq commits (6) - 7 freq communal (6) - 7 freq commit (6) - 17 freq commisar (6) - 2 freq non-commonity (6) - 1 freq sociatal (6) - 2 freq committin' (6) - 1 freq conformist (6) - 1 freq commitit (6) - 5 freq committees (6) - 2 freq comical (6) - 4 freq pronominal (6) - 1 freq |
noncommittal (0) - 1 freq non-committal (2) - 1 freq un-committal (4) - 1 freq noncombatant (8) - 1 freq committee (8) - 25 freq committit (8) - 12 freq committed (8) - 23 freq committin (8) - 2 freq committees (9) - 2 freq commitit (9) - 5 freq non-commonity (9) - 1 freq concomitant (9) - 1 freq commita (9) - 1 freq nonpolitical (9) - 1 freq commeittit (9) - 1 freq documenttak (10) - 1 freq commited (10) - 2 freq ooncomfortable (10) - 4 freq discomfittit (10) - 1 freq committing (10) - 2 freq incompatible (10) - 2 freq uncommonly (10) - 4 freq nonchalantly (10) - 1 freq commattees (10) - 1 freq committaris (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 - NNKMTL non-committal - 1 freq noncommittal - 1 freq |
NONCOMMITTAL |
| Time to execute Levenshtein function - 0.231406 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.444074 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.028029 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.037493 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.001109 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. |