| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ajer (0) - 2 freq majer (1) - 1 freq aser (1) - 1 freq ajar (1) - 4 freq afer (1) - 1 freq acer (1) - 1 freq aver (1) - 4 freq ajr (1) - 1 freq wajer (1) - 1 freq ajee (1) - 21 freq jer (1) - 1 freq aner (1) - 2 freq aer (1) - 67 freq auer (1) - 1 freq aeter (2) - 1 freq aked (2) - 1 freq anger (2) - 68 freq meer (2) - 9 freq anew (2) - 14 freq ayur (2) - 1 freq abe (2) - 3 freq reer (2) - 1 freq axed (2) - 81 freq awar (2) - 4 freq sojer (2) - 23 freq |
ajer (0) - 2 freq jer (1) - 1 freq ajar (1) - 4 freq ajr (1) - 1 freq aer (2) - 67 freq auer (2) - 1 freq jeer (2) - 7 freq jar (2) - 41 freq jr (2) - 16 freq aner (2) - 2 freq acer (2) - 1 freq ajee (2) - 21 freq aser (2) - 1 freq aver (2) - 4 freq afer (2) - 1 freq wajer (2) - 1 freq majer (2) - 1 freq awery (3) - 1 freq seer (3) - 39 freq laer (3) - 1 freq ajay (3) - 2 freq her (3) - 14018 freq peer (3) - 196 freq feer (3) - 4 freq ner (3) - 53 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 - AJR aiger - 2 freq ajar - 4 freq ajr - 1 freq ajer - 2 freq |
AJER |
| Time to execute Levenshtein function - 0.195246 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.337169 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.027620 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.038136 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.000850 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. |