| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aiger (0) - 2 freq aiver (1) - 3 freq airer (1) - 1 freq niger (1) - 1 freq tiger (1) - 27 freq ainer (1) - 2 freq ainger (1) - 3 freq vaiger (1) - 1 freq aider (1) - 2 freq aige (1) - 11 freq anger (1) - 73 freq aiges (1) - 3 freq lairger (2) - 10 freq daiker (2) - 2 freq neiger (2) - 1 freq rider (2) - 10 freq ligger (2) - 1 freq anter (2) - 1 freq einer (2) - 1 freq aeter (2) - 1 freq minger (2) - 7 freq hirer (2) - 2 freq rigor (2) - 1 freq aiex (2) - 1 freq vaiged (2) - 1 freq |
aiger (0) - 2 freq eeger (2) - 1 freq aiges (2) - 3 freq agr (2) - 1 freq augur (2) - 1 freq igor (2) - 6 freq eager (2) - 27 freq ger (2) - 2 freq anger (2) - 73 freq gier (2) - 2 freq tiger (2) - 27 freq aige (2) - 11 freq niger (2) - 1 freq airer (2) - 1 freq ainer (2) - 2 freq ainger (2) - 3 freq aider (2) - 2 freq vaiger (2) - 1 freq aiver (2) - 3 freq lager (3) - 39 freq moger (3) - 1 freq wauger (3) - 3 freq ajer (3) - 2 freq airier (3) - 1 freq baager (3) - 15 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 |
AIGER |
| Time to execute Levenshtein function - 0.194626 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.361880 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.027508 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.036860 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.000878 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. |