Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uile (0) - 1 freq lile (1) - 1 freq bile (1) - 56 freq pile (1) - 110 freq jile (1) - 42 freq sile (1) - 9 freq vile (1) - 14 freq tile (1) - 5 freq rile (1) - 3 freq quile (1) - 1 freq mile (1) - 275 freq wile (1) - 164 freq ile (1) - 65 freq file (1) - 118 freq uill (1) - 4 freq buile (1) - 1 freq nile (1) - 14 freq eile (1) - 1 freq uise (1) - 281 freq uize (1) - 14 freq yuile (1) - 1 freq guile (1) - 4 freq mole (2) - 11 freq urie (2) - 1 freq mire (2) - 14 freq |
uile (0) - 1 freq yuile (1) - 1 freq eile (1) - 1 freq ile (1) - 65 freq ily (2) - 2 freq oyle (2) - 3 freq ale (2) - 51 freq aale (2) - 1 freq ole (2) - 2 freq oil (2) - 89 freq ailie (2) - 1 freq ul (2) - 9 freq eil (2) - 10 freq yil (2) - 4 freq il (2) - 39 freq aule (2) - 1 freq ail (2) - 5 freq yle (2) - 2 freq yule (2) - 78 freq lie (2) - 259 freq ilie (2) - 1 freq oiyle (2) - 1 freq yale (2) - 7 freq iley (2) - 4 freq le (2) - 53 freq |
SoundEx code - U400 ull - 24 freq ul - 9 freq 'ull - 1 freq uill - 4 freq uillie - 1 freq €˜ull - 8 freq €™ull - 1 freq u'll - 1 freq uile - 1 freq |
MetaPhone code - UL ull - 24 freq ul - 9 freq 'ull - 1 freq uill - 4 freq uillie - 1 freq €˜ull - 8 freq €™ull - 1 freq u'll - 1 freq uile - 1 freq |
UILE |
Time to execute Levenshtein function - 0.199421 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.405550 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.030344 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.038082 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.000773 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. |