| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ashmill (0) - 3 freq ahill (2) - 1 freq asweill (2) - 2 freq shrill (2) - 20 freq dasheill (2) - 1 freq auchmill (2) - 3 freq shill (2) - 4 freq averill (3) - 1 freq smile (3) - 450 freq ashkirk (3) - 2 freq shil (3) - 1 freq winmill (3) - 1 freq whill (3) - 13 freq sho'll (3) - 2 freq 'spill (3) - 1 freq 'shell (3) - 1 freq aweill (3) - 6 freq kashmiri (3) - 1 freq shi'll (3) - 1 freq shilla (3) - 3 freq sempill (3) - 3 freq jhill (3) - 19 freq uphill (3) - 3 freq swill (3) - 2 freq asail (3) - 1 freq |
ashmill (0) - 3 freq shrill (3) - 20 freq auchmill (3) - 3 freq shill (3) - 4 freq shrilly (4) - 1 freq small (4) - 73 freq shall (4) - 120 freq shi'll (4) - 1 freq shilla (4) - 3 freq smyll (4) - 2 freq smaill (4) - 1 freq shu'll (4) - 2 freq shull (4) - 6 freq shell (4) - 40 freq she'll (4) - 204 freq smell (4) - 263 freq sawmill (4) - 9 freq dasheill (4) - 1 freq sho'll (4) - 2 freq asweill (4) - 2 freq ahill (4) - 1 freq simile (5) - 2 freq aswell (5) - 6 freq chill (5) - 45 freq squill (5) - 4 freq |
SoundEx code - A254 acknowledged - 12 freq acknawledge - 3 freq acknowledgement - 13 freq auchmill - 3 freq acknowledgin - 3 freq auchinleck - 13 freq acumulaitet - 1 freq accumulate - 4 freq accumulated - 1 freq acknowledgment - 1 freq acknowledge - 22 freq assimilation - 2 freq acknowledgements - 2 freq acknowledges - 4 freq aznly - 1 freq assimilate - 1 freq acknawlege - 1 freq auchinyell - 1 freq acknowledgin' - 1 freq accumulation - 1 freq acknaulege - 1 freq assemlie - 7 freq acknawledges - 1 freq acknawledgement - 3 freq acknawledged - 4 freq assimilated - 2 freq acknowledging - 2 freq acknawledgit - 1 freq assimilatit - 1 freq accumulatin - 1 freq acknowledgments - 1 freq assemmly - 1 freq accumulati't - 1 freq aqaml - 1 freq akamlx - 1 freq ashmill - 3 freq auchinlecks - 1 freq |
MetaPhone code - AXML auchmill - 3 freq ashmill - 3 freq |
ASHMILL |
| Time to execute Levenshtein function - 0.332544 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.518980 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.061420 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.040177 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.000739 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. |