| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ajr (0) - 1 freq aer (1) - 67 freq aur (1) - 1 freq agr (1) - 1 freq atr (1) - 1 freq a'r (1) - 2 freq aar (1) - 5 freq pjr (1) - 1 freq azr (1) - 1 freq tjr (1) - 1 freq njr (1) - 1 freq air (1) - 1001 freq ayr (1) - 71 freq aj (1) - 6 freq ahr (1) - 1 freq anr (1) - 1 freq jr (1) - 17 freq gjr (1) - 1 freq ar (1) - 208 freq ajer (1) - 2 freq mjr (1) - 23 freq ajar (1) - 4 freq ajm (1) - 1 freq aire (2) - 61 freq aird (2) - 3 freq |
ajr (0) - 1 freq ajar (1) - 4 freq jr (1) - 17 freq ajer (1) - 2 freq mjr (2) - 23 freq gjr (2) - 1 freq anr (2) - 1 freq ajm (2) - 1 freq jru (2) - 1 freq jer (2) - 1 freq jar (2) - 41 freq jaur (2) - 23 freq ahr (2) - 1 freq ar (2) - 208 freq aj (2) - 6 freq aer (2) - 67 freq a'r (2) - 2 freq atr (2) - 1 freq aur (2) - 1 freq agr (2) - 1 freq pjr (2) - 1 freq aar (2) - 5 freq air (2) - 1001 freq tjr (2) - 1 freq azr (2) - 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 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 - AJR aiger - 2 freq ajar - 4 freq ajr - 1 freq ajer - 2 freq |
AJR |
| Time to execute Levenshtein function - 0.274536 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.512267 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.027611 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.085015 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.000918 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. |