| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| octavian's (2) - 1 freq cravin (3) - 5 freq cavin (3) - 1 freq italian (3) - 62 freq occasion (3) - 42 freq orcadian (3) - 51 freq caviar (3) - 11 freq eytalian (3) - 1 freq chavin (3) - 4 freq carian (3) - 1 freq optician (3) - 4 freq obtain (3) - 2 freq taviani (3) - 2 freq mctavish (3) - 7 freq sectarian (3) - 5 freq cavan (3) - 1 freq tavish (4) - 1 freq carin (4) - 45 freq ootgoin (4) - 1 freq clachan (4) - 101 freq canavan (4) - 2 freq clain (4) - 13 freq dravin (4) - 4 freq ta'in (4) - 1 freq ongaein (4) - 4 freq |
taviani (4) - 2 freq octavian's (4) - 1 freq chavin (4) - 4 freq cavan (4) - 1 freq cavin (4) - 1 freq cravin (4) - 5 freq colvin (5) - 1 freq tyavin (5) - 2 freq icivin (5) - 1 freq caven (5) - 1 freq chyavin (5) - 1 freq chaavin (5) - 2 freq ectin (5) - 1 freq calvin (5) - 8 freq mutvin (5) - 1 freq stevin (5) - 2 freq curvan (5) - 1 freq ection (5) - 16 freq activity (5) - 30 freq carvin (5) - 6 freq caravan (5) - 72 freq citation (5) - 2 freq action (5) - 138 freq actin (5) - 58 freq tovin (5) - 8 freq |
SoundEx code - O231 osteopath - 3 freq osteopathy - 1 freq october - 88 freq octipises - 1 freq october's - 1 freq octavian's - 1 freq octopus - 3 freq ostoft - 1 freq octopussy - 1 freq oactobur - 1 freq octobers - 1 freq ozatbw - 1 freq oktober - 2 freq oejtfk - 1 freq |
MetaPhone code - OKTFN |
OCTAVIAN |
| Time to execute Levenshtein function - 0.253433 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.458981 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.028028 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.038240 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.000849 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. |