| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opener (0) - 4 freq openers (1) - 1 freq opened (1) - 283 freq spencer (2) - 16 freq openly (2) - 11 freq openta (2) - 1 freq speer (2) - 21 freq penter (2) - 5 freq pened (2) - 1 freq daener (2) - 2 freq dener (2) - 2 freq oppened (2) - 22 freq peter (2) - 148 freq wiener (2) - 2 freq onner (2) - 3 freq gener (2) - 1 freq deener (2) - 3 freq openan (2) - 4 freq open (2) - 719 freq 'peer (2) - 3 freq openeen (2) - 2 freq apened (2) - 6 freq open'd (2) - 1 freq opine (2) - 1 freq keener (2) - 6 freq |
opener (0) - 4 freq opened (2) - 283 freq openers (2) - 1 freq opens (3) - 62 freq seener (3) - 14 freq peer (3) - 196 freq opine (3) - 1 freq apened (3) - 6 freq open- (3) - 1 freq keener (3) - 6 freq openit (3) - 4 freq openin (3) - 120 freq opined (3) - 5 freq penel (3) - 106 freq opent (3) - 85 freq owner (3) - 28 freq openeen (3) - 2 freq ooner (3) - 2 freq capener (3) - 36 freq dener (3) - 2 freq peter (3) - 148 freq pened (3) - 1 freq penter (3) - 5 freq openly (3) - 11 freq openta (3) - 1 freq |
SoundEx code - O156 opener - 4 freq open-air - 3 freq open-hairtit - 1 freq open-haerted - 1 freq openwark - 3 freq openyerlugs - 1 freq openers - 1 freq |
MetaPhone code - OPNR opener - 4 freq open-air - 3 freq |
OPENER |
| Time to execute Levenshtein function - 0.201704 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.375068 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.027121 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.037099 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.000794 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. |