| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| attacking (0) - 4 freq attackin' (1) - 1 freq attackin (1) - 8 freq attackit (2) - 2 freq tacking (2) - 3 freq tracking (2) - 3 freq attain (3) - 2 freq attachit (3) - 1 freq jacking (3) - 1 freq attracktin (3) - 1 freq attractin' (3) - 1 freq sticking (3) - 9 freq tackling (3) - 2 freq chacking (3) - 1 freq fracking (3) - 1 freq stalking (3) - 2 freq ticking (3) - 1 freq attacks (3) - 13 freq i'talking (3) - 1 freq trackin (3) - 7 freq snacking (3) - 1 freq stoackins (3) - 1 freq stackin (3) - 2 freq 'sticking (3) - 1 freq talking (3) - 56 freq |
attacking (0) - 4 freq attackin (2) - 8 freq attackin' (2) - 1 freq tacking (3) - 3 freq tracking (3) - 3 freq sticking (4) - 9 freq ticking (4) - 1 freq stocking (4) - 5 freq attackit (4) - 2 freq racking (5) - 1 freq teaching (5) - 30 freq attack (5) - 79 freq attending (5) - 4 freq lacking (5) - 2 freq taking (5) - 42 freq attacked (5) - 13 freq macking (5) - 2 freq wacking (5) - 2 freq cracking (5) - 19 freq thanking (5) - 1 freq sacking (5) - 2 freq backing (5) - 3 freq tackin (5) - 1 freq tackings (5) - 1 freq packing (5) - 6 freq |
SoundEx code - A325 addison - 31 freq addison's - 12 freq attackin' - 1 freq attachment - 3 freq aidgin - 1 freq attackin - 8 freq aitken - 32 freq adjoinin - 2 freq ati'sunbems - 1 freq aitken's - 4 freq addisence - 1 freq audiscense - 1 freq autism - 3 freq aitkin - 1 freq atakan - 1 freq attacking - 4 freq aitkens - 1 freq aodsmegh - 1 freq aitkins - 1 freq aitkens - 1 freq adgmbfhvox - 1 freq addishanel - 1 freq atkinson - 1 freq |
MetaPhone code - ATKNK attacking - 4 freq |
ATTACKING |
| Time to execute Levenshtein function - 0.185286 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.399394 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.028538 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.043134 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.000886 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. |