| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ashby (0) - 1 freq tashy (2) - 2 freq ah'y (2) - 3 freq asher (2) - 1 freq ashley (2) - 10 freq asky (2) - 2 freq sashay (2) - 3 freq absby (2) - 1 freq abby (2) - 16 freq achty (2) - 1 freq shay (2) - 4 freq ashen (2) - 2 freq asbo (2) - 1 freq shy (2) - 51 freq ashet (2) - 25 freq rashy (2) - 3 freq 'shy (2) - 1 freq ashak (2) - 1 freq ashe (2) - 1 freq ashes (2) - 20 freq aby (2) - 11 freq washy (2) - 1 freq assay (2) - 5 freq ash (2) - 32 freq nsfwy (3) - 1 freq |
ashby (0) - 1 freq shy (3) - 51 freq asbo (3) - 1 freq ashen (3) - 2 freq ashet (3) - 25 freq ashe (3) - 1 freq ash (3) - 32 freq ashes (3) - 20 freq shay (3) - 4 freq ashak (3) - 1 freq asher (3) - 1 freq sheba (3) - 3 freq ashley (3) - 10 freq shef (4) - 1 freq sha (4) - 2 freq shady (4) - 7 freq shok (4) - 1 freq shod (4) - 11 freq shuv (4) - 7 freq shaiy (4) - 1 freq sob (4) - 7 freq shij (4) - 1 freq shae (4) - 853 freq shao (4) - 2 freq shiny (4) - 70 freq |
SoundEx code - A210 agape - 2 freq aesop - 8 freq achieve - 35 freq aseef - 1 freq accep - 12 freq asbo - 1 freq agivey - 2 freq asap - 10 freq accepp - 3 freq ashby - 1 freq ausbau - 1 freq acuv - 1 freq aygxb - 1 freq agv - 1 freq agjjp - 1 freq aqp - 1 freq askjeff - 1 freq agp - 1 freq azv - 1 freq ayqv - 1 freq auxzv - 1 freq |
MetaPhone code - AXB ashby - 1 freq |
ASHBY |
| Time to execute Levenshtein function - 0.343401 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.500478 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.039509 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.050202 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.001261 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. |