| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| achievin (0) - 3 freq achieving (1) - 1 freq thievin (2) - 16 freq achillin (2) - 1 freq scrievin (2) - 163 freq achieve (2) - 35 freq achieves (2) - 1 freq achieved (2) - 14 freq chinnin (3) - 1 freq aleevin (3) - 1 freq chawvin (3) - 1 freq argiein (3) - 5 freq achievers (3) - 1 freq athinkin (3) - 1 freq chidin (3) - 1 freq scrievein (3) - 2 freq chavvin (3) - 1 freq scrievan (3) - 1 freq alivin (3) - 1 freq chewin (3) - 16 freq sievin (3) - 1 freq chingin (3) - 3 freq achteen (3) - 2 freq scrievin' (3) - 1 freq stievin (3) - 1 freq |
achievin (0) - 3 freq achieving (2) - 1 freq chauvin (3) - 4 freq chyavin (3) - 1 freq achieved (3) - 14 freq chaavin (3) - 2 freq chavin (3) - 4 freq achieves (3) - 1 freq achieve (3) - 35 freq thievin (3) - 16 freq achin (4) - 14 freq hevin (4) - 20 freq auchleven (4) - 1 freq achteen (4) - 2 freq achten (4) - 1 freq haevin (4) - 2 freq chaetin (4) - 1 freq scrievin (4) - 163 freq hivin (4) - 27 freq theevin (4) - 1 freq chewin (4) - 16 freq cairvin (4) - 5 freq chawvin (4) - 1 freq cheepin (4) - 6 freq acheen (4) - 1 freq |
SoundEx code - A215 achievement - 21 freq aspen - 10 freq achievements - 7 freq acheivement - 1 freq accepin - 1 freq a'ghobhainn - 1 freq achievin - 3 freq aik-panelled - 1 freq acceppin - 3 freq acupuncture - 1 freq azpnofbgol - 1 freq achieving - 1 freq |
MetaPhone code - AXFN achievin - 3 freq |
ACHIEVIN |
| Time to execute Levenshtein function - 0.213515 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.369183 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.028898 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.038695 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.000969 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. |