| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bovedy (0) - 3 freq ovey (2) - 1 freq tovey (2) - 2 freq bored (2) - 48 freq body (2) - 755 freq bovvy (2) - 2 freq boady (2) - 94 freq bogey (2) - 13 freq bovets (2) - 1 freq boked (2) - 2 freq boxed (2) - 7 freq moved (2) - 192 freq loved (2) - 190 freq boddy (2) - 7 freq goved (2) - 2 freq toved (2) - 1 freq dovey (2) - 3 freq boned (2) - 2 freq somedy (2) - 12 freq boued (2) - 22 freq bledy (2) - 1 freq comedy (2) - 33 freq bowed (2) - 38 freq lovey (2) - 1 freq hoved (2) - 4 freq |
bovedy (0) - 3 freq toved (3) - 1 freq goved (3) - 2 freq loved (3) - 190 freq boned (3) - 2 freq boddy (3) - 7 freq boued (3) - 22 freq booed (3) - 40 freq bowed (3) - 38 freq bledy (3) - 1 freq moved (3) - 192 freq hoved (3) - 4 freq bovvy (3) - 2 freq body (3) - 755 freq boxed (3) - 7 freq boady (3) - 94 freq bored (3) - 48 freq boked (3) - 2 freq board (4) - 151 freq bieldy (4) - 6 freq abody (4) - 90 freq boud (4) - 1 freq budy (4) - 1 freq beady (4) - 14 freq bedd (4) - 56 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 |
BOVEDY |
| Time to execute Levenshtein function - 0.207552 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.392016 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.028516 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.040534 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.000926 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. |