| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| venom-braith (0) - 1 freq hen-broth (5) - 1 freq besom-brayin (5) - 1 freq snaw-wraiths (6) - 2 freq noo-bit (6) - 1 freq eventbrite (6) - 1 freq braith (6) - 218 freq again-baith (6) - 1 freq benorth (6) - 2 freq deid-claith (6) - 1 freq veereith (6) - 1 freq enormity (6) - 3 freq whaul-braiths (6) - 1 freq venturit (6) - 1 freq venom-filled (6) - 1 freq seck-claith (6) - 3 freq penrith (6) - 1 freq galbraith (6) - 2 freq menorah (6) - 1 freq pent-brush (6) - 1 freq pent-braw (6) - 1 freq eediom-rich (6) - 1 freq weel-armit (7) - 1 freq tìoraidh (7) - 1 freq wuidgraith (7) - 1 freq |
venom-braith (0) - 1 freq hen-broth (7) - 1 freq again-baith (9) - 1 freq pent-brush (9) - 1 freq eventbrite (9) - 1 freq besom-brayin (9) - 1 freq venom-filled (10) - 1 freq venturit (10) - 1 freq penrith (10) - 1 freq whaul-braiths (10) - 1 freq eediom-rich (10) - 1 freq pent-braw (10) - 1 freq galbraith (10) - 2 freq braith (10) - 218 freq noo-bit (10) - 1 freq benorth (10) - 2 freq snaw-wraiths (10) - 2 freq veereith (10) - 1 freq en-route (11) - 1 freq muin-broch (11) - 1 freq i'north (11) - 1 freq pennyworth (11) - 3 freq braithe (11) - 2 freq raymcgrath (11) - 2 freq venturt (11) - 8 freq |
SoundEx code - V551 venom-filled - 1 freq venom-braith - 1 freq |
MetaPhone code - FNMBR0 venom-braith - 1 freq |
VENOM-BRAITH |
| Time to execute Levenshtein function - 0.271529 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.445526 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.030707 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.038618 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.000908 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. |