| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ofdg (0) - 1 freq ofkg (1) - 1 freq pfg (2) - 1 freq ofzm (2) - 1 freq odd (2) - 142 freq ond (2) - 1 freq okda (2) - 1 freq org (2) - 26 freq ofjk (2) - 1 freq ddg (2) - 1 freq fdb (2) - 1 freq ojxg (2) - 1 freq omg (2) - 13 freq ctdg (2) - 1 freq o'd (2) - 13 freq odf (2) - 1 freq odo (2) - 1 freq afgg (2) - 1 freq ofhe (2) - 1 freq olds (2) - 3 freq fg (2) - 6 freq ong (2) - 2 freq obg (2) - 1 freq oad (2) - 2 freq oepg (2) - 1 freq |
ofdg (0) - 1 freq ofkg (2) - 1 freq fudge (3) - 18 freq uofg (3) - 1 freq fd (3) - 3 freq hadg (3) - 1 freq fg (3) - 6 freq fodge (3) - 6 freq fug (3) - 6 freq yhdg (3) - 1 freq feg (3) - 3 freq edg (3) - 1 freq fadge (3) - 8 freq fag (3) - 118 freq afgg (3) - 1 freq dg (3) - 19 freq fog (3) - 35 freq fig (3) - 12 freq ddg (3) - 1 freq fdb (3) - 1 freq fidge (3) - 9 freq fidgy (3) - 1 freq food (4) - 214 freq fang (4) - 12 freq fleg (4) - 84 freq |
SoundEx code - O132 oobits - 5 freq optics - 2 freq optician - 4 freq opteecians - 1 freq ofdg - 1 freq obwtoz - 1 freq |
MetaPhone code - OFTK ofdg - 1 freq |
OFDG |
| Time to execute Levenshtein function - 0.205532 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.354359 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.029994 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.038490 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.000907 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. |