Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
achieved (0) - 14 freq achieve (1) - 34 freq acrieved (1) - 1 freq achieves (1) - 1 freq thieved (2) - 1 freq achievin (2) - 3 freq achievers (2) - 1 freq scrieved (2) - 46 freq adhered (3) - 2 freq chield (3) - 15 freq archives (3) - 8 freq believed (3) - 48 freq chaved (3) - 1 freq chewed (3) - 6 freq haeved (3) - 2 freq cheered (3) - 27 freq hivved (3) - 1 freq ahi've (3) - 1 freq scrived (3) - 2 freq aggrieved (3) - 4 freq scrieven (3) - 2 freq acheen (3) - 1 freq chinned (3) - 1 freq ascrived (3) - 1 freq grieved (3) - 3 freq |
achieved (0) - 14 freq achieves (2) - 1 freq acrieved (2) - 1 freq achieve (2) - 34 freq chaaved (3) - 3 freq chaved (3) - 1 freq thieved (3) - 1 freq achievin (3) - 3 freq chimed (4) - 8 freq chiver (4) - 1 freq cairved (4) - 15 freq ached (4) - 4 freq cheered (4) - 27 freq escheved (4) - 1 freq shived (4) - 1 freq chewed (4) - 6 freq chided (4) - 3 freq haeved (4) - 2 freq chive (4) - 1 freq scrieved (4) - 46 freq achievers (4) - 1 freq chield (4) - 15 freq childe (5) - 1 freq shaved (5) - 15 freq chaaed (5) - 6 freq |
SoundEx code - A213 accept - 74 freq acceptance - 30 freq accepts - 5 freq acceptin - 16 freq accepted - 23 freq acceptable - 24 freq accepit - 2 freq acceptit - 46 freq acceptabilty - 1 freq accepting - 3 freq achieved - 14 freq aspidistra - 1 freq asphodel - 1 freq accepte - 1 freq acceppit - 12 freq acceptilautioun - 1 freq aquavit - 1 freq acceptability - 1 freq acceptid - 1 freq acceptsna - 1 freq ajfter - 1 freq assipattle - 5 freq assipattle's - 1 freq aspd - 1 freq agiftaday - 4 freq aqua-fit - 1 freq aqbudsuu - 1 freq |
MetaPhone code - AXFT achieved - 14 freq |
ACHIEVED |
Time to execute Levenshtein function - 0.214019 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.364676 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.028075 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.042862 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.001078 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. |