| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| akamlx (0) - 1 freq aqaml (2) - 1 freq a'all (3) - 1 freq skames (3) - 2 freq aald (3) - 202 freq azacly (3) - 11 freq kamed (3) - 1 freq skaill (3) - 2 freq aalt (3) - 2 freq aale (3) - 1 freq akram (3) - 1 freq akvx (3) - 1 freq awmox (3) - 1 freq adam (3) - 189 freq aamos (3) - 5 freq alamo (3) - 2 freq skald (3) - 57 freq kael (3) - 5 freq skael (3) - 1 freq anal (3) - 1 freq aal (3) - 755 freq aail (3) - 1 freq kame (3) - 6 freq famly (3) - 5 freq amly (3) - 1 freq |
akamlx (0) - 1 freq okzlx (4) - 1 freq kamil (4) - 1 freq kamile (4) - 37 freq kallax (4) - 1 freq ukclx (4) - 1 freq aqaml (4) - 1 freq amly (5) - 1 freq famly (5) - 5 freq kame (5) - 6 freq kali (5) - 1 freq kamed (5) - 1 freq kames (5) - 7 freq karla (5) - 1 freq akimbo (5) - 1 freq akwally (5) - 1 freq klux (5) - 1 freq kam (5) - 24 freq kael (5) - 5 freq awmox (5) - 1 freq kale (5) - 26 freq ykal (5) - 1 freq kail (5) - 42 freq kaald (5) - 4 freq akvx (5) - 1 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 - AKMLKS akamlx - 1 freq |
AKAMLX |
| Time to execute Levenshtein function - 0.230506 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.372921 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.028453 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.038696 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.000904 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. |