| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aesier (0) - 13 freq aisier (1) - 12 freq aesie (1) - 3 freq aesir (1) - 4 freq aeriel (2) - 1 freq aedies (2) - 1 freq easier (2) - 114 freq busier (2) - 3 freq eser (2) - 1 freq aisie (2) - 11 freq assie (2) - 1 freq yester (2) - 4 freq aedie (2) - 1 freq aser (2) - 1 freq eesyer (2) - 1 freq answer (2) - 444 freq aesyir (2) - 1 freq aesiest (2) - 1 freq aster (2) - 1 freq sexier (2) - 1 freq airier (2) - 1 freq aesins (2) - 1 freq faemier (2) - 2 freq wester (2) - 6 freq yesser (2) - 1 freq |
aesier (0) - 13 freq aesir (1) - 4 freq aisier (1) - 12 freq eesyer (2) - 1 freq aesyir (2) - 1 freq aser (2) - 1 freq eser (2) - 1 freq easier (2) - 114 freq aesie (2) - 3 freq seer (3) - 39 freq aister (3) - 2 freq aese (3) - 8 freq ansuer (3) - 1 freq syer (3) - 1 freq ser (3) - 19 freq desir (3) - 1 freq aesed (3) - 2 freq asher (3) - 1 freq asseer (3) - 1 freq aeter (3) - 1 freq uiser (3) - 5 freq anser (3) - 5 freq ansir (3) - 1 freq siar (3) - 1 freq aesin (3) - 2 freq |
SoundEx code - A260 agree - 159 freq assure - 21 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 acre - 20 freq ajar - 4 freq azor - 4 freq asher - 1 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 - 114 freq aesir - 4 freq eezer - 1 freq aesier - 13 freq ezra - 3 freq eser - 1 freq |
AESIER |
| Time to execute Levenshtein function - 0.519708 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 - 1.094853 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.101062 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.108353 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.001096 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. |