| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ashley (0) - 9 freq cashley (1) - 2 freq ashes (2) - 20 freq ashen (2) - 2 freq isley (2) - 1 freq mashles (2) - 1 freq ashe (2) - 1 freq ashlar (2) - 1 freq soley (2) - 2 freq agley (2) - 44 freq arseley (2) - 1 freq ashby (2) - 1 freq ackley (2) - 1 freq ashet (2) - 25 freq alley (2) - 4 freq apashley (2) - 4 freq gashle (2) - 1 freq asher (2) - 1 freq shae (3) - 853 freq harshly (3) - 5 freq ankles (3) - 24 freq sheep (3) - 295 freq aubrey (3) - 4 freq waahey (3) - 1 freq shoes (3) - 132 freq |
ashley (0) - 9 freq cashley (2) - 2 freq gashle (3) - 1 freq shyly (3) - 8 freq ashet (3) - 25 freq asher (3) - 1 freq ashby (3) - 1 freq shiel (3) - 2 freq sheel (3) - 3 freq yaishly (3) - 1 freq shale (3) - 5 freq apashley (3) - 4 freq ashen (3) - 2 freq ashe (3) - 1 freq isley (3) - 1 freq ashlar (3) - 1 freq soley (3) - 2 freq ayshely (3) - 1 freq shael (3) - 8 freq ashes (3) - 20 freq slay (4) - 5 freq holey (4) - 4 freq easely (4) - 1 freq ushed (4) - 1 freq hle (4) - 1 freq |
SoundEx code - A240 agley - 44 freq asweel - 18 freq akwally - 1 freq aswell - 6 freq aisle - 26 freq acyully - 1 freq age-owl - 2 freq aisily - 1 freq agal - 1 freq aglee - 1 freq azly - 1 freq ahoghill - 5 freq assail - 7 freq aigle - 4 freq aqual - 3 freq asweill - 2 freq aesily - 2 freq aglow - 1 freq axle - 1 freq asshole - 2 freq ackwally - 1 freq acshully - 3 freq acshull - 1 freq aizle - 1 freq acwally - 4 freq asail - 1 freq aglay - 1 freq aggie'll - 1 freq ackwal - 3 freq ackwallie - 2 freq akuallie - 1 freq ackwall - 1 freq acual - 1 freq akwallie - 2 freq asl - 1 freq ashley - 9 freq agile - 2 freq axil - 1 freq azalea - 2 freq aggle - 2 freq akchilee - 1 freq akaollie - 7 freq azl - 1 freq ackley - 1 freq acshul - 1 freq ayqal - 1 freq ajzhulh - 1 freq ayshely - 1 freq |
MetaPhone code - AXL ashley - 9 freq ayshely - 1 freq |
ASHLEY |
| Time to execute Levenshtein function - 0.183571 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.350212 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.027354 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.036506 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.000856 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. |