| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| telegram (0) - 7 freq telegrams (1) - 2 freq telegraph (2) - 8 freq epigram (3) - 2 freq temerat (3) - 1 freq telegraph- (3) - 1 freq teeeeeam (3) - 1 freq teegar (3) - 4 freq hologram (3) - 1 freq telegraphs (3) - 1 freq teenas (4) - 1 freq several (4) - 45 freq neteral (4) - 1 freq celebrate (4) - 86 freq tram (4) - 16 freq seperat (4) - 1 freq tellem (4) - 1 freq teresa (4) - 3 freq elegy (4) - 6 freq televise (4) - 1 freq letham (4) - 6 freq leebrar (4) - 1 freq tellan (4) - 13 freq teename (4) - 1 freq telfer (4) - 2 freq |
telegram (0) - 7 freq telegrams (2) - 2 freq hologram (4) - 1 freq telegraph (4) - 8 freq pilgrim (5) - 14 freq teegar (5) - 4 freq epigram (5) - 2 freq taelem (6) - 1 freq teleport (6) - 1 freq theorem (6) - 1 freq moneygram (6) - 1 freq meldrum (6) - 30 freq gram (6) - 10 freq tyler (6) - 15 freq diagram (6) - 3 freq tellures (6) - 1 freq tellers (6) - 5 freq belgium (6) - 10 freq teeger (6) - 187 freq tellaris (6) - 1 freq flegsum (6) - 1 freq telt'm (6) - 2 freq fleggym (6) - 2 freq teegers (6) - 36 freq megrim (6) - 4 freq |
SoundEx code - T426 telegraph - 8 freq tallowquairn - 1 freq talker - 3 freq telegrams - 2 freq telegram - 7 freq tollcross - 5 freq telegraph- - 1 freq telegraphs - 1 freq tollcroass - 1 freq talkers - 1 freq thealiceroberts - 2 freq talkradio - 3 freq telegraphworld - 1 freq tollcrossth - 21 freq |
MetaPhone code - TLKRM telegram - 7 freq |
TELEGRAM |
| Time to execute Levenshtein function - 0.228854 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.363346 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.027488 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.038749 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.000839 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. |