| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fine-baned (0) - 1 freq wire-baned (2) - 1 freq fine-made (3) - 1 freq fite-faced (3) - 1 freq fingerbanes (3) - 1 freq minened (4) - 1 freq wine-stained (4) - 1 freq bare-banes (4) - 1 freq sun-baked (4) - 1 freq five-baurred (4) - 2 freq nine-bars (4) - 1 freq fine-tasty (4) - 3 freq fitefaced (4) - 1 freq finland (4) - 7 freq fikeane (4) - 1 freq in-bred (4) - 1 freq finegael (4) - 1 freq jing-bang (4) - 15 freq din-faced (4) - 1 freq fire-new (4) - 1 freq fine-wove (4) - 1 freq financed (4) - 2 freq wine-baurs (4) - 1 freq fire-edged (4) - 1 freq rig-banes (4) - 1 freq |
fine-baned (0) - 1 freq wire-baned (4) - 1 freq fine-made (5) - 1 freq finland (6) - 7 freq in-bred (6) - 1 freq alice-band (6) - 1 freq sun-baked (6) - 1 freq fite-faced (6) - 1 freq fingerbanes (6) - 1 freq tin-canned (7) - 1 freq kin-kind (7) - 1 freq lang-baked (7) - 1 freq functioned (7) - 1 freq nae-baud (7) - 1 freq home-baked (7) - 1 freq shin-bane (7) - 1 freq rig-bane (7) - 2 freq sun-bed (7) - 4 freq fine-tuin (7) - 1 freq fanned (7) - 9 freq fur-lined (7) - 2 freq funned (7) - 2 freq ice-boond (7) - 1 freq hin-end (7) - 5 freq kin-kynd (7) - 2 freq |
SoundEx code - F515 fine-baned - 1 freq |
MetaPhone code - FNBNT fine-baned - 1 freq |
FINE-BANED |
| Time to execute Levenshtein function - 0.205301 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.369851 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.027462 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.041143 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.000906 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. |