| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| babbit (0) - 2 freq rabbit (1) - 499 freq nabbit (1) - 2 freq sabbit (1) - 1 freq babbin (1) - 4 freq gabbit (1) - 3 freq blabbit (1) - 1 freq dabbit (1) - 6 freq babbie (1) - 34 freq bobbit (1) - 2 freq wabbit (1) - 79 freq jabbit (1) - 3 freq crabbit (2) - 107 freq baggit (2) - 4 freq barfit (2) - 4 freq bakit (2) - 8 freq sabbin (2) - 10 freq nabbin (2) - 2 freq ebbit (2) - 1 freq mabbie (2) - 1 freq nabbie (2) - 7 freq grabbit (2) - 28 freq babby (2) - 25 freq bappit (2) - 1 freq robbit (2) - 2 freq |
babbit (0) - 2 freq bobbit (1) - 2 freq nabbit (2) - 2 freq wabbit (2) - 79 freq jabbit (2) - 3 freq rabbit (2) - 499 freq babbie (2) - 34 freq dabbit (2) - 6 freq sabbit (2) - 1 freq babbin (2) - 4 freq gabbit (2) - 3 freq blabbit (2) - 1 freq gobbit (3) - 1 freq abbot (3) - 5 freq bbsit (3) - 1 freq babysit (3) - 1 freq sobbit (3) - 3 freq jibbit (3) - 1 freq hobbit (3) - 2 freq barbt (3) - 1 freq erabbit (3) - 1 freq bobbin (3) - 22 freq libbit (3) - 3 freq rubbit (3) - 49 freq jobbit (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 - BBT b-but - 3 freq 'b-but - 1 freq babbed - 1 freq babbit - 2 freq bobbed - 1 freq bobbit - 2 freq |
BABBIT |
| Time to execute Levenshtein function - 0.459197 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.708037 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.083691 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.038572 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.000857 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. |