Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
attitude (0) - 50 freq attitudes (1) - 31 freq lattitude (1) - 1 freq altitude (1) - 6 freq attititude (2) - 1 freq aptitudes (2) - 1 freq latitude (2) - 10 freq latitudes (3) - 1 freq magnitude (3) - 3 freq solitude (3) - 9 freq lassitude (3) - 1 freq latietude (3) - 2 freq langitude (3) - 2 freq gratitude (3) - 13 freq multitude (3) - 2 freq fortitude (3) - 3 freq attire (3) - 12 freq rectitude (3) - 1 freq attie (3) - 3 freq antique (3) - 9 freq ettie (4) - 4 freq attuned (4) - 2 freq armitage (4) - 4 freq mattit (4) - 3 freq texture (4) - 9 freq |
attitude (0) - 50 freq altitude (2) - 6 freq lattitude (2) - 1 freq attitudes (2) - 31 freq latitude (3) - 10 freq attititude (3) - 1 freq latietude (4) - 2 freq aptitudes (4) - 1 freq attained (5) - 1 freq attuned (5) - 2 freq tittie (5) - 30 freq tattibye (5) - 1 freq tattie (5) - 157 freq stoited (5) - 2 freq tutted (5) - 3 freq attie (5) - 3 freq attested (5) - 4 freq attend (5) - 36 freq attire (5) - 12 freq rectitude (5) - 1 freq solitude (5) - 9 freq latitudes (5) - 1 freq gratitude (5) - 13 freq tattooed (5) - 10 freq etttle (5) - 1 freq |
SoundEx code - A333 attitudes - 31 freq attitude - 50 freq attitudinal - 1 freq attititude - 1 freq atotheod - 2 freq |
MetaPhone code - ATTT attitude - 50 freq |
ATTITUDE |
Time to execute Levenshtein function - 0.192546 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.382608 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.027814 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.038057 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.001050 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. |