| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buft (0) - 1 freq bust (1) - 10 freq buit (1) - 32 freq burt (1) - 2 freq ruft (1) - 1 freq bufw (1) - 1 freq buff (1) - 15 freq bunt (1) - 6 freq luft (1) - 2 freq bufft (1) - 1 freq bumt (1) - 1 freq butt (1) - 20 freq tuft (1) - 1 freq but (1) - 13379 freq lufts (2) - 2 freq heft (2) - 111 freq upt (2) - 2 freq bert (2) - 106 freq batt (2) - 1 freq bury (2) - 24 freq bett (2) - 4 freq bur (2) - 8 freq hunt (2) - 62 freq auct (2) - 1 freq iufc (2) - 1 freq |
buft (0) - 1 freq tuft (2) - 1 freq bumt (2) - 1 freq but (2) - 13379 freq buftie (2) - 1 freq bafta (2) - 1 freq bufft (2) - 1 freq bifot (2) - 1 freq butt (2) - 20 freq luft (2) - 2 freq buit (2) - 32 freq burt (2) - 2 freq ruft (2) - 1 freq bufw (2) - 1 freq bunt (2) - 6 freq bust (2) - 10 freq buff (2) - 15 freq brt (3) - 1 freq bfk (3) - 1 freq birt (3) - 1 freq bunty (3) - 12 freq bff (3) - 1 freq brit (3) - 3 freq baet (3) - 27 freq ooft (3) - 5 freq |
SoundEx code - B130 behaved - 9 freq boufft - 1 freq bowfft - 2 freq babby-the - 1 freq bowff't - 1 freq bevvied - 4 freq buffet - 11 freq buffett - 1 freq bouffed - 4 freq bowffed - 9 freq babbed - 1 freq bovedy - 3 freq bopped - 1 freq buffed - 1 freq babbit - 2 freq bobbed - 1 freq befaaed - 1 freq bewaved - 1 freq behuvit - 1 freq bobbit - 2 freq be-eft - 1 freq baa-pit - 2 freq bevuto - 1 freq bowfed - 1 freq biffed - 1 freq buft - 1 freq bufft - 1 freq bappit - 1 freq beeped - 1 freq bifot - 1 freq bafta - 1 freq buftie - 1 freq |
MetaPhone code - BFT boufft - 1 freq bowfft - 2 freq bowff't - 1 freq bevvied - 4 freq buffet - 11 freq buffett - 1 freq bouffed - 4 freq bowffed - 9 freq bovedy - 3 freq buffed - 1 freq boght - 2 freq befaaed - 1 freq be-eft - 1 freq bevuto - 1 freq bowfed - 1 freq biffed - 1 freq buft - 1 freq bufft - 1 freq bifot - 1 freq bafta - 1 freq buftie - 1 freq |
BUFT |
| Time to execute Levenshtein function - 0.185959 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.331524 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.027680 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.039987 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.000908 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. |