| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| valentine (0) - 23 freq valentines (1) - 8 freq valentino (1) - 1 freq valantine (1) - 1 freq valentine's (2) - 8 freq 'valentine' (2) - 1 freq palestine (2) - 4 freq valerie (3) - 4 freq valencià (3) - 1 freq plentie (3) - 5 freq sklentin (3) - 4 freq talentid (3) - 1 freq parenting (3) - 2 freq vauntie (3) - 25 freq glentin (3) - 34 freq glentin- (3) - 1 freq aplentie (3) - 2 freq palestyne (3) - 1 freq valentines (3) - 3 freq ovaltine (3) - 1 freq parentin (3) - 1 freq talentit (3) - 6 freq ballantine (3) - 1 freq lamentin (3) - 7 freq valencians (3) - 1 freq |
valentine (0) - 23 freq valentino (1) - 1 freq valantine (1) - 1 freq valentines (2) - 8 freq ovaltine (4) - 1 freq glentin (4) - 34 freq valencian (4) - 6 freq plentin (4) - 1 freq valentine's (4) - 8 freq palestine (4) - 4 freq 'valentine' (4) - 1 freq glintin (5) - 15 freq gluntin (5) - 1 freq argentine (5) - 1 freq valenbisi (5) - 1 freq valencia (5) - 8 freq alienatin (5) - 1 freq luntin (5) - 1 freq plantin (5) - 22 freq slantin (5) - 2 freq lintin (5) - 2 freq vaultin (5) - 1 freq validatin (5) - 1 freq glentan (5) - 1 freq pluntin (5) - 7 freq |
SoundEx code - V453 violently - 16 freq violent - 18 freq volunteer - 18 freq valiant - 5 freq volunteert - 1 freq volunteers - 19 freq voluntary - 7 freq volunteerin - 2 freq valentines - 8 freq vailleant - 2 freq valentine's - 8 freq valentine - 23 freq volunteered - 6 freq voluntar - 1 freq voluntarlie - 1 freq volunteerts - 1 freq valentino - 1 freq 'volunteer' - 1 freq valentines - 3 freq volunteering - 4 freq valantine - 1 freq valentinasercla - 1 freq valentineswithnobody - 1 freq valentinesday - 3 freq 'valentine' - 1 freq volunteersweekscot - 1 freq volunteersweek - 2 freq volunteerscot - 2 freq |
MetaPhone code - FLNTN valentine - 23 freq flauntin - 3 freq valentino - 1 freq valantine - 1 freq 'valentine' - 1 freq |
VALENTINE |
| Time to execute Levenshtein function - 0.205111 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.435935 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.028094 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.076478 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.001205 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. |