| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vanir (0) - 5 freq anar (2) - 1 freq wanit (2) - 1 freq kvasir (2) - 3 freq onnir (2) - 1 freq yair (2) - 1 freq van's (2) - 1 freq vader (2) - 3 freq yanin (2) - 1 freq nir (2) - 49 freq manor (2) - 4 freq aaner (2) - 1 freq €œnir (2) - 1 freq ganie (2) - 6 freq ani' (2) - 1 freq wanis (2) - 3 freq veni (2) - 1 freq ranit (2) - 2 freq nanr (2) - 1 freq vain (2) - 30 freq vail (2) - 2 freq dair (2) - 11 freq wair (2) - 6 freq cani (2) - 2 freq cair (2) - 3 freq |
vanir (0) - 5 freq vaar (3) - 1 freq var (3) - 8 freq maner (3) - 4 freq anr (3) - 1 freq vannie (3) - 4 freq vand (3) - 2 freq vann (3) - 3 freq ventir (3) - 1 freq vairy (3) - 1 freq vanity (3) - 10 freq senir (3) - 1 freq van (3) - 161 freq vanes (3) - 2 freq vaned (3) - 1 freq venera (3) - 2 freq veneer (3) - 1 freq vance (3) - 6 freq nair (3) - 2 freq vir (3) - 1 freq vndir (3) - 1 freq aner (3) - 2 freq vini (3) - 2 freq vans (3) - 22 freq vdnr (3) - 1 freq |
SoundEx code - V560 vanir - 5 freq vimmer - 3 freq venera - 2 freq veneer - 1 freq |
MetaPhone code - FNR finer - 14 freq vanir - 5 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq funnier - 7 freq venera - 2 freq veneer - 1 freq fnaar - 2 freq |
VANIR |
| Time to execute Levenshtein function - 0.254194 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.459338 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.035488 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.047585 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.001182 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. |