| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| be-eft (0) - 1 freq bereft (1) - 13 freq bekeit (2) - 1 freq beest (2) - 11 freq beret (2) - 3 freq behest (2) - 2 freq beelt (2) - 1 freq beef (2) - 83 freq beset (2) - 4 freq benefit (2) - 73 freq beget (2) - 2 freq leeft (2) - 11 freq bereft- (2) - 2 freq beef' (2) - 1 freq beet (2) - 18 freq beseik (3) - 1 freq baest (3) - 27 freq leyft (3) - 1 freq bees (3) - 46 freq teefy (3) - 1 freq beat (3) - 212 freq weest (3) - 1 freq biegt (3) - 1 freq bowfft (3) - 2 freq bede's (3) - 1 freq |
be-eft (0) - 1 freq bereft (2) - 13 freq benefit (3) - 73 freq b-but (4) - 3 freq barefit (4) - 13 freq beet (4) - 18 freq b-a-t (4) - 1 freq bufft (4) - 1 freq boufft (4) - 1 freq re-fit (4) - 1 freq benifit (4) - 1 freq beef' (4) - 1 freq bereft- (4) - 2 freq behest (4) - 2 freq beret (4) - 3 freq beest (4) - 11 freq bekeit (4) - 1 freq beelt (4) - 1 freq beef (4) - 83 freq leeft (4) - 11 freq beget (4) - 2 freq beset (4) - 4 freq buft (4) - 1 freq infeft (5) - 2 freq bexit (5) - 1 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 |
BE-EFT |
| Time to execute Levenshtein function - 0.198088 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.333319 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.028245 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.046410 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.001037 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. |