| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bobbit (0) - 2 freq sobbit (1) - 3 freq babbit (1) - 2 freq bobbin (1) - 22 freq robbit (1) - 2 freq hobbit (1) - 2 freq gobbit (1) - 1 freq bobbie (1) - 15 freq fobbit (1) - 1 freq jobbit (1) - 5 freq webbit (2) - 1 freq boltit (2) - 4 freq jobbie (2) - 17 freq wibbit (2) - 2 freq bobcat (2) - 5 freq knobbit (2) - 1 freq bubblit (2) - 1 freq robit (2) - 1 freq bombin (2) - 4 freq sobbin (2) - 10 freq babbie (2) - 34 freq wabbit (2) - 79 freq bowtit (2) - 1 freq bootit (2) - 2 freq bobbies (2) - 33 freq |
bobbit (0) - 2 freq babbit (1) - 2 freq bobbie (2) - 15 freq jobbit (2) - 5 freq sobbit (2) - 3 freq gobbit (2) - 1 freq fobbit (2) - 1 freq bobbin (2) - 22 freq hobbit (2) - 2 freq robbit (2) - 2 freq gabbit (3) - 3 freq bobbed (3) - 1 freq ebbit (3) - 1 freq bbsit (3) - 1 freq blabbit (3) - 1 freq sabbit (3) - 1 freq babbin (3) - 4 freq bebbin (3) - 1 freq botabit (3) - 1 freq boabbin (3) - 1 freq jibbit (3) - 1 freq rubbit (3) - 49 freq rabbit (3) - 499 freq nabbit (3) - 2 freq babbie (3) - 34 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 - BBT b-but - 3 freq 'b-but - 1 freq babbed - 1 freq babbit - 2 freq bobbed - 1 freq bobbit - 2 freq |
BOBBIT |
| Time to execute Levenshtein function - 0.182192 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.334602 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.027718 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.040293 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.001003 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. |