| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceleration (0) - 1 freq acceleratit (2) - 3 freq accelerates (3) - 1 freq accelerate (3) - 1 freq accelerated (3) - 2 freq accelerators (3) - 1 freq aleeteration (3) - 1 freq celebration (3) - 46 freq acclamation (3) - 2 freq leeberation (4) - 1 freq alteration (4) - 1 freq accreditation (4) - 2 freq celebratin (4) - 24 freq i'celebrations (4) - 1 freq appellation (4) - 4 freq federation (4) - 3 freq celebratioun (4) - 1 freq scunneration (4) - 5 freq celebrations (4) - 15 freq regeneration (4) - 3 freq €œcelebratin (4) - 1 freq delegation (4) - 7 freq acceleraetors (4) - 1 freq cancellation (4) - 3 freq aberration (4) - 2 freq |
acceleration (0) - 1 freq acceleratit (3) - 3 freq accelerated (4) - 2 freq accelerate (4) - 1 freq acclamation (4) - 2 freq accelerates (4) - 1 freq declaration (5) - 69 freq celebration (5) - 46 freq accelerators (5) - 1 freq cooperation (6) - 3 freq cancellation (6) - 3 freq toleration (6) - 2 freq accusation (6) - 8 freq celebraetion (6) - 1 freq accumulation (6) - 1 freq celebratioun (6) - 1 freq acceleraetors (6) - 1 freq aleeteration (6) - 1 freq celebratin (6) - 24 freq exhilaration (7) - 1 freq conjuration (7) - 2 freq co-operation (7) - 5 freq declartin (7) - 1 freq declaration' (7) - 4 freq calculation (7) - 3 freq |
SoundEx code - A246 acceleration - 1 freq accelerated - 2 freq accelerate - 1 freq auxiliary - 16 freq accelerators - 1 freq auxiliar - 2 freq auxuliar - 1 freq acceleraetors - 1 freq ashlar - 1 freq acceleratit - 3 freq auxiliaries - 11 freq ashlars - 2 freq auxiliarly - 1 freq accelerates - 1 freq aguilera - 1 freq |
MetaPhone code - AKSLRXN acceleration - 1 freq |
ACCELERATION |
| Time to execute Levenshtein function - 0.201000 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.374959 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.027896 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.041748 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.001281 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. |