| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| achievement (0) - 21 freq achievements (1) - 7 freq acheivement (2) - 1 freq achieve (4) - 35 freq meevement (4) - 3 freq mevement (4) - 1 freq agreement (4) - 35 freq achievin (4) - 3 freq aveisement (4) - 4 freq argiement (4) - 25 freq ameesement (4) - 2 freq achieving (4) - 1 freq achieved (4) - 14 freq achieves (4) - 1 freq muivement (4) - 36 freq aisement (4) - 2 freq achievers (4) - 1 freq assignment (5) - 3 freq impruvement (5) - 1 freq airgiement (5) - 2 freq involvement (5) - 13 freq alignment (5) - 2 freq arrangement (5) - 17 freq amazement (5) - 5 freq chinamen (5) - 1 freq |
achievement (0) - 21 freq achievements (2) - 7 freq acheivement (2) - 1 freq achievin (6) - 3 freq achieving (6) - 1 freq meevement (6) - 3 freq mevement (6) - 1 freq muivement (6) - 36 freq 'movement (7) - 1 freq pavement (7) - 54 freq casement (7) - 3 freq chinamen (7) - 1 freq muvement (7) - 4 freq muivment (7) - 5 freq movement (7) - 68 freq 'moavement (7) - 1 freq cement (7) - 27 freq shipment (7) - 1 freq cavemen (7) - 1 freq bereavement (7) - 4 freq aisement (7) - 2 freq ameesement (7) - 2 freq achieved (7) - 14 freq achieves (7) - 1 freq argiement (7) - 25 freq |
SoundEx code - A215 achievement - 21 freq achievements - 7 freq acheivement - 1 freq accepin - 1 freq a'ghobhainn - 1 freq achievin - 3 freq aik-panelled - 1 freq aspen - 9 freq acceppin - 3 freq acupuncture - 1 freq azpnofbgol - 1 freq achieving - 1 freq |
MetaPhone code - AXFMNT achievement - 21 freq acheivement - 1 freq |
ACHIEVEMENT |
| Time to execute Levenshtein function - 0.207206 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.354808 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.031053 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.038557 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.000867 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. |