| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aesier (0) - 13 freq aesie (1) - 2 freq aesir (1) - 4 freq aisier (1) - 12 freq aerlier (2) - 8 freq asseer (2) - 1 freq aesins (2) - 1 freq faemier (2) - 2 freq answer (2) - 438 freq denier (2) - 1 freq yesser (2) - 1 freq absie (2) - 1 freq sester (2) - 2 freq aedies (2) - 1 freq aister (2) - 2 freq sexier (2) - 1 freq airier (2) - 1 freq eser (2) - 1 freq eesyer (2) - 1 freq mester (2) - 12 freq pester (2) - 2 freq aesiest (2) - 1 freq aster (2) - 1 freq assie (2) - 1 freq aefter (2) - 4 freq |
aesier (0) - 13 freq aisier (1) - 12 freq aesir (1) - 4 freq eesyer (2) - 1 freq aser (2) - 1 freq aesyir (2) - 1 freq eser (2) - 1 freq easier (2) - 111 freq aesie (2) - 2 freq yester (3) - 4 freq aesed (3) - 2 freq ansir (3) - 1 freq aesily (3) - 2 freq desir (3) - 1 freq aese (3) - 8 freq anser (3) - 5 freq busier (3) - 3 freq syer (3) - 1 freq seer (3) - 39 freq yaiser (3) - 3 freq user (3) - 3 freq siar (3) - 1 freq sir (3) - 356 freq aisie (3) - 11 freq aesin (3) - 2 freq |
SoundEx code - A260 agree - 156 freq assure - 20 freq assuir - 2 freq aisier - 12 freq azr - 1 freq ashore - 35 freq augury - 1 freq aggro - 3 freq aesir - 4 freq aiger - 2 freq ashaor - 1 freq ashoar - 3 freq accur - 1 freq acroo - 1 freq ajar - 4 freq azor - 4 freq asher - 1 freq acre - 17 freq azariah - 2 freq aser - 1 freq aesier - 13 freq acquire - 3 freq azure - 3 freq acer - 1 freq aikeray - 2 freq a'haacro - 1 freq auskerry - 1 freq akker - 1 freq asseer - 1 freq ackir - 1 freq acair - 1 freq asseir - 1 freq augur - 1 freq €™azur - 1 freq aesyir - 1 freq acher - 1 freq agr - 1 freq augher - 1 freq agri - 1 freq ajr - 1 freq ajer - 2 freq asure - 1 freq |
MetaPhone code - ESR easier - 111 freq aesir - 4 freq eezer - 1 freq aesier - 13 freq ezra - 3 freq eser - 1 freq |
AESIER |
| Time to execute Levenshtein function - 0.199731 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.353069 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.027158 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.036890 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.000873 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. |