| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tideline (0) - 1 freq timeline (1) - 14 freq tim'line (2) - 1 freq adeline (2) - 2 freq pipeline (2) - 3 freq sidelines (2) - 2 freq sidelined (2) - 1 freq sidelins (2) - 4 freq tidgie (3) - 1 freq andreline (3) - 1 freq hiddlins (3) - 1 freq feline (3) - 16 freq delite (3) - 4 freq mid-life (3) - 1 freq middlins (3) - 2 freq middling (3) - 2 freq fiddlin (3) - 5 freq pipelines (3) - 1 freq decline (3) - 20 freq treelined (3) - 1 freq tidins (3) - 8 freq baseline (3) - 2 freq guidelines (3) - 26 freq underline (3) - 2 freq kinelie (3) - 1 freq |
tideline (0) - 1 freq timeline (2) - 14 freq adeline (3) - 2 freq kodaline (4) - 1 freq tillin (4) - 3 freq heidline (4) - 13 freq tirlin (4) - 13 freq tidyin (4) - 6 freq ladelin (4) - 1 freq tweelin (4) - 2 freq deidline (4) - 1 freq toddlin (4) - 2 freq tinlin (4) - 1 freq tagline (4) - 2 freq hidlin (4) - 1 freq sidlin (4) - 1 freq sidelines (4) - 2 freq sidelins (4) - 4 freq pipeline (4) - 3 freq sidelined (4) - 1 freq tim'line (4) - 1 freq dealin (5) - 30 freq tiding (5) - 1 freq hiddlin (5) - 4 freq widbine (5) - 1 freq |
SoundEx code - T345 toddlin - 2 freq twiddlin - 2 freq tiddle-um-tum - 2 freq tweetlin - 2 freq tittlin - 1 freq tideline - 1 freq tidelinesfest - 2 freq |
MetaPhone code - TTLN dawdlin - 2 freq toddlin - 2 freq diddlin - 2 freq tittlin - 1 freq doodlin - 2 freq tideline - 1 freq deidline - 1 freq deadline - 4 freq dodeallen - 6 freq |
TIDELINE |
| Time to execute Levenshtein function - 0.224003 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.455139 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.036302 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.045856 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.000885 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. |