Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aaftly (0) - 1 freq saftly (1) - 64 freq aafal (2) - 22 freq aaful (2) - 2 freq safely (2) - 41 freq vastly (2) - 2 freq laytly (2) - 1 freq factly (2) - 1 freq aafil (2) - 199 freq saftey (2) - 1 freq dafty (2) - 29 freq aptly (2) - 4 freq lastly (2) - 5 freq aafilly (2) - 1 freq soaftly (2) - 1 freq deftly (2) - 1 freq faitly (2) - 2 freq laetly (2) - 2 freq softly (2) - 12 freq sactly (2) - 1 freq partly (2) - 10 freq aatum (3) - 1 freq daithly (3) - 3 freq daftie (3) - 23 freq patsy (3) - 8 freq |
aaftly (0) - 1 freq faitly (2) - 2 freq saftly (2) - 64 freq deftly (3) - 1 freq soaftly (3) - 1 freq aafilly (3) - 1 freq softly (3) - 12 freq fitly (3) - 1 freq ftl (3) - 2 freq aptly (3) - 4 freq laetly (3) - 2 freq aafal (3) - 22 freq aaful (3) - 2 freq laytly (3) - 1 freq factly (3) - 1 freq aafil (3) - 199 freq matlo (4) - 1 freq neatly (4) - 26 freq afil (4) - 1 freq afyl (4) - 1 freq fainly (4) - 2 freq aefter (4) - 4 freq watl (4) - 1 freq oaft (4) - 5 freq aiftir (4) - 1 freq |
SoundEx code - A134 aftwhiles - 3 freq aptly - 4 freq aaftly - 1 freq aabody'll - 3 freq aff-the-luif - 2 freq abdul - 7 freq |
MetaPhone code - AFTL aaftly - 1 freq |
AAFTLY |
Time to execute Levenshtein function - 0.302831 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.534985 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.038665 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.046673 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.000799 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. |