| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cadwallader (0) - 23 freq 'cadwallader (1) - 1 freq cadwallader's (2) - 2 freq indwaller (4) - 1 freq callander (4) - 2 freq allander (5) - 1 freq ayallar (5) - 4 freq marmalade (5) - 12 freq lawlander (5) - 1 freq nealwallace (5) - 2 freq capallfada (5) - 1 freq wallace (5) - 118 freq dupleader (5) - 2 freq callender (5) - 1 freq dweller (5) - 2 freq callier (5) - 1 freq aalder (5) - 24 freq caballero (5) - 1 freq caller (5) - 80 freq caulder (5) - 18 freq ballater (5) - 10 freq swallae (5) - 32 freq akwallie (5) - 2 freq walloper (5) - 6 freq hawalleen (5) - 1 freq |
cadwallader (0) - 23 freq 'cadwallader (2) - 1 freq cadwallader's (4) - 2 freq indwaller (6) - 1 freq cowlder (7) - 1 freq callander (7) - 2 freq dweller (7) - 2 freq carolander (8) - 1 freq caulder (8) - 18 freq swallayed (8) - 1 freq indwallers (8) - 9 freq calder (8) - 12 freq dwallers (8) - 3 freq waller (8) - 1 freq swallaed (8) - 34 freq caller (8) - 80 freq callar (8) - 4 freq walloper (8) - 6 freq callender (8) - 1 freq callier (8) - 1 freq caballero (8) - 1 freq dupleader (8) - 2 freq lawlander (8) - 1 freq acwally (9) - 4 freq swalled (9) - 6 freq |
SoundEx code - C343 cutlets - 3 freq cadwallader's - 2 freq cadwallader - 23 freq 'cadwallader - 1 freq cheetled - 2 freq cuddled - 7 freq cattle-dealin - 1 freq chittled - 1 freq cuttled - 1 freq coddled - 1 freq coddilt - 1 freq coddlit - 1 freq cuddlet - 1 freq |
MetaPhone code - KTWLTR cadwallader - 23 freq 'cadwallader - 1 freq |
CADWALLADER |
| Time to execute Levenshtein function - 0.194617 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.357445 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.027861 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.037113 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.000883 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. |