| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| altitude (0) - 6 freq attitude (1) - 51 freq latitude (2) - 10 freq aptitudes (2) - 1 freq multitude (2) - 2 freq lattitude (2) - 1 freq attitudes (2) - 31 freq multitudes (3) - 1 freq lassitude (3) - 1 freq fortitude (3) - 3 freq platitudes (3) - 1 freq plenitude (3) - 4 freq latitudes (3) - 1 freq magnitude (3) - 4 freq antique (3) - 9 freq gratitude (3) - 16 freq plentitude (3) - 1 freq latietude (3) - 2 freq rectitude (3) - 1 freq solitude (3) - 9 freq attititude (3) - 1 freq langitude (3) - 2 freq allude (3) - 1 freq flite (4) - 2 freq elite (4) - 22 freq |
altitude (0) - 6 freq latitude (2) - 10 freq attitude (2) - 51 freq lattitude (3) - 1 freq multitude (3) - 2 freq latietude (3) - 2 freq latitudes (4) - 1 freq attitudes (4) - 31 freq aptitudes (4) - 1 freq alerted (5) - 2 freq attititude (5) - 1 freq solitude (5) - 9 freq allude (5) - 1 freq altered (5) - 17 freq rectitude (5) - 1 freq littie (5) - 1 freq little (5) - 421 freq lettuce (5) - 19 freq langitude (5) - 2 freq fortitude (5) - 3 freq platitudes (5) - 1 freq plentitude (5) - 1 freq plenitude (5) - 4 freq lassitude (5) - 1 freq gratitude (5) - 16 freq |
SoundEx code - A433 allotted - 1 freq auld-deid - 1 freq alludit - 2 freq allotit - 1 freq altitude - 6 freq ae-leidit - 1 freq altheadreamsof - 4 freq aolthd - 1 freq |
MetaPhone code - ALTTT auld-deid - 1 freq altitude - 6 freq |
ALTITUDE |
| Time to execute Levenshtein function - 0.194183 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.394853 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.029489 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.038709 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.000874 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. |