| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oecd (0) - 1 freq necd (1) - 2 freq oed (1) - 6 freq ocd (1) - 4 freq bedd (2) - 56 freq mend (2) - 42 freq gec (2) - 1 freq ledd (2) - 7 freq oevci (2) - 2 freq decid (2) - 1 freq meld (2) - 4 freq eece (2) - 8 freq medd (2) - 31 freq erd (2) - 11 freq ferd (2) - 2 freq seyd (2) - 86 freq nece (2) - 1 freq herd (2) - 158 freq pech (2) - 35 freq beyd (2) - 10 freq macd (2) - 12 freq od (2) - 8 freq oncy (2) - 4 freq need (2) - 1819 freq ecb (2) - 1 freq |
oecd (0) - 1 freq ocd (1) - 4 freq ceud (2) - 1 freq cd (2) - 50 freq necd (2) - 2 freq oed (2) - 6 freq feid (3) - 1 freq geed (3) - 69 freq neid (3) - 1 freq ded (3) - 4 freq ock (3) - 1 freq seed (3) - 117 freq sed (3) - 175 freq poucd (3) - 1 freq meyd (3) - 2 freq zed (3) - 1 freq hed (3) - 1155 freq ootd (3) - 2 freq old (3) - 178 freq eld (3) - 30 freq -ed (3) - 1 freq occa (3) - 1 freq read (3) - 958 freq obud (3) - 1 freq odd (3) - 142 freq |
SoundEx code - O230 ocht - 317 freq ought - 12 freq oaght - 1 freq 'ocht - 2 freq oozit - 2 freq oucht - 21 freq oozed - 1 freq oagit - 5 freq owsed - 9 freq ouecht - 1 freq oxide - 1 freq oecd - 1 freq oakwood - 1 freq oesed - 3 freq oct - 4 freq oosed - 1 freq ought - 1 freq oaged - 1 freq ocd - 1 freq okda - 1 freq ocd - 4 freq ojdhii - 1 freq oushed - 1 freq oqsd - 1 freq okayed - 1 freq |
MetaPhone code - OKT oecd - 1 freq oct - 4 freq ocd - 1 freq okda - 1 freq ocd - 4 freq |
OECD |
| Time to execute Levenshtein function - 0.198382 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.477913 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.030744 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.079023 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.001017 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. |