| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bevvied (0) - 4 freq bevvie (1) - 2 freq beeried (2) - 14 freq divvied (2) - 2 freq bevie (2) - 2 freq envied (2) - 3 freq levied (2) - 1 freq bellied (2) - 3 freq hevved (2) - 1 freq belied (2) - 1 freq bevvin (2) - 1 freq bevviedup (2) - 1 freq deived (3) - 1 freq bevvy (3) - 20 freq busied (3) - 1 freq bevvyin (3) - 5 freq bendie (3) - 2 freq behind (3) - 261 freq beefie (3) - 1 freq rivvies (3) - 1 freq beivin (3) - 1 freq berries (3) - 26 freq envie (3) - 2 freq beisie (3) - 3 freq cerved (3) - 1 freq |
bevvied (0) - 4 freq bevvie (2) - 2 freq bevviedup (3) - 1 freq bevvin (3) - 1 freq hevved (3) - 1 freq divvied (3) - 2 freq muvved (4) - 2 freq beluved (4) - 1 freq bovver (4) - 6 freq bewaved (4) - 1 freq byvind (4) - 1 freq beleved (4) - 2 freq luvved (4) - 4 freq hivved (4) - 1 freq revived (4) - 6 freq behaved (4) - 9 freq braved (4) - 1 freq beloved (4) - 25 freq bevvyin (4) - 5 freq envied (4) - 3 freq levied (4) - 1 freq bevie (4) - 2 freq bellied (4) - 3 freq beeried (4) - 14 freq bevvy (4) - 20 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 |
BEVVIED |
| Time to execute Levenshtein function - 0.184793 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.325526 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.027515 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.036913 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.000904 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. |