| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acre (0) - 17 freq are (1) - 5053 freq acce (1) - 1 freq dacre (1) - 1 freq acne (1) - 1 freq ayre (1) - 8 freq cre (1) - 3 freq acrm (1) - 1 freq aire (1) - 61 freq aere (1) - 1 freq ache (1) - 14 freq acres (1) - 24 freq ace (1) - 19 freq cra (2) - 2 freq che (2) - 7 freq race (2) - 139 freq aur (2) - 1 freq pcr (2) - 1 freq ar (2) - 208 freq aaue (2) - 1 freq awye (2) - 13 freq coe (2) - 1 freq sabre (2) - 2 freq asure (2) - 1 freq lare (2) - 7 freq |
acre (0) - 17 freq cre (1) - 3 freq cree (2) - 3 freq crie (2) - 7 freq care (2) - 462 freq crue (2) - 1 freq acroo (2) - 1 freq acer (2) - 1 freq cry (2) - 368 freq core (2) - 54 freq cure (2) - 52 freq cra (2) - 2 freq crye (2) - 1 freq cr (2) - 8 freq aire (2) - 61 freq acce (2) - 1 freq dacre (2) - 1 freq acres (2) - 24 freq acne (2) - 1 freq acrm (2) - 1 freq ache (2) - 14 freq are (2) - 5053 freq aere (2) - 1 freq ace (2) - 19 freq ayre (2) - 8 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 - AKR agree - 156 freq augury - 1 freq aggro - 3 freq acroo - 1 freq acre - 17 freq aikeray - 2 freq akker - 1 freq ackir - 1 freq acair - 1 freq augur - 1 freq agr - 1 freq agri - 1 freq |
ACRE |
| Time to execute Levenshtein function - 0.185135 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.355518 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.027518 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.072212 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.000881 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. |