Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
autograph (0) - 1 freq autographs (1) - 2 freq autographed (2) - 2 freq lithograph (3) - 1 freq autocrat (3) - 4 freq monograph (3) - 1 freq geograph (3) - 2 freq photograph (3) - 21 freq hagiography (4) - 1 freq monographs (4) - 2 freq seaography (4) - 6 freq aurora (4) - 10 freq graph (4) - 4 freq autobiography (4) - 2 freq autobahn (4) - 2 freq telegraph (4) - 8 freq polygraph (4) - 1 freq demography (4) - 4 freq paragraph (4) - 19 freq digraph (4) - 3 freq photographs (4) - 6 freq orthography (4) - 50 freq biography (4) - 7 freq geography (4) - 37 freq autoricht (4) - 1 freq |
autograph (0) - 1 freq autographs (2) - 2 freq autographed (3) - 2 freq geograph (4) - 2 freq telegraph (5) - 8 freq autobiography (5) - 2 freq topography (5) - 2 freq geography (5) - 37 freq biography (5) - 7 freq digraph (5) - 3 freq graph (5) - 4 freq seaography (5) - 6 freq monograph (5) - 1 freq lithograph (5) - 1 freq photograph (5) - 21 freq atrophy (6) - 1 freq i-digraph (6) - 1 freq orthography (6) - 50 freq photography (6) - 6 freq geographie (6) - 2 freq biographie (6) - 3 freq 'geography (6) - 1 freq polygraph (6) - 1 freq autocrat (6) - 4 freq demography (6) - 4 freq |
SoundEx code - A326 adjourn - 3 freq adjourns - 2 freq autographed - 2 freq aithsworn - 4 freq autocar - 1 freq attackers - 1 freq autographs - 2 freq autograph - 1 freq adwisory - 14 freq autocrat - 4 freq autosort - 1 freq autocorrect - 7 freq autocorrects - 1 freq adcramps - 1 freq aetshirts - 2 freq aetgraphics - 1 freq |
MetaPhone code - ATKRF autograph - 1 freq |
AUTOGRAPH |
Time to execute Levenshtein function - 0.186941 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.363203 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.027686 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.037508 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.000951 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. |