Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
additioinal (0) - 1 freq additional (1) - 14 freq additioun (3) - 1 freq addeetional (3) - 3 freq addition's (3) - 1 freq addition (3) - 17 freq conditional (4) - 2 freq tradeitional (4) - 22 freq naitiounal (4) - 1 freq addictions (4) - 4 freq attitudinal (4) - 1 freq positional (4) - 1 freq traditional (4) - 68 freq addeitionally (4) - 1 freq eddicational (4) - 6 freq audition (4) - 8 freq addeition (4) - 3 freq naitional (4) - 23 freq auditions (4) - 1 freq auditionin (4) - 4 freq addiction (4) - 9 freq €˜national (5) - 3 freq admitting (5) - 1 freq adoption (5) - 16 freq sedition (5) - 7 freq |
additioinal (0) - 1 freq additional (1) - 14 freq addeetional (3) - 3 freq addition (4) - 17 freq additioun (4) - 1 freq addeitionally (5) - 1 freq eddicational (5) - 6 freq addeition (5) - 3 freq addition's (5) - 1 freq auditionin (6) - 4 freq auditions (6) - 1 freq naitiounal (6) - 1 freq edicational (6) - 2 freq addeetioun (6) - 2 freq addeetion (6) - 3 freq naitional (6) - 23 freq addiction (6) - 9 freq educational (6) - 55 freq tradeitional (6) - 22 freq addictions (6) - 4 freq positional (6) - 1 freq audition (6) - 8 freq traditional (6) - 68 freq conditional (6) - 2 freq addishanel (7) - 1 freq |
SoundEx code - A335 addition's - 1 freq audition - 8 freq addition - 17 freq auditionin - 4 freq additional - 14 freq addeetioun - 2 freq auditions - 1 freq additioinal - 1 freq auditin' - 1 freq additioun - 1 freq addeition - 3 freq addeetional - 3 freq athooten - 1 freq addeitionally - 1 freq addeetion - 3 freq athouten - 2 freq |
MetaPhone code - ATXNL additional - 14 freq additioinal - 1 freq addeetional - 3 freq addeitionally - 1 freq addishanel - 1 freq |
ADDITIOINAL |
Time to execute Levenshtein function - 0.254383 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.423221 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.029750 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.037998 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.000979 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. |