| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caballero (0) - 1 freq cabellero (1) - 2 freq caller (3) - 80 freq caaler (3) - 1 freq callers (3) - 2 freq taaller (3) - 1 freq €œcaller (4) - 1 freq hawalleen (4) - 1 freq cabal (4) - 2 freq taller (4) - 24 freq capable (4) - 25 freq cable (4) - 12 freq ayallar (4) - 4 freq 'galleri (4) - 2 freq ballest (4) - 3 freq callets (4) - 1 freq caber' (4) - 2 freq caaled (4) - 5 freq calle (4) - 2 freq auller (4) - 1 freq calloo (4) - 2 freq dwallers (4) - 3 freq calders (4) - 2 freq chollers (4) - 1 freq caler (4) - 1 freq |
caballero (0) - 1 freq cabellero (1) - 2 freq caller (4) - 80 freq cobbler (5) - 2 freq callar (5) - 4 freq culler (5) - 1 freq callier (5) - 1 freq caaler (5) - 1 freq callers (5) - 2 freq taaller (5) - 1 freq cobler (5) - 1 freq carolle (6) - 2 freq aller (6) - 2 freq cellar (6) - 26 freq crawler (6) - 1 freq carolled (6) - 1 freq ballet (6) - 4 freq traller (6) - 1 freq caber (6) - 4 freq balled (6) - 6 freq bueller (6) - 1 freq callerin (6) - 1 freq called (6) - 198 freq caulker (6) - 1 freq caulder (6) - 18 freq |
SoundEx code - C146 chevaliers - 1 freq cavalry - 18 freq chivalrous - 2 freq chaipel-reekit - 1 freq chivalry - 1 freq chevalrie - 1 freq caballero - 1 freq cabellero - 2 freq cobler - 1 freq chivalrously - 1 freq cobbler - 2 freq chefpaulrankin - 1 freq |
MetaPhone code - KBLR caballero - 1 freq cabellero - 2 freq cobler - 1 freq cobbler - 2 freq |
CABALLERO |
| Time to execute Levenshtein function - 0.400544 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.911724 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.075822 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.098188 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.000975 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. |