| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aisier (0) - 12 freq airier (1) - 1 freq aisie (1) - 11 freq aesier (1) - 13 freq aister (1) - 2 freq ainger (2) - 3 freq mister (2) - 84 freq isie (2) - 79 freq airies (2) - 1 freq aisles (2) - 3 freq ainer (2) - 2 freq fister (2) - 2 freq daisies (2) - 20 freq aisse (2) - 4 freq alister (2) - 1 freq aser (2) - 1 freq pisher (2) - 1 freq aesie (2) - 2 freq ailie (2) - 1 freq yaiser (2) - 3 freq kaiser (2) - 1 freq aesir (2) - 4 freq aise (2) - 14 freq airlier (2) - 16 freq maister (2) - 216 freq |
aisier (0) - 12 freq aesier (1) - 13 freq aesir (2) - 4 freq uiser (2) - 5 freq yaiser (2) - 3 freq aser (2) - 1 freq easier (2) - 113 freq aisie (2) - 11 freq airier (2) - 1 freq aister (2) - 2 freq aster (3) - 1 freq busier (3) - 3 freq oilier (3) - 1 freq asher (3) - 1 freq aider (3) - 2 freq eisie (3) - 2 freq aisin (3) - 1 freq ansir (3) - 1 freq aiver (3) - 3 freq miser (3) - 4 freq airer (3) - 1 freq aisle (3) - 27 freq airie (3) - 1 freq assie (3) - 1 freq eser (3) - 1 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 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 - ASR assure - 21 freq assuir - 2 freq aisier - 12 freq azr - 1 freq azor - 4 freq azariah - 2 freq aser - 1 freq azure - 3 freq acer - 1 freq asseer - 1 freq asseir - 1 freq €™azur - 1 freq asure - 1 freq |
AISIER |
| Time to execute Levenshtein function - 0.201699 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.342493 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.027484 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.036840 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.000947 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. |