| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| augment (0) - 2 freq agent (2) - 14 freq augmentin (2) - 1 freq ailment (2) - 2 freq judgment (2) - 7 freq argument (2) - 80 freq dugmen (2) - 2 freq argyment (2) - 2 freq jugement (2) - 3 freq aucient (2) - 1 freq figment (2) - 1 freq paument (2) - 1 freq maument (2) - 9 freq argiment (2) - 2 freq aisment (2) - 1 freq segment (2) - 1 freq aagmint (2) - 1 freq biggent (3) - 1 freq argiments (3) - 3 freq augist (3) - 1 freq maiment (3) - 2 freq regiment (3) - 21 freq summont (3) - 2 freq judgement (3) - 20 freq mament (3) - 14 freq |
augment (0) - 2 freq aagmint (2) - 1 freq argiment (3) - 2 freq paument (3) - 1 freq aisment (3) - 1 freq segment (3) - 1 freq agent (3) - 14 freq augmentin (3) - 1 freq figment (3) - 1 freq maument (3) - 9 freq argument (3) - 80 freq ailment (3) - 2 freq argyment (3) - 2 freq jugement (3) - 3 freq raiment (4) - 2 freq peyment (4) - 6 freq garment (4) - 1 freq easement (4) - 9 freq ment (4) - 18 freq jugemint (4) - 1 freq element (4) - 45 freq airgiment (4) - 1 freq cement (4) - 27 freq wament (4) - 1 freq adamant (4) - 5 freq |
SoundEx code - A255 assuming - 6 freq aa-kennin - 3 freq asinine - 2 freq assumin - 10 freq auchmannoch - 1 freq assonance - 1 freq awesomeness - 2 freq aagmint - 1 freq 'assuming - 1 freq aisement - 2 freq aisment - 1 freq ajynin - 1 freq augmentin - 1 freq agiements - 1 freq awaukenin - 3 freq awakenin - 2 freq agamemnon's - 2 freq assuman - 1 freq augment - 2 freq awakening - 1 freq awakenings - 1 freq acoming - 1 freq assinments - 1 freq ajmomauntieann - 1 freq |
MetaPhone code - AKMNT aagmint - 1 freq augment - 2 freq |
AUGMENT |
| Time to execute Levenshtein function - 0.210105 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.379759 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.030001 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.039798 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.000990 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. |