| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baffel (0) - 1 freq baffelt (1) - 1 freq baffe (1) - 2 freq affen (2) - 118 freq effel (2) - 1 freq caffe (2) - 1 freq baffy (2) - 3 freq affil (2) - 7 freq caffee (2) - 2 freq affer (2) - 2 freq waffer (2) - 1 freq oaffer (2) - 2 freq eiffel (2) - 2 freq daffed (2) - 3 freq buffed (2) - 1 freq gaffer (2) - 35 freq haffet (2) - 5 freq baffie (2) - 62 freq buffet (2) - 11 freq gaffe (2) - 1 freq baffle (2) - 2 freq barrel (2) - 42 freq baffles (2) - 1 freq reffel (2) - 2 freq babel (2) - 7 freq |
baffel (0) - 1 freq baffe (2) - 2 freq baffle (2) - 2 freq baffelt (2) - 1 freq reffel (3) - 2 freq biffed (3) - 1 freq baffles (3) - 1 freq duffel (3) - 2 freq buffet (3) - 11 freq baff (3) - 3 freq baffies (3) - 21 freq baffled (3) - 4 freq baffin (3) - 1 freq buffer (3) - 2 freq buffalo (3) - 6 freq baffie (3) - 62 freq baffy (3) - 3 freq eiffel (3) - 2 freq affil (3) - 7 freq effel (3) - 1 freq buffed (3) - 1 freq buffs (4) - 4 freq bouffed (4) - 4 freq raffle (4) - 13 freq biffo (4) - 2 freq |
SoundEx code - B140 bauble - 5 freq bible - 95 freq by-pley - 1 freq bubble - 37 freq babel - 7 freq bubbly - 10 freq bubbaloo - 3 freq buffalo - 6 freq baffle - 2 freq bubbly' - 1 freq bybil - 1 freq bubl - 1 freq befell - 2 freq babble - 2 freq baffel - 1 freq bublé - 1 freq 'bubbly - 1 freq bobble - 1 freq |
MetaPhone code - BFL buffalo - 6 freq baffle - 2 freq befell - 2 freq baffel - 1 freq |
BAFFEL |
| Time to execute Levenshtein function - 0.281559 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.414214 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.029932 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.039737 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.001012 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. |