Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cocktails (0) - 9 freq cocktails' (1) - 1 freq cocktail (1) - 21 freq coat-tails (3) - 5 freq contains (3) - 13 freq forkytails (3) - 1 freq locails (3) - 2 freq tod-tails (3) - 1 freq forkitails (3) - 4 freq docknail's (3) - 1 freq crottils (4) - 1 freq coonties (4) - 5 freq constable (4) - 24 freq cockad (4) - 1 freq moutains (4) - 1 freq neckties (4) - 1 freq countries (4) - 36 freq worktaps (4) - 1 freq complains (4) - 7 freq lockis (4) - 1 freq crytals (4) - 1 freq carstairs (4) - 1 freq forstairs (4) - 1 freq cokkis (4) - 1 freq rockall (4) - 1 freq |
cocktails (0) - 9 freq cocktail (2) - 21 freq cocktails' (2) - 1 freq cockles (5) - 6 freq forkytails (5) - 1 freq coat-tails (5) - 5 freq forkitails (5) - 4 freq cock's (6) - 3 freq capitals (6) - 3 freq cockatoo (6) - 1 freq cackles (6) - 1 freq cockerel (6) - 5 freq crystals (6) - 7 freq cockit (6) - 30 freq cockerel's (6) - 1 freq forkietails (6) - 2 freq rockpools (6) - 1 freq recitals (6) - 2 freq cockle (6) - 4 freq cocks (6) - 11 freq cockneys (6) - 1 freq jackals (6) - 1 freq coackles (6) - 1 freq crottils (6) - 1 freq neckties (6) - 1 freq |
SoundEx code - C234 castle - 157 freq cocktail - 21 freq caistle - 4 freq castle-neuk - 1 freq castle's - 1 freq coastline - 6 freq castles - 26 freq costly - 4 freq coastlie - 1 freq cocktails' - 1 freq castlehill - 2 freq coastal - 11 freq castell - 1 freq cocktails - 9 freq castled - 1 freq castellis - 1 freq castlekennedygardens - 1 freq castlemulk - 1 freq castlereagh - 1 freq castel - 8 freq castels - 2 freq €˜castalian - 1 freq castlemilk - 3 freq caistlehull - 1 freq castlewynd - 1 freq castlegate - 4 freq castleton - 1 freq castiel - 1 freq castellano - 1 freq castlvillageman - 1 freq castle' - 2 freq coastalgrampian - 1 freq castleview - 2 freq castlebrae - 1 freq |
MetaPhone code - KKTLS cocktails' - 1 freq cocktails - 9 freq |
COCKTAILS |
Time to execute Levenshtein function - 0.214961 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.372888 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.031640 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.037168 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.000926 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. |