| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vtv (0) - 1 freq vv (1) - 1 freq itv (1) - 4 freq mtv (1) - 2 freq vtz (1) - 1 freq atv (1) - 1 freq stv (1) - 12 freq vlv (1) - 1 freq viv (1) - 1 freq vtl (1) - 1 freq utv (1) - 1 freq tv (1) - 208 freq btv (1) - 1 freq ytk (2) - 1 freq pta (2) - 1 freq vjq (2) - 1 freq vo (2) - 8 freq cdv (2) - 1 freq pte (2) - 4 freq etf (2) - 1 freq vhn (2) - 1 freq vin (2) - 6 freq ct (2) - 8 freq vpp (2) - 1 freq dtg (2) - 1 freq |
vtv (0) - 1 freq viv (2) - 1 freq vtl (2) - 1 freq btv (2) - 1 freq vlv (2) - 1 freq tv (2) - 208 freq utv (2) - 1 freq vv (2) - 1 freq stv (2) - 12 freq itv (2) - 4 freq mtv (2) - 2 freq atv (2) - 1 freq vtz (2) - 1 freq dutv (3) - 2 freq vats (3) - 2 freq uvvv (3) - 1 freq vuty (3) - 1 freq vtuq (3) - 1 freq vath (3) - 1 freq ivv (3) - 1 freq vat (3) - 12 freq veev (3) - 1 freq vet (3) - 37 freq stiv (3) - 1 freq vivi (3) - 2 freq |
SoundEx code - V310 vdb - 3 freq vdef - 1 freq vtv - 1 freq |
MetaPhone code - FTF fatefu' - 1 freq fatefu - 5 freq fuitfaw - 1 freq fit've - 1 freq fit-faw - 1 freq fit'v - 1 freq fitfaa - 1 freq vdef - 1 freq vtv - 1 freq |
VTV |
| Time to execute Levenshtein function - 0.209056 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.486818 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.032298 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.043422 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.001136 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. |