| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asher (0) - 1 freq hasher (1) - 1 freq ashet (1) - 25 freq ashes (1) - 18 freq ashen (1) - 2 freq ashe (1) - 1 freq washer (1) - 5 freq acher (1) - 1 freq aser (1) - 1 freq ather (1) - 3 freq usher (1) - 3 freq aster (1) - 1 freq rasher (1) - 1 freq cashed (2) - 3 freq ahr (2) - 1 freq shar (2) - 6 freq answer (2) - 438 freq shed (2) - 161 freq fashes (2) - 5 freq ither (2) - 3062 freq aver (2) - 4 freq bashes (2) - 1 freq ahem (2) - 12 freq ushers (2) - 2 freq esther (2) - 46 freq |
asher (0) - 1 freq usher (1) - 3 freq sheur (2) - 1 freq shir (2) - 1 freq sheir (2) - 1 freq shoer (2) - 1 freq ashaor (2) - 1 freq ashoar (2) - 3 freq shr (2) - 1 freq shear (2) - 9 freq shyer (2) - 1 freq ashore (2) - 35 freq shar (2) - 6 freq sheer (2) - 54 freq aster (2) - 1 freq ashes (2) - 18 freq ather (2) - 3 freq rasher (2) - 1 freq hasher (2) - 1 freq ashet (2) - 25 freq washer (2) - 5 freq acher (2) - 1 freq ashe (2) - 1 freq aser (2) - 1 freq ashen (2) - 2 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 - AXR ashore - 35 freq ashaor - 1 freq ashoar - 3 freq asher - 1 freq acher - 1 freq |
ASHER |
| Time to execute Levenshtein function - 0.225789 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.407777 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.032424 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.037317 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.000797 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. |