| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| achievements (0) - 7 freq achievement (1) - 21 freq acheivement (3) - 1 freq achieves (4) - 1 freq argiements (4) - 11 freq muivements (4) - 8 freq agreements (4) - 2 freq activeests (4) - 1 freq agiements (4) - 1 freq achievers (4) - 1 freq assessments (5) - 4 freq muivments (5) - 1 freq improvements (5) - 7 freq achievin (5) - 3 freq agreement (5) - 36 freq entitlements (5) - 1 freq clements (5) - 1 freq meevement (5) - 3 freq moavements (5) - 1 freq 'greements (5) - 2 freq amenments (5) - 1 freq anooncements (5) - 2 freq pavements (5) - 26 freq ameesement (5) - 2 freq meuvements (5) - 1 freq |
achievements (0) - 7 freq achievement (2) - 21 freq acheivement (4) - 1 freq muivements (6) - 8 freq clements (7) - 1 freq moavements (7) - 1 freq meuvements (7) - 1 freq movements (7) - 12 freq muivments (7) - 1 freq pavements (7) - 26 freq muvements (7) - 3 freq activeests (7) - 1 freq argiements (7) - 11 freq achieves (7) - 1 freq agiements (7) - 1 freq agreements (7) - 2 freq achievers (7) - 1 freq comments (8) - 65 freq mevement (8) - 1 freq airguements (8) - 2 freq accidents (8) - 1 freq adherents (8) - 8 freq airmaments (8) - 1 freq muivement (8) - 37 freq cheviots (8) - 1 freq |
SoundEx code - A215 achievement - 21 freq aspen - 10 freq achievements - 7 freq acheivement - 1 freq accepin - 1 freq a'ghobhainn - 1 freq achievin - 3 freq aik-panelled - 1 freq acceppin - 3 freq acupuncture - 1 freq azpnofbgol - 1 freq achieving - 1 freq |
MetaPhone code - AXFMNTS achievements - 7 freq |
ACHIEVEMENTS |
| Time to execute Levenshtein function - 0.205461 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.362136 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.027352 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.037553 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.000938 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. |