| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-functioning (0) - 1 freq functionins (5) - 2 freq non-fiction (5) - 4 freq functionin (5) - 3 freq conjunction (6) - 3 freq non-nation (6) - 1 freq non-subscribing (6) - 1 freq conjunctions (6) - 3 freq functional (7) - 11 freq dysfunctional (7) - 1 freq disfunctional (7) - 1 freq condeetionin (7) - 1 freq functions (7) - 27 freq injunction (7) - 1 freq functioned (7) - 1 freq dysfunctions (7) - 1 freq non-subscribin' (7) - 1 freq mentioning (7) - 2 freq function (7) - 32 freq air-conditioning (7) - 2 freq questioning (7) - 1 freq functionary (7) - 1 freq no-questions (7) - 2 freq conventionis (7) - 1 freq unquestionin (7) - 1 freq |
non-functioning (0) - 1 freq non-fiction (8) - 4 freq functionins (9) - 2 freq functionin (9) - 3 freq non-nation (10) - 1 freq air-conditioning (11) - 2 freq conjunctions (11) - 3 freq conjunction (11) - 3 freq non-subscribing (11) - 1 freq functionary (12) - 1 freq confiscating (12) - 1 freq announcing (12) - 4 freq functiont (12) - 1 freq confection (12) - 1 freq function (12) - 32 freq non-inclusion (12) - 1 freq mentioning (12) - 2 freq functions (12) - 27 freq dysfunctional (12) - 1 freq functional (12) - 11 freq injunction (12) - 1 freq disfunctional (12) - 1 freq dysfunctions (12) - 1 freq functioned (12) - 1 freq non-votin (13) - 1 freq |
SoundEx code - N515 non-functioning - 1 freq non-binary - 3 freq numbness - 3 freq numbing - 1 freq ninepence - 1 freq non-paiyment - 1 freq nonbinary - 1 freq |
MetaPhone code - NNFNKXNN |
NON-FUNCTIONING |
| Time to execute Levenshtein function - 0.329563 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.782688 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.084925 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.086037 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.001019 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. |