| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cabellero (0) - 2 freq caballero (1) - 1 freq callers (3) - 2 freq labelled (3) - 13 freq caller (3) - 80 freq callar (4) - 4 freq allegro (4) - 1 freq calzer (4) - 1 freq bueller (4) - 1 freq speller (4) - 2 freq calder (4) - 12 freq called (4) - 198 freq labellin (4) - 1 freq bevellers (4) - 1 freq aller (4) - 2 freq calloo (4) - 2 freq belle' (4) - 1 freq callets (4) - 1 freq cobler (4) - 1 freq caddlers (4) - 1 freq calmer (4) - 3 freq caulker (4) - 1 freq taaller (4) - 1 freq case-less (4) - 1 freq carolro (4) - 17 freq |
cabellero (0) - 2 freq caballero (1) - 1 freq caller (4) - 80 freq cellar (5) - 26 freq cobler (5) - 1 freq cobbler (5) - 2 freq bueller (5) - 1 freq callier (5) - 1 freq culler (5) - 1 freq callar (5) - 4 freq labelled (5) - 13 freq callers (5) - 2 freq callerin (6) - 1 freq cellars (6) - 1 freq beyler (6) - 1 freq caleery (6) - 2 freq calle (6) - 2 freq labellit (6) - 1 freq auller (6) - 1 freq bullers (6) - 2 freq belle (6) - 17 freq abell (6) - 1 freq cllr (6) - 3 freq rebelled (6) - 1 freq creeler (6) - 2 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 |
CABELLERO |
| Time to execute Levenshtein function - 0.243152 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.398996 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.027940 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.037274 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.000828 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. |