Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
attackin (0) - 8 freq attacking (1) - 4 freq attackit (1) - 2 freq attackin' (1) - 1 freq attractin (2) - 5 freq trackin (2) - 7 freq stackin (2) - 2 freq attracktin (2) - 1 freq tackin (2) - 1 freq attain (2) - 2 freq attrackit (2) - 1 freq attachit (2) - 1 freq attacks (2) - 13 freq attack (2) - 79 freq attacked (2) - 13 freq attractit (3) - 6 freq 'backin (3) - 1 freq shoackin (3) - 3 freq backin (3) - 41 freq soackin (3) - 1 freq stakin (3) - 1 freq trackie (3) - 9 freq chackin (3) - 3 freq tracin (3) - 8 freq atwain (3) - 2 freq |
attackin (0) - 8 freq attacking (2) - 4 freq attackin' (2) - 1 freq attackit (2) - 2 freq attacks (3) - 13 freq attack (3) - 79 freq tackin (3) - 1 freq attacked (3) - 13 freq stackin (3) - 2 freq trackin (3) - 7 freq steckin (4) - 1 freq thickin (4) - 1 freq stockin (4) - 15 freq tuckin (4) - 9 freq stackan (4) - 2 freq tackan (4) - 1 freq stickin (4) - 107 freq attecks (4) - 1 freq tickin (4) - 8 freq truckin (4) - 1 freq attick (4) - 1 freq attachit (4) - 1 freq attrackit (4) - 1 freq tacken (4) - 2 freq trockin (4) - 1 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 - ATKN attackin' - 1 freq attackin - 8 freq aitken - 32 freq aitkin - 1 freq atakan - 1 freq |
ATTACKIN |
Time to execute Levenshtein function - 0.236325 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.584563 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.028561 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.077463 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.000891 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. |