| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acair (0) - 1 freq adair (1) - 1 freq cair (1) - 3 freq scair (1) - 2 freq ackir (1) - 1 freq avail (2) - 12 freq accur (2) - 1 freq cairo (2) - 2 freq achim (2) - 2 freq actor (2) - 19 freq thair (2) - 1955 freq abain (2) - 23 freq scar (2) - 16 freq caird (2) - 96 freq caig (2) - 1 freq scairt (2) - 6 freq bair (2) - 1 freq awayr (2) - 1 freq alain (2) - 8 freq caim (2) - 58 freq affair (2) - 36 freq aail (2) - 1 freq astir (2) - 1 freq padair (2) - 8 freq caie (2) - 2 freq |
acair (0) - 1 freq cair (1) - 3 freq caur (2) - 125 freq acer (2) - 1 freq caar (2) - 1 freq caer (2) - 5 freq cuir (2) - 2 freq car (2) - 413 freq cairy (2) - 16 freq scair (2) - 2 freq adair (2) - 1 freq cairo (2) - 2 freq ackir (2) - 1 freq acad (3) - 2 freq cara (3) - 3 freq aar (3) - 5 freq aweir (3) - 1 freq cain (3) - 24 freq i'air (3) - 7 freq 'car (3) - 1 freq care (3) - 465 freq acher (3) - 1 freq caiw (3) - 1 freq acan (3) - 1 freq awar (3) - 4 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 - AKR agree - 159 freq augury - 1 freq aggro - 3 freq acroo - 1 freq acre - 20 freq aikeray - 2 freq akker - 1 freq ackir - 1 freq acair - 1 freq augur - 1 freq agr - 1 freq agri - 1 freq |
ACAIR |
| Time to execute Levenshtein function - 0.167961 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.384292 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.028007 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.037391 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.000936 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. |