| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coatbrig (0) - 1 freq cockbrig (2) - 2 freq coatbridge (2) - 1 freq catering (3) - 1 freq drawbrig (3) - 1 freq coating (3) - 1 freq gorebrig (3) - 1 freq cathrin (3) - 1 freq caterin (3) - 4 freq moatbrae (3) - 1 freq fitbrig (3) - 1 freq coatin (3) - 1 freq coatit (3) - 5 freq conterin (3) - 7 freq coatie (3) - 5 freq chatrie (3) - 1 freq clattin (4) - 1 freq caig (4) - 1 freq roaring (4) - 5 freq dotterie (4) - 1 freq coaching (4) - 13 freq coaster (4) - 18 freq coasters (4) - 4 freq capturin (4) - 1 freq fortig (4) - 1 freq |
coatbrig (0) - 1 freq coatbridge (3) - 1 freq cockbrig (4) - 2 freq fitbrig (4) - 1 freq caterin (5) - 4 freq catering (5) - 1 freq cathrin (5) - 1 freq moatbrae (5) - 1 freq gorebrig (5) - 1 freq coating (5) - 1 freq footbridge (6) - 1 freq butterig (6) - 1 freq ciatterin (6) - 1 freq ratbag (6) - 2 freq ootbrak (6) - 2 freq trig (6) - 41 freq cater (6) - 5 freq carbrini (6) - 1 freq carg (6) - 1 freq cottaries (6) - 1 freq cobra (6) - 5 freq catrry (6) - 1 freq cotter (6) - 3 freq citric (6) - 2 freq calabria (6) - 2 freq |
SoundEx code - C316 cuthberti - 1 freq cadbury's - 3 freq cadavers - 2 freq cut-price - 1 freq cyathiform - 1 freq cuthbert's - 1 freq cadaver - 1 freq coatbridge - 1 freq cadeverous - 1 freq cadbury - 3 freq coatbrig - 1 freq cadburys - 2 freq |
MetaPhone code - KTBRK coatbrig - 1 freq |
COATBRIG |
| Time to execute Levenshtein function - 0.230943 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.405775 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.028349 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.037906 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.000870 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. |