| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| validates (0) - 1 freq validate (1) - 4 freq validat (2) - 1 freq validatit (2) - 1 freq validatin (2) - 1 freq facinates (3) - 1 freq palates (3) - 1 freq salivate (3) - 1 freq halidays (3) - 1 freq invalidated (3) - 1 freq climates (3) - 6 freq radiates (3) - 3 freq candidates (3) - 15 freq validation (3) - 2 freq validity (3) - 6 freq an-dat's (4) - 1 freq navigate (4) - 7 freq animate (4) - 1 freq holiday's (4) - 1 freq salisted (4) - 1 freq caledones (4) - 1 freq estimates (4) - 1 freq haldane (4) - 2 freq vailues (4) - 2 freq haliday (4) - 1 freq |
validates (0) - 1 freq validate (2) - 4 freq validatit (3) - 1 freq validatin (3) - 1 freq validat (3) - 1 freq validation (4) - 2 freq validity (4) - 6 freq radiates (5) - 3 freq invalidated (5) - 1 freq climates (5) - 6 freq palates (5) - 1 freq halidays (5) - 1 freq variants (6) - 14 freq holidays (6) - 87 freq elites (6) - 5 freq evaluate (6) - 1 freq valais (6) - 1 freq delegates (6) - 3 freq valles (6) - 1 freq slidies (6) - 1 freq valiant (6) - 5 freq volts (6) - 3 freq vales (6) - 4 freq vlisses (6) - 2 freq vallies (6) - 1 freq |
SoundEx code - V433 vaultit - 2 freq validation - 2 freq violated - 2 freq validate - 4 freq validity - 6 freq vaulted - 1 freq validatin - 1 freq validatit - 1 freq validat - 1 freq validates - 1 freq |
MetaPhone code - FLTTS validates - 1 freq |
VALIDATES |
| Time to execute Levenshtein function - 0.271006 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.610268 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.035994 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.051243 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.001158 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. |