| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| latitude (0) - 10 freq latietude (1) - 2 freq lattitude (1) - 1 freq latitudes (1) - 1 freq platitudes (2) - 1 freq lassitude (2) - 1 freq attitude (2) - 51 freq altitude (2) - 6 freq gratitude (2) - 16 freq langitude (2) - 2 freq laude (3) - 1 freq longitude (3) - 11 freq solitude (3) - 9 freq attitudes (3) - 31 freq magnitude (3) - 4 freq rectitude (3) - 1 freq latinate (3) - 21 freq multitude (3) - 2 freq aptitudes (3) - 1 freq fortitude (3) - 3 freq plentitude (3) - 1 freq plenitude (3) - 4 freq fatigue (3) - 6 freq lettuce (3) - 19 freq latte (3) - 5 freq |
latitude (0) - 10 freq latietude (1) - 2 freq altitude (2) - 6 freq latitudes (2) - 1 freq lattitude (2) - 1 freq attitude (3) - 51 freq latte (4) - 5 freq multitude (4) - 2 freq lettuce (4) - 19 freq langitude (4) - 2 freq gratitude (4) - 16 freq lassitude (4) - 1 freq platitudes (4) - 1 freq latten (5) - 11 freq lottie (5) - 2 freq patted (5) - 15 freq latter (5) - 25 freq batted (5) - 1 freq little (5) - 421 freq laithed (5) - 2 freq latehd (5) - 1 freq slatted (5) - 1 freq lattin (5) - 53 freq limited (5) - 20 freq laisted (5) - 3 freq |
SoundEx code - L333 latitude - 10 freq latitudes - 1 freq latietude - 2 freq lattitude - 1 freq ladydetectives - 1 freq |
MetaPhone code - LTTT latitude - 10 freq latietude - 2 freq lattitude - 1 freq |
LATITUDE |
| Time to execute Levenshtein function - 0.174070 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.332324 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.027519 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.046621 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.001311 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. |