| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| old” (0) - 1 freq gold” (1) - 1 freq on” (2) - 3 freq older (2) - 27 freq olde (2) - 1 freq oldie (2) - 2 freq ol’ (2) - 1 freq d” (2) - 1 freq bond” (2) - 1 freq good” (2) - 1 freq olds (2) - 3 freq old (2) - 178 freq old’s (2) - 1 freq olden (2) - 1 freq mud” (2) - 1 freq ldj (3) - 1 freq raid” (3) - 1 freq holdol (3) - 1 freq olr (3) - 2 freq maw” (3) - 1 freq ta” (3) - 1 freq owder (3) - 1 freq bolder (3) - 2 freq odd (3) - 142 freq owlds (3) - 1 freq |
old” (0) - 1 freq gold” (2) - 1 freq good” (3) - 1 freq d” (3) - 1 freq mud” (3) - 1 freq raid” (4) - 1 freq love” (4) - 1 freq cauld” (4) - 1 freq dee” (4) - 1 freq tide” (4) - 1 freq guid” (4) - 1 freq lose” (4) - 1 freq olden (4) - 1 freq bond” (4) - 1 freq ol’ (4) - 1 freq olde (4) - 1 freq older (4) - 27 freq on” (4) - 3 freq old (4) - 178 freq oldie (4) - 2 freq olds (4) - 3 freq old’s (4) - 1 freq men” (5) - 1 freq yin” (5) - 1 freq way” (5) - 1 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 |
OLD” |
| Time to execute Levenshtein function - 0.400036 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.504480 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.028830 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.037961 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.001004 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. |