| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| belittle (0) - 1 freq belittled (1) - 1 freq brittle (2) - 9 freq eittle (2) - 1 freq belittlin (2) - 1 freq dolittle (2) - 1 freq baittle (2) - 2 freq little (2) - 421 freq bittle (2) - 1 freq 'little (2) - 1 freq boattle (3) - 41 freq cuittle (3) - 1 freq bette (3) - 3 freq beetle (3) - 4 freq elite (3) - 22 freq befittin (3) - 2 freq belie (3) - 2 freq refettle (3) - 1 freq lyttle (3) - 2 freq beltel (3) - 4 freq bittae (3) - 2 freq littie (3) - 1 freq belteve (3) - 1 freq mittle (3) - 1 freq blithe (3) - 48 freq |
belittle (0) - 1 freq belittled (2) - 1 freq little (3) - 421 freq baittle (3) - 2 freq 'little (3) - 1 freq bittle (3) - 1 freq dolittle (3) - 1 freq belittlin (3) - 1 freq brittle (3) - 9 freq battle (4) - 125 freq brattle (4) - 10 freq beltel (4) - 4 freq bottle (4) - 381 freq eittle (4) - 1 freq blithlie (4) - 1 freq boattle (4) - 41 freq lyttle (4) - 2 freq kettle (5) - 85 freq whittle (5) - 3 freq nettle (5) - 8 freq mettle (5) - 12 freq bittie (5) - 556 freq ettle (5) - 190 freq lhttle (5) - 1 freq befitted (5) - 1 freq |
SoundEx code - B434 boldly - 8 freq blithely - 9 freq blately - 2 freq bluid'll - 1 freq bluidlust - 4 freq blythely - 5 freq bolt-hole - 1 freq bladeless - 1 freq bulletholes - 1 freq bowldly - 1 freq blate-like - 16 freq bauldly - 4 freq bieldless - 1 freq blaet-laek - 1 freq blythelie - 2 freq belittlin - 1 freq blatelike - 1 freq blythelike - 1 freq bluidless - 1 freq blythly - 1 freq blate-lik - 1 freq bauld-lik - 1 freq blithlie - 1 freq belittled - 1 freq beldhill - 2 freq bluid-line - 1 freq bluidlessness - 1 freq bluddylongjourney - 1 freq beltel - 4 freq belittle - 1 freq |
MetaPhone code - BLTL boldly - 8 freq blately - 2 freq bluid'll - 1 freq bowldly - 1 freq bauldly - 4 freq beltel - 4 freq belittle - 1 freq |
BELITTLE |
| Time to execute Levenshtein function - 0.252014 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.400354 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.030065 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.037812 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.000889 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. |