Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aetshirts (0) - 2 freq ayrshires (3) - 1 freq ootskirts (3) - 10 freq t-shirts (3) - 11 freq teeshirt (3) - 2 freq gethirt (3) - 1 freq tee-shirts (3) - 1 freq shirts (3) - 21 freq outskirts (3) - 6 freq bastirts (4) - 1 freq ayrshire (4) - 96 freq veesits (4) - 15 freq desairs (4) - 1 freq shifts (4) - 38 freq ootshines (4) - 1 freq bettirs (4) - 1 freq lettirs (4) - 1 freq affshoots (4) - 1 freq thirty (4) - 137 freq asserts (4) - 1 freq airts (4) - 356 freq aesir (4) - 4 freq veisits (4) - 8 freq thir's (4) - 121 freq dessirt (4) - 1 freq |
aetshirts (0) - 2 freq tee-shirts (4) - 1 freq outskirts (4) - 6 freq teeshirt (4) - 2 freq shirts (4) - 21 freq t-shirts (4) - 11 freq ootskirts (4) - 10 freq shorts (5) - 42 freq ayrshires (5) - 1 freq aithers (6) - 7 freq ayrshire's (6) - 2 freq shirt (6) - 75 freq tethert (6) - 3 freq authors (6) - 16 freq ithirs (6) - 10 freq feshers (6) - 1 freq ayreshires (6) - 1 freq ashets (6) - 14 freq fyshirs (6) - 6 freq shirty (6) - 1 freq teuchits (6) - 1 freq authort (6) - 2 freq thirs (6) - 41 freq athort (6) - 122 freq aathor's (6) - 1 freq |
SoundEx code - A326 adjourn - 3 freq adjourns - 2 freq autographed - 2 freq aithsworn - 4 freq autocar - 1 freq attackers - 1 freq autographs - 2 freq autograph - 1 freq adwisory - 14 freq autocrat - 4 freq autosort - 1 freq autocorrect - 7 freq autocorrects - 1 freq adcramps - 1 freq aetshirts - 2 freq aetgraphics - 1 freq |
MetaPhone code - ETXRTS aetshirts - 2 freq |
AETSHIRTS |
Time to execute Levenshtein function - 0.201118 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.386871 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.027829 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.037095 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.000921 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. |