Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
teleseope (0) - 1 freq telescope (1) - 20 freq teleskop (2) - 1 freq telescop (2) - 3 freq telescops (2) - 1 freq telescopes (2) - 6 freq telephone (3) - 16 freq teletype (3) - 1 freq telephoto (4) - 1 freq milestone (4) - 2 freq halesome (4) - 9 freq tedisome (4) - 1 freq teepee (4) - 5 freq tolerence (4) - 1 freq eesee (4) - 3 freq telephones (4) - 1 freq teletext (4) - 1 freq telephoned (4) - 1 freq leesome (4) - 9 freq teevee (4) - 1 freq teleport (4) - 1 freq eesome (4) - 2 freq teeside (4) - 1 freq televeezed (4) - 1 freq celeste (4) - 3 freq |
teleseope (0) - 1 freq telescope (2) - 20 freq telescop (3) - 3 freq teleskop (3) - 1 freq teletype (4) - 1 freq telescops (4) - 1 freq telescopes (4) - 6 freq clesp (6) - 4 freq dulesome (6) - 18 freq treesome (6) - 1 freq celeste (6) - 3 freq televise (6) - 1 freq tiresome (6) - 6 freq toilsome (6) - 1 freq tels (6) - 4 freq tles (6) - 1 freq tiles (6) - 16 freq tyles (6) - 1 freq telebox (6) - 2 freq teeside (6) - 1 freq tales (6) - 149 freq teepee (6) - 5 freq halesome (6) - 9 freq leesome (6) - 9 freq tedisome (6) - 1 freq |
SoundEx code - T421 telescope - 20 freq telescopes - 6 freq teleseope - 1 freq telescop - 3 freq telescops - 1 freq teleskop - 1 freq tailspin - 1 freq tilkfdbtrg - 1 freq thelawisbroken - 1 freq talesofonecity - 3 freq tljqvhfc - 1 freq talesofbeyond - 1 freq |
MetaPhone code - TLSP teleseope - 1 freq |
TELESEOPE |
Time to execute Levenshtein function - 0.332496 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.576888 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.028480 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.069528 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.000894 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. |