| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amp (0) - 10 freq ame (1) - 3 freq app (1) - 46 freq imp (1) - 3 freq hmp (1) - 1 freq jamp (1) - 34 freq amm (1) - 1 freq amc (1) - 1 freq ap (1) - 94 freq am- (1) - 2 freq camp (1) - 53 freq damp (1) - 83 freq amo (1) - 49 freq am (1) - 1545 freq agp (1) - 1 freq arp (1) - 1 freq lamp (1) - 79 freq amd (1) - 2 freq aup (1) - 1 freq amy (1) - 32 freq amn (1) - 3 freq mp (1) - 39 freq aap (1) - 26 freq ymp (1) - 2 freq am' (1) - 1 freq |
amp (0) - 10 freq imp (1) - 3 freq ymp (1) - 2 freq mp (1) - 39 freq ramp (2) - 13 freq atp (2) - 1 freq aqp (2) - 1 freq alp (2) - 1 freq am' (2) - 1 freq aap (2) - 26 freq rmp (2) - 1 freq mep (2) - 13 freq mop (2) - 16 freq map (2) - 91 freq mup (2) - 2 freq mpy (2) - 1 freq amn (2) - 3 freq empy (2) - 6 freq aip (2) - 10 freq maup (2) - 1 freq hmp (2) - 1 freq ame (2) - 3 freq am- (2) - 2 freq jamp (2) - 34 freq amc (2) - 1 freq |
SoundEx code - A510 anuff - 28 freq annuff - 1 freq amoeba - 1 freq anof - 4 freq amp - 10 freq ane-aff - 4 freq anoff - 6 freq amoffa - 1 freq |
MetaPhone code - AMP amp - 10 freq |
AMP |
| Time to execute Levenshtein function - 0.330916 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.677068 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.027750 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.069299 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.000936 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. |