| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| timeline (0) - 14 freq tim'line (1) - 1 freq tideline (1) - 1 freq pipeline (2) - 3 freq time-in (2) - 1 freq samelike (3) - 2 freq somelike (3) - 2 freq adeline (3) - 2 freq timing (3) - 1 freq tingling (3) - 1 freq eimagine (3) - 2 freq comelie (3) - 2 freq tummelin (3) - 1 freq sidelins (3) - 4 freq namelie (3) - 3 freq himlane (3) - 1 freq sidelined (3) - 1 freq tagline (3) - 2 freq timeless (3) - 5 freq tummlin (3) - 25 freq tumlin (3) - 1 freq 'imagine (3) - 1 freq tumbling (3) - 1 freq simplie (3) - 1 freq timmle (3) - 4 freq |
timeline (0) - 14 freq tideline (2) - 1 freq tim'line (2) - 1 freq time-in (3) - 1 freq tumlin (3) - 1 freq tummlin (4) - 25 freq himlane (4) - 1 freq tagline (4) - 2 freq timin (4) - 6 freq timaagine (4) - 1 freq timeen (4) - 1 freq timely (4) - 4 freq tinlin (4) - 1 freq tweelin (4) - 2 freq tumblin (4) - 4 freq tirlin (4) - 13 freq trimlin (4) - 1 freq tillin (4) - 3 freq tummelin (4) - 1 freq pipeline (4) - 3 freq tomsin (5) - 2 freq toilin (5) - 2 freq semolinie (5) - 1 freq melanie (5) - 1 freq malone (5) - 4 freq |
SoundEx code - T545 tummlin - 25 freq toonlan - 2 freq toonland - 1 freq toonlan' - 1 freq toonlanns - 1 freq timeline - 14 freq tummlan - 1 freq tim'line - 1 freq tomlinson - 1 freq tummelin - 1 freq tumlin - 1 freq tinlin - 1 freq tmlewin - 1 freq teamleon - 1 freq tomlang - 3 freq tomholland - 1 freq |
MetaPhone code - TMLN tumblin - 4 freq tummlin - 25 freq timeline - 14 freq tummlan - 1 freq tim'line - 1 freq tummelin - 1 freq tumblan - 2 freq tumlin - 1 freq teamleon - 1 freq |
TIMELINE |
| Time to execute Levenshtein function - 0.247094 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.428236 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.036267 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.040782 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.001037 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. |