| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cookbuik (0) - 2 freq cookbook (2) - 7 freq notebuik (3) - 1 freq cockburn (3) - 9 freq cockbrig (3) - 2 freq cookin (3) - 44 freq cookbooks (3) - 2 freq bookbugs (3) - 1 freq cookit (3) - 3 freq bookbug (3) - 13 freq cookie (3) - 15 freq cookiris (3) - 4 freq ootbrek (4) - 1 freq goodluck (4) - 2 freq coocil (4) - 1 freq coothie (4) - 4 freq cootie (4) - 1 freq coortlie (4) - 2 freq coonsul (4) - 1 freq cooglin (4) - 1 freq chouk (4) - 1 freq cook (4) - 201 freq cooked (4) - 27 freq cooncil (4) - 307 freq fookin (4) - 2 freq |
cookbuik (0) - 2 freq cookbook (2) - 7 freq ceukbeuk (4) - 1 freq cookbooks (4) - 2 freq bookbug (5) - 13 freq cookiris (5) - 4 freq cookie (5) - 15 freq cookit (5) - 3 freq cbbuk (5) - 1 freq notebuik (5) - 1 freq cookin (5) - 44 freq cookies (6) - 10 freq lookalike (6) - 2 freq chookie (6) - 66 freq coukit (6) - 1 freq workbook (6) - 1 freq cuik (6) - 4 freq cobbis (6) - 1 freq cookery (6) - 4 freq conduk (6) - 1 freq clokkie (6) - 1 freq cooker (6) - 21 freq cookoo (6) - 1 freq cooken (6) - 1 freq ciobair (6) - 1 freq |
SoundEx code - C212 cacafuego - 1 freq cookbuik - 2 freq cookbook - 7 freq cookbooks - 2 freq ceukbeuk - 1 freq cashbox - 1 freq case-by-case - 1 freq cashback - 1 freq cheekybesom - 2 freq cooihzbqwn - 1 freq cuxbohjama - 1 freq chooseybeggar - 1 freq |
MetaPhone code - KKBK cookbuik - 2 freq cookbook - 7 freq wkggbaukeo - 1 freq |
COOKBUIK |
| Time to execute Levenshtein function - 0.221287 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.518957 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.027874 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.071754 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.000944 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. |