| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nane-descreivit (0) - 1 freq descreivit (5) - 5 freq descreivin (6) - 1 freq descrivit (6) - 2 freq nondescript (6) - 3 freq transcreivit (6) - 2 freq lang-craigit (7) - 1 freq descryvit (7) - 1 freq describit (7) - 3 freq deskreivin (7) - 1 freq descreive (7) - 3 freq transcreivin (7) - 1 freq deceivit (7) - 1 freq re-scrievit (7) - 1 freq e-screive (7) - 13 freq condescendit (7) - 1 freq descrivin (7) - 9 freq undescendit (7) - 1 freq descrievit (7) - 5 freq descreived (7) - 4 freq co-screivin (7) - 1 freq screivit (7) - 83 freq wanscrievit (7) - 1 freq descreeved (8) - 1 freq landscaepid (8) - 1 freq |
nane-descreivit (0) - 1 freq descreivit (8) - 5 freq nondescript (8) - 3 freq descrivit (9) - 2 freq re-scrievit (10) - 1 freq descrievit (10) - 5 freq wanscrievit (10) - 1 freq descryvit (10) - 1 freq transcreivit (10) - 2 freq descreivin (10) - 1 freq undescendit (11) - 1 freq descreived (11) - 4 freq screivit (11) - 83 freq co-screivin (11) - 1 freq descrivin (11) - 9 freq condescendit (11) - 1 freq describit (11) - 3 freq inscrievit (11) - 2 freq descreive (11) - 3 freq e-screive (11) - 13 freq undeservin (12) - 1 freq inscribit (12) - 2 freq descrievin (12) - 1 freq coansecraitit (12) - 1 freq manuscript (12) - 34 freq |
SoundEx code - N532 nineties - 7 freq nando's - 1 freq ninety-echt - 3 freq nomads - 1 freq ninety-seven - 1 freq nondescript - 3 freq ninety-sax - 2 freq ninetie-echt - 1 freq nunataks - 1 freq nane-descreivit - 1 freq noondays - 1 freq nomadism - 1 freq nane-the-wiser - 1 freq nomudsqs - 1 freq nooindays - 2 freq |
MetaPhone code - NNTSKRFT nane-descreivit - 1 freq |
NANE-DESCREIVIT |
| Time to execute Levenshtein function - 0.312526 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.503100 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.032640 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.037445 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.000899 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. |