| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| attitudes (0) - 31 freq attitude (1) - 51 freq aptitudes (1) - 1 freq lattitude (2) - 1 freq altitude (2) - 6 freq latitudes (2) - 1 freq platitudes (3) - 1 freq attititude (3) - 1 freq latitude (3) - 10 freq magnitudes (3) - 1 freq antipodes (3) - 2 freq antiques (3) - 5 freq attributes (3) - 5 freq multitudes (3) - 1 freq strictures (4) - 3 freq ambituons (4) - 1 freq multitude (4) - 2 freq artistes (4) - 2 freq tides (4) - 22 freq antique (4) - 9 freq entities (4) - 15 freq lassitude (4) - 1 freq untiques (4) - 3 freq titties (4) - 1 freq aatimes (4) - 1 freq |
attitudes (0) - 31 freq aptitudes (2) - 1 freq attitude (2) - 51 freq latitudes (3) - 1 freq altitude (4) - 6 freq lattitude (4) - 1 freq attends (5) - 1 freq attendees (5) - 1 freq titties (5) - 1 freq tatties (5) - 193 freq multitudes (5) - 1 freq platitudes (5) - 1 freq latitude (5) - 10 freq antipodes (5) - 2 freq attititude (5) - 1 freq totties (6) - 8 freq statutes (6) - 2 freq titters (6) - 1 freq ratties (6) - 2 freq statues (6) - 7 freq textures (6) - 2 freq attaches (6) - 1 freq 'titus (6) - 1 freq fatties (6) - 1 freq catties (6) - 3 freq |
SoundEx code - A333 attitudes - 31 freq attitude - 51 freq attitudinal - 1 freq attititude - 1 freq atotheod - 2 freq |
MetaPhone code - ATTTS attitudes - 31 freq |
ATTITUDES |
| Time to execute Levenshtein function - 0.222672 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.397444 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.028825 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.039154 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.004320 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. |