| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| olde (0) - 1 freq olden (1) - 1 freq ode (1) - 13 freq ole (1) - 2 freq oldie (1) - 2 freq older (1) - 27 freq old (1) - 178 freq olds (1) - 3 freq olga (2) - 1 freq melde (2) - 1 freq ldl (2) - 2 freq volce (2) - 1 freq onlie (2) - 102 freq lue (2) - 5 freq golder (2) - 1 freq bolder (2) - 2 freq wide (2) - 249 freq folds (2) - 8 freq bole (2) - 4 freq sole (2) - 19 freq jede (2) - 2 freq lude (2) - 1 freq oyne (2) - 3 freq once (2) - 129 freq otder (2) - 1 freq |
olde (0) - 1 freq oldie (1) - 2 freq old (1) - 178 freq lade (2) - 26 freq aulde (2) - 1 freq lede (2) - 9 freq lyde (2) - 1 freq eld (2) - 30 freq lude (2) - 1 freq ould (2) - 21 freq ld (2) - 3 freq lode (2) - 2 freq eold (2) - 1 freq ald (2) - 14 freq older (2) - 27 freq ole (2) - 2 freq ode (2) - 13 freq olden (2) - 1 freq elide (2) - 1 freq olds (2) - 3 freq aldi (2) - 9 freq aldo (2) - 266 freq elude (2) - 1 freq blide (3) - 19 freq tyde (3) - 24 freq |
SoundEx code - O430 old - 178 freq oolit - 2 freq owld - 166 freq 'old - 3 freq ould - 21 freq olate - 1 freq 'owld - 2 freq oiled - 1 freq owild - 3 freq olite - 3 freq olde - 1 freq €˜old - 1 freq oolt - 1 freq oleit - 1 freq ool-eed - 1 freq €œold - 1 freq €œould - 1 freq oldie - 2 freq old” - 1 freq |
MetaPhone code - OLT old - 178 freq oolit - 2 freq owld - 166 freq 'old - 3 freq ould - 21 freq olate - 1 freq 'owld - 2 freq oiled - 1 freq olite - 3 freq olde - 1 freq €˜old - 1 freq oolt - 1 freq oleit - 1 freq ool-eed - 1 freq €œold - 1 freq €œould - 1 freq oldie - 2 freq old” - 1 freq |
OLDE |
| Time to execute Levenshtein function - 0.187982 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.376109 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.027876 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.037034 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.000858 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. |