| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| variant (0) - 16 freq variants (1) - 14 freq valiant (1) - 5 freq varyan (2) - 1 freq invariant (2) - 8 freq farrant (2) - 21 freq verdant (2) - 7 freq vagrant (2) - 1 freq carian (2) - 1 freq varit (2) - 1 freq carrant (2) - 2 freq versant (2) - 2 freq earrant (2) - 1 freq radiant (2) - 5 freq briant (2) - 1 freq variance (2) - 2 freq vacant (2) - 8 freq warrant (2) - 19 freq vapin (3) - 1 freq grant (3) - 101 freq varday (3) - 2 freq patient (3) - 59 freq sardane (3) - 1 freq vaina (3) - 1 freq alian (3) - 1 freq |
variant (0) - 16 freq variants (2) - 14 freq valiant (2) - 5 freq briant (3) - 1 freq versant (3) - 2 freq vacant (3) - 8 freq varit (3) - 1 freq variance (3) - 2 freq earrant (3) - 1 freq varyan (3) - 1 freq verdant (3) - 7 freq invariant (3) - 8 freq vagrant (3) - 1 freq truant (4) - 2 freq orient (4) - 1 freq taranty (4) - 1 freq avant (4) - 1 freq print (4) - 24 freq tyrant (4) - 5 freq darnt (4) - 1 freq byrant (4) - 1 freq bairnt (4) - 5 freq laarant (4) - 1 freq earnt (4) - 10 freq variety (4) - 62 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 - FRNT frooned - 8 freq verandah - 6 freq front - 733 freq friend - 86 freq freind - 13 freq farrant - 21 freq freend - 153 freq fahrend - 1 freq frowned - 11 freq 'freend' - 1 freq frond - 1 freq ferranti - 2 freq frunt - 21 freq furrent - 2 freq fronty - 6 freq frend - 1 freq veranda - 5 freq 'friend - 1 freq variant - 16 freq verandae - 1 freq 'friend' - 1 freq frint - 1 freq frouned - 2 freq frained - 1 freq €œfreend - 1 freq frontae - 1 freq farrent - 1 freq €˜freend - 1 freq €˜freand - 1 freq frownt - 1 freq ‘friendÂ’ - 1 freq |
VARIANT |
| Time to execute Levenshtein function - 0.201264 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.348524 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.027164 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.037696 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.000831 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. |