| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vendetta (0) - 1 freq netta (3) - 6 freq endeth (3) - 1 freq venera (3) - 2 freq denwette (3) - 1 freq rendert (3) - 3 freq endet (3) - 42 freq vdett (3) - 1 freq bennett (3) - 6 freq veleta (3) - 1 freq venetian (3) - 2 freq entent (4) - 1 freq tendit (4) - 19 freq tennents (4) - 6 freq bended (4) - 4 freq mindet (4) - 2 freq ledeit (4) - 2 freq vennels (4) - 12 freq tenent (4) - 2 freq rennet (4) - 1 freq eident (4) - 47 freq geneva (4) - 16 freq geordietta (4) - 17 freq eydent (4) - 20 freq serepta (4) - 1 freq |
vendetta (0) - 1 freq vdett (4) - 1 freq venetian (5) - 2 freq endytit (5) - 1 freq banditti (5) - 1 freq endet (5) - 42 freq bennett (5) - 6 freq rendert (5) - 3 freq denwette (5) - 1 freq endeth (5) - 1 freq netta (5) - 6 freq verdict (6) - 30 freq endite (6) - 1 freq eventfa (6) - 1 freq vatta (6) - 1 freq dundert (6) - 1 freq lundert (6) - 1 freq eventuate (6) - 1 freq confettae (6) - 1 freq bernadette (6) - 2 freq pendant (6) - 1 freq ventur (6) - 6 freq vendin (6) - 2 freq fondest (6) - 1 freq endoits (6) - 1 freq |
SoundEx code - V533 vaunted - 2 freq vanded - 1 freq vomited - 4 freq vendetta - 1 freq |
MetaPhone code - FNTT vaunted - 2 freq fainted - 5 freq foondit - 41 freq fundit - 19 freq funded - 13 freq founded - 3 freq foondet - 1 freq faintit - 7 freq faintet - 6 freq vanded - 1 freq fendit - 11 freq foonded - 1 freq foundit - 6 freq fentit - 3 freq feintit - 1 freq fundiet - 1 freq vendetta - 1 freq fendt - 2 freq |
VENDETTA |
| Time to execute Levenshtein function - 0.245736 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.504366 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.032680 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.043237 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.000912 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. |