| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amplified (0) - 1 freq amplifier (1) - 1 freq amplifies (1) - 1 freq amplifiers (2) - 1 freq simplified (2) - 2 freq anglified (2) - 2 freq applied (3) - 27 freq simplifeed (3) - 1 freq uplifted (3) - 3 freq amplifyin (3) - 2 freq anglifeed (3) - 1 freq bambified (3) - 1 freq simplifies (3) - 1 freq qualified (3) - 15 freq implied (3) - 2 freq amplify (3) - 2 freq inglified (3) - 4 freq modified (3) - 2 freq exemplified (3) - 1 freq plied (4) - 13 freq campaigned (4) - 1 freq applies (4) - 17 freq glorified (4) - 6 freq lilied (4) - 1 freq specified (4) - 3 freq |
amplified (0) - 1 freq amplifier (2) - 1 freq amplifies (2) - 1 freq simplified (3) - 2 freq amplify (4) - 2 freq amplifyin (4) - 2 freq exemplified (4) - 1 freq implied (4) - 2 freq amplifiers (4) - 1 freq anglified (4) - 2 freq simplifeed (4) - 1 freq modified (5) - 2 freq uplifted (5) - 3 freq imployed (5) - 2 freq employed (5) - 8 freq anglifeed (5) - 1 freq inglified (5) - 4 freq simplifies (5) - 1 freq applied (5) - 27 freq qualified (5) - 15 freq imploded (5) - 1 freq emptied (6) - 20 freq modifeed (6) - 1 freq spuilied (6) - 1 freq implies (6) - 9 freq |
SoundEx code - A514 anvilflush - 1 freq anvil - 5 freq amplify - 2 freq ambulance - 37 freq ambulances - 1 freq aimbulance - 3 freq ample - 9 freq anvils - 1 freq ainvils - 1 freq amble - 3 freq amblin - 3 freq ambles - 2 freq amplifies - 1 freq amplifiers - 1 freq annville - 1 freq amplified - 1 freq anbile - 1 freq €™ambulance - 1 freq amplifyin - 2 freq annabel - 1 freq amplifier - 1 freq ambled - 1 freq annbloom - 1 freq amiable - 1 freq |
MetaPhone code - AMPLFT amplified - 1 freq |
AMPLIFIED |
| Time to execute Levenshtein function - 0.210852 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.382319 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.027890 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.038498 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.001160 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. |