| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auchmill (0) - 3 freq ashmill (2) - 3 freq bauchilt (3) - 2 freq uphill (3) - 3 freq auldhill (3) - 26 freq pauchilt (3) - 1 freq chill (3) - 45 freq auchtie (3) - 3 freq quheill (3) - 1 freq rauchil (3) - 2 freq lauchfull (3) - 2 freq wauchil (3) - 1 freq gunhill (3) - 2 freq pauchtily (3) - 1 freq ahill (3) - 1 freq schuill (3) - 3 freq muthill (3) - 1 freq 'chill (3) - 2 freq bushmills (3) - 3 freq quhill (3) - 1 freq bauchil (3) - 3 freq bowhill (4) - 5 freq ah'il (4) - 24 freq pauchtie (4) - 4 freq alsweill (4) - 1 freq |
auchmill (0) - 3 freq ashmill (3) - 3 freq chill (4) - 45 freq schuill (5) - 3 freq craamill (5) - 1 freq camillo (5) - 1 freq ahill (5) - 1 freq chilly (5) - 12 freq cawmill (5) - 2 freq quhill (5) - 1 freq camilla (5) - 2 freq 'chill (5) - 2 freq lauchfull (5) - 2 freq auchinyell (5) - 1 freq quheill (5) - 1 freq uphill (5) - 3 freq camille (5) - 1 freq chilli (5) - 12 freq unhailly (6) - 1 freq chesell (6) - 1 freq shill (6) - 4 freq newmill (6) - 1 freq schull (6) - 1 freq murmell (6) - 2 freq jhill (6) - 19 freq |
SoundEx code - A254 acknowledged - 13 freq acknawledge - 3 freq acknowledgement - 13 freq auchmill - 3 freq acknowledgin - 4 freq auchinleck - 13 freq acumulaitet - 1 freq accumulated - 2 freq accumulate - 4 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 |
AUCHMILL |
| Time to execute Levenshtein function - 0.284533 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.403792 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.027682 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.039764 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.000848 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. |