| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| achieve (0) - 35 freq achieved (1) - 14 freq achieves (1) - 1 freq acrieved (2) - 1 freq chive (2) - 1 freq acteeve (2) - 1 freq scrieve (2) - 168 freq active (2) - 33 freq archive (2) - 26 freq schiele (2) - 1 freq achievin (2) - 3 freq achievers (2) - 1 freq thieve (2) - 3 freq ahi've (2) - 1 freq chieh (3) - 2 freq screeve (3) - 1 freq scriever (3) - 60 freq alchies (3) - 1 freq chiste (3) - 1 freq argive (3) - 1 freq chiels (3) - 112 freq scheme (3) - 84 freq cheege (3) - 1 freq ochie (3) - 8 freq chiefie (3) - 5 freq |
achieve (0) - 35 freq achieved (2) - 14 freq chive (2) - 1 freq achieves (2) - 1 freq chyave (3) - 2 freq thieve (3) - 3 freq chave (3) - 3 freq achievin (3) - 3 freq chauve (3) - 7 freq acteeve (3) - 1 freq active (3) - 33 freq chaave (3) - 3 freq archive (3) - 26 freq chielie (4) - 1 freq heeve (4) - 1 freq chinee (4) - 1 freq chiver (4) - 1 freq aches (4) - 10 freq achin (4) - 14 freq chime (4) - 6 freq cairve (4) - 1 freq ached (4) - 4 freq escheve (4) - 1 freq chaav (4) - 1 freq ahve (4) - 8 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.391306 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.579217 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.037084 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.073000 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.000863 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. |