| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| varyan (0) - 1 freq varyin (1) - 5 freq carean (2) - 2 freq vary (2) - 3 freq cryan (2) - 1 freq partan (2) - 17 freq warran (2) - 4 freq yarnan (2) - 3 freq harman (2) - 1 freq arran (2) - 15 freq varday (2) - 2 freq varra (2) - 1 freq variant (2) - 16 freq carian (2) - 1 freq aran (2) - 5 freq tarzan (2) - 4 freq valyae (2) - 1 freq barman (2) - 25 freq markan (2) - 1 freq layan (2) - 1 freq bryan (2) - 17 freq bayan (2) - 4 freq sayan (2) - 41 freq warman (2) - 2 freq ryan (2) - 32 freq |
varyan (0) - 1 freq varyin (1) - 5 freq bryan (3) - 17 freq ryan (3) - 32 freq aran (3) - 5 freq carian (3) - 1 freq laran (3) - 2 freq tryan (3) - 32 freq everyane (3) - 1 freq varying (3) - 7 freq variant (3) - 16 freq haroan (3) - 1 freq dryan (3) - 2 freq vary (3) - 3 freq cryan (3) - 1 freq carean (3) - 2 freq varra (3) - 1 freq arran (3) - 15 freq varday (3) - 2 freq viry (4) - 9 freq tyrian (4) - 1 freq warn (4) - 35 freq buryin (4) - 6 freq everywan (4) - 22 freq vrang (4) - 8 freq |
SoundEx code - V650 varyin - 5 freq vroom - 1 freq varyan - 1 freq veerin - 1 freq voorn - 1 freq verm - 1 freq |
MetaPhone code - FRYN fryin - 15 freq varyin - 5 freq ferryin - 2 freq varyan - 1 freq |
VARYAN |
| Time to execute Levenshtein function - 0.213672 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.432226 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.029294 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.047539 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.001208 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. |