| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buffert (0) - 4 freq bluffert (1) - 1 freq suffert (1) - 9 freq buffer (1) - 2 freq buffers (1) - 1 freq buffett (1) - 1 freq buffet (1) - 11 freq pluffert (2) - 2 freq puffer (2) - 1 freq offert (2) - 38 freq buttert (2) - 7 freq bufft (2) - 1 freq niffert (2) - 1 freq puffers (2) - 1 freq blaffert (2) - 1 freq suffer (2) - 57 freq suffers (2) - 7 freq effert (2) - 1 freq bullert (2) - 2 freq bufferin (2) - 1 freq duffer (2) - 6 freq buggert (2) - 3 freq baffelt (2) - 1 freq sufferit (2) - 1 freq muffet (2) - 5 freq |
buffert (0) - 4 freq buffet (2) - 11 freq buffers (2) - 1 freq buffett (2) - 1 freq buffer (2) - 2 freq suffert (2) - 9 freq bluffert (2) - 1 freq blaffert (3) - 1 freq effert (3) - 1 freq baffelt (3) - 1 freq niffert (3) - 1 freq bufferin (3) - 1 freq bufft (3) - 1 freq sufferit (3) - 1 freq offert (3) - 38 freq tuffet (4) - 2 freq muffet (4) - 5 freq effart (4) - 1 freq oaffirt (4) - 2 freq buffed (4) - 1 freq boufft (4) - 1 freq effort (4) - 99 freq effirt (4) - 3 freq offerit (4) - 1 freq puffers (4) - 1 freq |
SoundEx code - B163 beveridge - 3 freq beaufort's - 2 freq buffert - 4 freq by-product - 2 freq byproduct - 1 freq bevridge - 1 freq beveridgegraham - 3 freq beforewedie - 1 freq |
MetaPhone code - BFRT buffert - 4 freq |
BUFFERT |
| Time to execute Levenshtein function - 0.225231 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.412866 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.027724 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.040386 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.000860 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. |