| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vitals (0) - 1 freq vital (1) - 31 freq vittals (1) - 2 freq vittles (2) - 1 freq vaital (2) - 1 freq rituals (2) - 3 freq votars (2) - 4 freq victuals (2) - 5 freq tials (2) - 1 freq spitals (2) - 1 freq italys (2) - 1 freq titans (2) - 1 freq vitally (2) - 1 freq rivals (2) - 3 freq itall (2) - 1 freq nibals (2) - 1 freq vicars (2) - 1 freq metals (2) - 5 freq petals (2) - 22 freq dials (2) - 11 freq viral (2) - 3 freq vita (2) - 1 freq vivas (2) - 1 freq viral' (2) - 1 freq vitae (2) - 3 freq |
vitals (0) - 1 freq vittals (2) - 2 freq vital (2) - 31 freq italys (3) - 1 freq vitally (3) - 1 freq petals (3) - 22 freq tials (3) - 1 freq metals (3) - 5 freq vigils (3) - 1 freq victuals (3) - 5 freq vaital (3) - 1 freq rituals (3) - 3 freq vittles (3) - 1 freq votars (3) - 4 freq vooels (4) - 2 freq vls (4) - 1 freq vets (4) - 9 freq entails (4) - 1 freq votes (4) - 69 freq tails (4) - 54 freq tales (4) - 149 freq btls (4) - 1 freq vats (4) - 2 freq tels (4) - 4 freq villas (4) - 2 freq |
SoundEx code - V342 vitals - 1 freq vittles - 1 freq vittals - 2 freq |
MetaPhone code - FTLS fiddles - 18 freq fiedles - 2 freq vitals - 1 freq vittles - 1 freq fiddiles - 1 freq fut-loose - 1 freq fuitloose - 1 freq vittals - 2 freq fitloose - 1 freq |
VITALS |
| Time to execute Levenshtein function - 0.204626 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.403511 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.028692 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.037049 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.000947 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. |