Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
volunteer (0) - 18 freq volunteers (1) - 19 freq volunteert (1) - 1 freq volunteered (2) - 6 freq volunteerts (2) - 1 freq 'volunteer' (2) - 1 freq volunteerin (2) - 2 freq voluntar (2) - 1 freq founther (3) - 1 freq volunteering (3) - 4 freq counter (3) - 20 freq pluntee (3) - 5 freq voluntary (3) - 7 freq voter (4) - 11 freq luntren (4) - 1 freq enteer (4) - 2 freq molester (4) - 1 freq honther (4) - 1 freq younker (4) - 3 freq fourteen (4) - 47 freq splutter (4) - 7 freq younger (4) - 125 freq plunger (4) - 1 freq bouster (4) - 1 freq blunner (4) - 1 freq |
volunteer (0) - 18 freq voluntar (2) - 1 freq volunteert (2) - 1 freq volunteers (2) - 19 freq volunteerin (3) - 2 freq volunteered (3) - 6 freq voluntary (3) - 7 freq 'volunteer' (4) - 1 freq volunteerts (4) - 1 freq pluntee (5) - 5 freq planter (5) - 6 freq volunteering (5) - 4 freq counter (5) - 20 freq blinter (5) - 2 freq aunter (6) - 2 freq vauntie (6) - 25 freq fluster (6) - 1 freq grunter (6) - 1 freq verneer (6) - 5 freq unter (6) - 1 freq pluntce (6) - 1 freq plunder (6) - 5 freq ventir (6) - 1 freq bluiter (6) - 1 freq coulter (6) - 6 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 - FLNTR volunteer - 18 freq voluntary - 7 freq voluntar - 1 freq 'volunteer' - 1 freq |
VOLUNTEER |
Time to execute Levenshtein function - 0.208100 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.422677 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.027621 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.041763 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.000942 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. |