| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cauf-deep (0) - 1 freq hauf-deid (3) - 8 freq bane-deep (3) - 3 freq hauf-loup (4) - 1 freq hauf-apen (4) - 2 freq aff-step (4) - 1 freq faur-seen (4) - 2 freq doon-deep (4) - 1 freq cauf-grun (4) - 1 freq hauf-wye (4) - 2 freq bar-keep (4) - 1 freq caundles (4) - 1 freq erse-deep (4) - 1 freq caffee (4) - 2 freq half-deid (4) - 1 freq caundle (4) - 7 freq aa-deen (4) - 2 freq cauldest (4) - 5 freq lang-deef (4) - 1 freq hoch-deep (4) - 3 freq cundeez (4) - 1 freq hauf-leid (4) - 1 freq hauf-seas (4) - 1 freq hauf-wey (4) - 4 freq hauf-daft (4) - 1 freq |
cauf-deep (0) - 1 freq hauf-deid (5) - 8 freq bane-deep (5) - 3 freq doon-deep (6) - 1 freq hoch-deep (6) - 3 freq erse-deep (6) - 1 freq knee-deep (6) - 1 freq hauf-day (6) - 1 freq hauf-loup (6) - 1 freq maun-dae (7) - 7 freq hauf-mete (7) - 1 freq 'aa-deen (7) - 1 freq caulder (7) - 18 freq hauf-wyes (7) - 1 freq waist-deep (7) - 1 freq cardee (7) - 1 freq ca-ed (7) - 1 freq cuffed (7) - 1 freq navdeep (7) - 14 freq rae-deer (7) - 1 freq hauf-asleep (7) - 4 freq hauf-daft (7) - 1 freq dau-dle (7) - 1 freq cut-doon (7) - 2 freq aff-step (7) - 1 freq |
SoundEx code - C131 chopped-aff - 1 freq captivatin - 3 freq captivates - 1 freq coffee-table - 1 freq captive - 4 freq cavity-fillin - 1 freq captives - 2 freq cauf-deep - 1 freq capteivitie - 1 freq captivity - 1 freq capteevity - 1 freq cpduph - 1 freq captivated - 1 freq |
MetaPhone code - KFTP cauf-deep - 1 freq |
CAUF-DEEP |
| Time to execute Levenshtein function - 0.229771 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.435339 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.027937 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.037758 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.000868 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. |