| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anniversary (0) - 28 freq anniversar (1) - 5 freq anniversery (1) - 1 freq anniversiry (1) - 2 freq thanniversary (2) - 1 freq anniversarie (2) - 3 freq adversary (3) - 1 freq anniversaries (3) - 1 freq university (4) - 130 freq universal (4) - 46 freq 'universal (4) - 3 freq 'university (4) - 2 freq universally (4) - 5 freq unnecessary (4) - 1 freq onniewhare (5) - 1 freq €˜universal (5) - 1 freq literary (5) - 63 freq necessary (5) - 26 freq unnerway (5) - 1 freq infirmary (5) - 10 freq €˜literary (5) - 1 freq annider (5) - 3 freq leiterary (5) - 3 freq annemar (5) - 1 freq wannecessar (5) - 1 freq |
anniversary (0) - 28 freq anniversiry (1) - 2 freq anniversery (1) - 1 freq anniversar (1) - 5 freq anniversarie (2) - 3 freq anniversaries (4) - 1 freq thanniversary (4) - 1 freq adversary (5) - 1 freq unnecessary (6) - 1 freq 'university (6) - 2 freq university (6) - 130 freq 'universal (6) - 3 freq universal (6) - 46 freq unnecessar (7) - 5 freq nivermore (7) - 1 freq universe (7) - 42 freq nivermair (7) - 1 freq universally (7) - 5 freq inveraray (7) - 2 freq universe' (7) - 1 freq 'universe (7) - 1 freq conversely (7) - 2 freq nevermar (7) - 1 freq univairsity (8) - 8 freq unnerside (8) - 1 freq |
SoundEx code - A516 anniversary - 28 freq amber - 13 freq anniversiry - 2 freq anniversaries - 1 freq awenbracin - 1 freq anniversery - 1 freq ambroise - 2 freq ambrosianae' - 1 freq anniversarie - 3 freq anniversar - 5 freq amphora - 1 freq €œane-pairty - 1 freq ambros - 1 freq €˜amber - 1 freq aimfor - 2 freq |
MetaPhone code - ANFRSR anniversary - 28 freq anniversiry - 2 freq anniversery - 1 freq anniversarie - 3 freq anniversar - 5 freq |
ANNIVERSARY |
| Time to execute Levenshtein function - 0.193966 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.376698 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.031345 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.039661 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.001127 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. |