| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buffers (0) - 1 freq buffert (1) - 4 freq buffer (1) - 2 freq suffers (1) - 7 freq puffers (1) - 1 freq burners (2) - 7 freq ruifers (2) - 1 freq bulders (2) - 1 freq buyers (2) - 6 freq suffert (2) - 9 freq offers (2) - 67 freq bummers (2) - 18 freq buskers (2) - 2 freq burgers (2) - 11 freq buggers (2) - 31 freq bluffert (2) - 1 freq duffer (2) - 6 freq buffs (2) - 4 freq bunkers (2) - 12 freq coffers (2) - 2 freq peffers (2) - 2 freq budders (2) - 2 freq puffer (2) - 1 freq buffett (2) - 1 freq differs (2) - 39 freq |
buffers (0) - 1 freq suffers (2) - 7 freq puffers (2) - 1 freq buffer (2) - 2 freq buffert (2) - 4 freq differs (3) - 39 freq peffers (3) - 2 freq coffers (3) - 2 freq bufferin (3) - 1 freq heffers (3) - 1 freq buffs (3) - 4 freq gaffers (3) - 2 freq oaffers (3) - 1 freq niffers (3) - 1 freq offers (3) - 67 freq ruifers (4) - 1 freq burners (4) - 7 freq dufners (4) - 1 freq busters (4) - 1 freq effeirs (4) - 13 freq deiffers (4) - 2 freq buggers (4) - 31 freq baffie's (4) - 5 freq coffars (4) - 1 freq fifers (4) - 8 freq |
SoundEx code - B162 bifrost - 2 freq beverages - 1 freq beverage - 3 freq bifröst - 1 freq buffers - 1 freq behaviours - 2 freq beavers - 2 freq |
MetaPhone code - BFRS buffers - 1 freq beavers - 2 freq |
BUFFERS |
| Time to execute Levenshtein function - 0.186342 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.349745 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.027657 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.037120 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.000924 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. |