| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| openly (0) - 11 freq oppenly (1) - 1 freq opens (2) - 62 freq openan (2) - 4 freq oanly (2) - 7 freq openin (2) - 120 freq peely (2) - 18 freq penny (2) - 130 freq evenly (2) - 5 freq owerly (2) - 1 freq open- (2) - 1 freq open (2) - 719 freq onnly (2) - 37 freq openta (2) - 1 freq spinly (2) - 1 freq plenly (2) - 1 freq opened (2) - 283 freq opent (2) - 85 freq keenly (2) - 8 freq 'peely (2) - 1 freq openit (2) - 4 freq only (2) - 1847 freq open'd (2) - 1 freq aenly (2) - 1 freq opennt (2) - 1 freq |
openly (0) - 11 freq oppenly (2) - 1 freq keenly (3) - 8 freq opent (3) - 85 freq opened (3) - 283 freq plenly (3) - 1 freq openit (3) - 4 freq aenly (3) - 1 freq penal (3) - 5 freq penel (3) - 106 freq opener (3) - 4 freq epely (3) - 1 freq spinly (3) - 1 freq only (3) - 1847 freq bienly (3) - 7 freq peely (3) - 18 freq openan (3) - 4 freq oanly (3) - 7 freq openta (3) - 1 freq opens (3) - 62 freq penny (3) - 130 freq evenly (3) - 5 freq onnly (3) - 37 freq open (3) - 719 freq open- (3) - 1 freq |
SoundEx code - O154 openly - 11 freq oppenly - 1 freq oppinlie - 1 freq |
MetaPhone code - OPNL openly - 11 freq oppenly - 1 freq oppinlie - 1 freq |
OPENLY |
| Time to execute Levenshtein function - 0.181793 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.323367 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.027363 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.037561 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.000825 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. |