| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yackles (0) - 1 freq cackles (1) - 1 freq hackles (1) - 3 freq tackles (1) - 3 freq rackless (2) - 1 freq rickles (2) - 4 freq puckles (2) - 14 freq sakles (2) - 2 freq tacklet (2) - 1 freq ruckles (2) - 1 freq backies (2) - 5 freq tackle (2) - 30 freq tackled (2) - 1 freq cackle (2) - 7 freq rankles (2) - 2 freq tickles (2) - 5 freq ankles (2) - 24 freq backless (2) - 1 freq buckles (2) - 2 freq pickles (2) - 2 freq coackles (2) - 1 freq fickles (2) - 1 freq fankles (2) - 4 freq yankies (2) - 1 freq huckles (2) - 1 freq |
yackles (0) - 1 freq cackles (2) - 1 freq tackles (2) - 3 freq hackles (2) - 3 freq huckles (3) - 1 freq fickles (3) - 1 freq kuckles (3) - 1 freq pickles (3) - 2 freq coackles (3) - 1 freq muckles (3) - 1 freq ackley (3) - 1 freq saikles (3) - 2 freq keckles (3) - 2 freq ankles (3) - 24 freq cockles (3) - 6 freq daikles (3) - 2 freq buckles (3) - 2 freq sakles (3) - 2 freq puckles (3) - 14 freq rickles (3) - 4 freq tickles (3) - 5 freq ruckles (3) - 1 freq uckle (4) - 1 freq yucks (4) - 1 freq jackals (4) - 1 freq |
SoundEx code - Y242 yisless - 3 freq yokels - 1 freq yokel's - 1 freq yuiseless - 2 freq yaisless - 1 freq yackles - 1 freq yxlqmyclic - 1 freq ygluegqb - 1 freq yqlhc - 1 freq |
MetaPhone code - YKLS yokels - 1 freq yokel's - 1 freq yackles - 1 freq |
YACKLES |
| Time to execute Levenshtein function - 0.191255 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.378143 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.027619 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.038681 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.000954 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. |