| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acoming (0) - 1 freq coming (1) - 116 freq aming (2) - 3 freq atoning (2) - 1 freq sooming (2) - 2 freq looming (2) - 3 freq adoring (2) - 1 freq cuming (2) - 1 freq comin (2) - 1056 freq 'comin (2) - 3 freq daoming (2) - 1 freq incoming (2) - 1 freq comin' (2) - 19 freq acting (2) - 12 freq booming (2) - 1 freq zooming (2) - 1 freq coing (2) - 1 freq aching (2) - 4 freq becoming (2) - 9 freq coping (2) - 2 freq comins (2) - 4 freq upcoming (2) - 3 freq coding (2) - 1 freq scoring (2) - 7 freq acoont (3) - 6 freq |
acoming (0) - 1 freq coming (1) - 116 freq cuming (2) - 1 freq aching (3) - 4 freq coing (3) - 1 freq booming (3) - 1 freq zooming (3) - 1 freq coping (3) - 2 freq coding (3) - 1 freq upcoming (3) - 3 freq comins (3) - 4 freq acting (3) - 12 freq becoming (3) - 9 freq sooming (3) - 2 freq comin' (3) - 19 freq aming (3) - 3 freq comin (3) - 1056 freq looming (3) - 3 freq daoming (3) - 1 freq incoming (3) - 1 freq cooking (4) - 15 freq amung (4) - 3 freq comena (4) - 2 freq coman (4) - 41 freq among (4) - 120 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 - AKMNK acoming - 1 freq |
ACOMING |
| Time to execute Levenshtein function - 0.198461 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.369626 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.026860 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.037421 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.000810 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. |