| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anniversiry (0) - 2 freq anniversary (1) - 28 freq anniversery (1) - 1 freq anniversar (2) - 5 freq university (3) - 129 freq thanniversary (3) - 1 freq 'university (3) - 2 freq anniversarie (3) - 3 freq adversity (4) - 7 freq diversity (4) - 73 freq adversary (4) - 1 freq anniversaries (4) - 1 freq diversify (4) - 3 freq unnerside (5) - 1 freq universality (5) - 1 freq onniemair (5) - 1 freq diversion (5) - 4 freq nivermore (5) - 1 freq unnecessary (5) - 1 freq aiverie (5) - 3 freq universal (5) - 46 freq aversion (5) - 3 freq versify (5) - 1 freq universe's (5) - 1 freq university's (5) - 1 freq |
anniversiry (0) - 2 freq anniversery (1) - 1 freq anniversary (1) - 28 freq anniversar (2) - 5 freq anniversarie (3) - 3 freq anniversaries (5) - 1 freq thanniversary (5) - 1 freq university (5) - 129 freq 'university (5) - 2 freq adversary (6) - 1 freq conversin (7) - 2 freq universe' (7) - 1 freq 'universe (7) - 1 freq nivermair (7) - 1 freq inversion (7) - 1 freq universitie (7) - 8 freq uiniversitie (7) - 1 freq universal (7) - 46 freq universe (7) - 42 freq univairsity (7) - 8 freq conversely (7) - 2 freq 'universal (7) - 3 freq conversion (7) - 3 freq unnerside (7) - 1 freq openuniversity (7) - 4 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 |
ANNIVERSIRY |
| Time to execute Levenshtein function - 0.284779 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.425848 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.031969 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.047149 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.000868 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. |