| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| telegraph- (0) - 1 freq telegraphs (1) - 1 freq telegraph (1) - 8 freq telegram (3) - 7 freq telegrams (3) - 2 freq geography (4) - 37 freq seaography (4) - 6 freq polygraph (4) - 1 freq geograph (4) - 2 freq telepathy (4) - 1 freq topography (4) - 2 freq demography (4) - 4 freq telegraphworld (5) - 1 freq belgrade (5) - 1 freq monograph (5) - 1 freq celebrant (5) - 30 freq delegated (5) - 2 freq teegar (5) - 4 freq temerat (5) - 1 freq monographs (5) - 2 freq toleratit (5) - 1 freq elegant (5) - 12 freq delegates (5) - 3 freq celebrated (5) - 9 freq delegatin (5) - 1 freq |
telegraph- (0) - 1 freq telegraph (2) - 8 freq telegraphs (2) - 1 freq polygraph (6) - 1 freq telegrams (6) - 2 freq telegram (6) - 7 freq topography (6) - 2 freq demography (7) - 4 freq holographic (7) - 1 freq autographs (7) - 2 freq autograph (7) - 1 freq geography (7) - 37 freq geograph (7) - 2 freq seaography (7) - 6 freq 'geography (8) - 1 freq geographie (8) - 2 freq paragraph (8) - 19 freq geographer (8) - 23 freq digraphs (8) - 4 freq i-digraph (8) - 1 freq biography (8) - 7 freq autographed (8) - 2 freq paragraphs (8) - 6 freq demographic (8) - 3 freq digraph (8) - 3 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 - TLKRF telegraph - 8 freq telegraph- - 1 freq |
TELEGRAPH- |
| Time to execute Levenshtein function - 0.226408 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.405759 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.029480 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.041010 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.000803 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. |