| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buffer (0) - 2 freq buffers (1) - 1 freq puffer (1) - 1 freq buffert (1) - 4 freq suffer (1) - 57 freq duffer (1) - 6 freq buffed (1) - 1 freq buffet (1) - 11 freq surfer (2) - 1 freq seffer (2) - 1 freq butler (2) - 8 freq muffler (2) - 1 freq bufft (2) - 1 freq buff (2) - 15 freq bucer (2) - 1 freq waffer (2) - 1 freq busker (2) - 2 freq bufferin (2) - 1 freq burker (2) - 2 freq bumper (2) - 3 freq bulker (2) - 1 freq cuffed (2) - 1 freq bunker (2) - 22 freq bowfer (2) - 2 freq ufer (2) - 1 freq |
buffer (0) - 2 freq duffer (2) - 6 freq buffet (2) - 11 freq suffer (2) - 57 freq buffed (2) - 1 freq buffert (2) - 4 freq buffers (2) - 1 freq puffer (2) - 1 freq offer (3) - 169 freq suiffer (3) - 1 freq iffer (3) - 1 freq bowfer (3) - 2 freq oaffer (3) - 1 freq buffs (3) - 4 freq heffer (3) - 2 freq baffel (3) - 1 freq baffe (3) - 2 freq biffed (3) - 1 freq siffer (3) - 3 freq niffer (3) - 7 freq gaffer (3) - 35 freq buff (3) - 15 freq bufft (3) - 1 freq seffer (3) - 1 freq waffer (3) - 1 freq |
SoundEx code - B160 before - 560 freq behavior - 1 freq behaviour - 58 freq beauvoir - 1 freq bifore - 2 freq befaire - 4 freq befare - 2 freq buffer - 2 freq bowfer - 2 freq befour - 2 freq behaivyoor - 1 freq before' - 1 freq befoir - 2 freq beaver - 3 freq bavarie - 1 freq bovier - 1 freq behavour - 1 freq befor - 1 freq bieber - 1 freq bavaria - 2 freq bopper - 3 freq bovver - 6 freq |
MetaPhone code - BFR before - 560 freq beauvoir - 1 freq bifore - 2 freq befaire - 4 freq befare - 2 freq buffer - 2 freq bowfer - 2 freq befour - 2 freq before' - 1 freq befoir - 2 freq beaver - 3 freq bavarie - 1 freq bovier - 1 freq befor - 1 freq bavaria - 2 freq bovver - 6 freq |
BUFFER |
| Time to execute Levenshtein function - 0.401345 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.705393 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.073993 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.086600 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.000844 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. |