| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| latinate (0) - 21 freq laminate (1) - 2 freq latinity (2) - 2 freq laminated (2) - 5 freq luminate (2) - 1 freq lastminute (3) - 2 freq estimate (3) - 4 freq bathgate (3) - 4 freq marinade (3) - 3 freq rationale (3) - 11 freq laminatit (3) - 1 freq tinkte (3) - 1 freq dominate (3) - 4 freq lamante (3) - 1 freq facinates (3) - 1 freq patina (3) - 1 freq eliminate (3) - 2 freq alienate (3) - 1 freq castigate (3) - 1 freq intimate (3) - 10 freq ruminate (3) - 1 freq matinee (3) - 4 freq activate (3) - 2 freq mitigate (3) - 1 freq gatinnae (3) - 1 freq |
latinate (0) - 21 freq latinity (2) - 2 freq laminate (2) - 2 freq luminate (3) - 1 freq eliminate (4) - 2 freq ultimate (4) - 11 freq alienate (4) - 1 freq laminit (4) - 1 freq literate (4) - 9 freq latte (4) - 5 freq lamante (4) - 1 freq latin (4) - 92 freq laminated (4) - 5 freq blatant (5) - 11 freq lairnt (5) - 54 freq tinto (5) - 3 freq ladent (5) - 1 freq stint (5) - 11 freq lament (5) - 22 freq leiterate (5) - 1 freq lamont (5) - 8 freq litigant (5) - 1 freq laitin (5) - 19 freq lannot (5) - 4 freq patient (5) - 60 freq |
SoundEx code - L353 ladent - 1 freq lood-mooth - 1 freq leitmotif - 1 freq lowdent - 1 freq latinate - 21 freq latinity - 2 freq latin-derived - 1 freq lethenty - 1 freq laudando - 1 freq |
MetaPhone code - LTNT ladent - 1 freq lowdent - 1 freq latinate - 21 freq latinity - 2 freq laudando - 1 freq |
LATINATE |
| Time to execute Levenshtein function - 0.372471 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.394584 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.030230 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.037659 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.000938 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. |