| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| variants (0) - 14 freq variant (1) - 16 freq furiants (2) - 1 freq valiant (2) - 5 freq carrants (2) - 3 freq variance (2) - 2 freq arran's (3) - 1 freq carian (3) - 1 freq viands (3) - 3 freq saints (3) - 18 freq harman's (3) - 1 freq arins (3) - 1 freq sprints (3) - 4 freq caracts (3) - 1 freq brians (3) - 1 freq rants (3) - 6 freq sairvants (3) - 4 freq marias (3) - 1 freq vaines (3) - 1 freq vrichts (3) - 1 freq dorian's (3) - 16 freq sarpints (3) - 1 freq tyrants (3) - 3 freq varyan (3) - 1 freq marion's (3) - 1 freq |
variants (0) - 14 freq variant (2) - 16 freq furiants (3) - 1 freq tyrants (4) - 3 freq parents (4) - 180 freq prints (4) - 13 freq vrans (4) - 1 freq errants (4) - 4 freq rants (4) - 6 freq grants (4) - 30 freq carrants (4) - 3 freq valiant (4) - 5 freq variance (4) - 2 freq barents (4) - 1 freq various (5) - 61 freq taints (5) - 1 freq varit (5) - 1 freq farins (5) - 1 freq paints (5) - 2 freq pairents (5) - 1 freq sairgants (5) - 1 freq agitants (5) - 1 freq servants (5) - 45 freq vanities (5) - 1 freq barins (5) - 4 freq |
SoundEx code - V653 verandah - 6 freq variants - 14 freq veranda - 5 freq variant - 16 freq verandae - 1 freq verandas - 1 freq varindersingh - 2 freq |
MetaPhone code - FRNTS freends - 181 freq friends - 79 freq freinds - 8 freq furiants - 1 freq frunts - 1 freq fronts - 1 freq variants - 14 freq fre'nds - 1 freq y-fronts - 2 freq 'friends' - 2 freq furnitiz - 1 freq fronds - 3 freq freend's - 1 freq freends' - 1 freq verandas - 1 freq friend's - 1 freq |
VARIANTS |
| Time to execute Levenshtein function - 0.332236 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.468026 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.042303 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.038319 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.000941 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. |