| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| venom-filled (0) - 1 freq cork-filled (5) - 2 freq shit-filled (5) - 1 freq sugar-filled (5) - 1 freq venomed (5) - 1 freq ash-filled (5) - 1 freq unfulfilled (5) - 1 freq unfufilled (5) - 1 freq fire-filled (5) - 1 freq gas-filled (5) - 1 freq ventricles (6) - 1 freq compiled (6) - 1 freq weel-iled (6) - 1 freq new-fillt (6) - 1 freq o'erfilled (6) - 1 freq lea-field (6) - 1 freq fullfilled (6) - 1 freq filled (6) - 152 freq milled (6) - 3 freq emailed (6) - 7 freq instilled (6) - 1 freq defiled (6) - 1 freq reffelled (6) - 1 freq recoiled (6) - 1 freq keilled (6) - 2 freq |
venom-filled (0) - 1 freq unfulfilled (8) - 1 freq unfufilled (8) - 1 freq fire-filled (8) - 1 freq gas-filled (8) - 1 freq ash-filled (8) - 1 freq cork-filled (8) - 2 freq shit-filled (8) - 1 freq sugar-filled (8) - 1 freq penny-falls (9) - 1 freq wind-fillt (9) - 1 freq new-fillt (9) - 1 freq venomed (9) - 1 freq renfield (10) - 2 freq compelled (10) - 3 freq enthralled (10) - 1 freq broomfield (10) - 1 freq so-called (10) - 3 freq benselled (10) - 1 freq enrolled (10) - 2 freq venom-braith (10) - 1 freq sneevilled (10) - 1 freq fulfilled (10) - 3 freq land-tiller (10) - 1 freq coke-fuelled (10) - 1 freq |
SoundEx code - V551 venom-filled - 1 freq venom-braith - 1 freq |
MetaPhone code - FNMFLT venom-filled - 1 freq |
VENOM-FILLED |
| Time to execute Levenshtein function - 0.255889 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.504991 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.061138 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.077241 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.000997 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. |