| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| achievable (0) - 4 freq achieve (3) - 34 freq believable (3) - 3 freq amiable (4) - 1 freq activate (4) - 2 freq agreeable (4) - 3 freq answerable (4) - 2 freq achedule (4) - 1 freq ashvale (4) - 3 freq abailable (4) - 1 freq schiele (4) - 1 freq achieving (4) - 1 freq achieves (4) - 1 freq achieved (4) - 14 freq amicable (4) - 2 freq avaelable (4) - 2 freq available (4) - 126 freq achievin (4) - 3 freq achievers (4) - 1 freq advisable (4) - 4 freq fashionable (4) - 8 freq acceptable (4) - 24 freq preferable (5) - 2 freq whitdale (5) - 2 freq accessible (5) - 15 freq |
achievable (0) - 4 freq believable (5) - 3 freq achieve (5) - 34 freq chimbley (6) - 1 freq achieves (6) - 1 freq achievin (6) - 3 freq auchinblae (6) - 1 freq achieving (6) - 1 freq achievers (6) - 1 freq achieved (6) - 14 freq achedule (6) - 1 freq ashvale (6) - 3 freq chargeable (7) - 1 freq cheaply (7) - 2 freq chorale (7) - 1 freq thimble (7) - 13 freq chevalrie (7) - 1 freq credible (7) - 3 freq chiel (7) - 451 freq thirablo (7) - 1 freq capable (7) - 25 freq chielie (7) - 1 freq acsesibl (7) - 1 freq conceivable (7) - 4 freq actively (7) - 14 freq |
SoundEx code - A211 akpap - 2 freq achievable - 4 freq azkbwfgabm - 1 freq aiqvufi - 1 freq |
MetaPhone code - AXFBL achievable - 4 freq |
ACHIEVABLE |
| Time to execute Levenshtein function - 0.190417 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.337900 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.027039 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.036636 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.000794 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. |