| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| achieve (0) - 35 freq achieved (1) - 14 freq achieves (1) - 1 freq ahi've (2) - 1 freq thieve (2) - 3 freq schiele (2) - 1 freq active (2) - 33 freq achievin (2) - 3 freq acrieved (2) - 1 freq achievers (2) - 1 freq acteeve (2) - 1 freq archive (2) - 26 freq chive (2) - 1 freq scrieve (2) - 167 freq chiel (3) - 455 freq ahied (3) - 1 freq achievable (3) - 4 freq aching (3) - 4 freq chielie (3) - 1 freq scheme (3) - 84 freq chide (3) - 4 freq grieve (3) - 53 freq accies (3) - 2 freq acheen (3) - 1 freq ahve (3) - 29 freq |
achieve (0) - 35 freq chive (2) - 1 freq achieves (2) - 1 freq achieved (2) - 14 freq archive (3) - 26 freq chyave (3) - 2 freq chauve (3) - 7 freq acteeve (3) - 1 freq chaave (3) - 3 freq chave (3) - 3 freq active (3) - 33 freq thieve (3) - 3 freq achievin (3) - 3 freq cheese (4) - 140 freq chaav (4) - 1 freq chine (4) - 2 freq aches (4) - 10 freq theve (4) - 1 freq chivvy (4) - 1 freq acher (4) - 1 freq a'hve (4) - 1 freq cairve (4) - 1 freq chise (4) - 2 freq ached (4) - 4 freq achim (4) - 2 freq |
SoundEx code - A210 agape - 2 freq aesop - 8 freq achieve - 35 freq aseef - 1 freq accep - 12 freq asbo - 1 freq agivey - 2 freq asap - 10 freq accepp - 3 freq ashby - 1 freq ausbau - 1 freq acuv - 1 freq aygxb - 1 freq agv - 1 freq agjjp - 1 freq aqp - 1 freq askjeff - 1 freq agp - 1 freq azv - 1 freq ayqv - 1 freq auxzv - 1 freq |
MetaPhone code - AXF achieve - 35 freq |
ACHIEVE |
| Time to execute Levenshtein function - 0.262435 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.366583 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.027803 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.040070 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.000992 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. |