| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cockerel (0) - 5 freq cockerel's (2) - 1 freq cocker (2) - 1 freq mackerel (2) - 8 freq cocked (3) - 10 freq cock-eyed (3) - 1 freq clockers (3) - 6 freq coveret (3) - 2 freq comperen (3) - 1 freq conker (3) - 1 freq cockade (3) - 3 freq crockery (3) - 2 freq comperes (3) - 1 freq cockpen (3) - 1 freq covered (3) - 119 freq docker (3) - 4 freq rockeen (3) - 1 freq conkers (3) - 3 freq cocktail (3) - 21 freq cornered (3) - 6 freq couered (3) - 1 freq locker (3) - 3 freq rockery (3) - 1 freq cockled (3) - 2 freq rocketed (3) - 1 freq |
cockerel (0) - 5 freq cocker (3) - 1 freq mackerel (3) - 8 freq cocktail (4) - 21 freq cockle (4) - 4 freq cockerel's (4) - 1 freq cockler (5) - 1 freq cock-eyed (5) - 1 freq rocker (5) - 3 freq lockers (5) - 4 freq cookery (5) - 4 freq cockles (5) - 6 freq tuckered (5) - 1 freq cooker (5) - 21 freq clocker (5) - 3 freq backerly (5) - 1 freq cackle (5) - 7 freq sickerly (5) - 2 freq cankered (5) - 1 freq cockbrig (5) - 2 freq puckered (5) - 3 freq bickered (5) - 1 freq dockers (5) - 12 freq mockery (5) - 9 freq cockney (5) - 8 freq |
SoundEx code - C264 cockerel - 5 freq cockerel's - 1 freq casserole - 3 freq casseroled - 1 freq |
MetaPhone code - KKRL cockerel - 5 freq |
COCKEREL |
| Time to execute Levenshtein function - 0.215534 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.412624 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.027543 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.038651 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.000884 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. |