| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acher (0) - 1 freq acer (1) - 1 freq archer (1) - 9 freq ache (1) - 14 freq ather (1) - 3 freq aches (1) - 10 freq asher (1) - 1 freq ncher (1) - 1 freq ached (1) - 4 freq cher (1) - 6 freq pawcher (2) - 1 freq tache (2) - 1 freq aner (2) - 2 freq dcer (2) - 1 freq alther (2) - 1 freq achan (2) - 2 freq echr (2) - 1 freq acted (2) - 9 freq aircher (2) - 1 freq ajer (2) - 2 freq father (2) - 84 freq aser (2) - 1 freq laicher (2) - 5 freq schir (2) - 2 freq ashen (2) - 2 freq |
acher (0) - 1 freq cher (1) - 6 freq chere (2) - 1 freq ichor (2) - 1 freq cheer (2) - 153 freq cheir (2) - 9 freq echr (2) - 1 freq char (2) - 2 freq ached (2) - 4 freq ache (2) - 14 freq archer (2) - 9 freq acer (2) - 1 freq ather (2) - 3 freq aches (2) - 10 freq ncher (2) - 1 freq asher (2) - 1 freq chaer (2) - 1 freq achim (3) - 2 freq anocher (3) - 1 freq oche (3) - 1 freq ther (3) - 111 freq acair (3) - 1 freq ahr (3) - 1 freq uther (3) - 9 freq chree (3) - 3 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 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 - AXR ashore - 35 freq ashaor - 1 freq ashoar - 3 freq asher - 1 freq acher - 1 freq |
ACHER |
| Time to execute Levenshtein function - 0.367514 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.798041 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.046085 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.076570 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.001204 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. |