Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oldie (0) - 2 freq ollie (1) - 7 freq oodie (1) - 1 freq olde (1) - 1 freq goldie (1) - 3 freq oldies (1) - 1 freq eldin (2) - 3 freq roddie (2) - 18 freq clie (2) - 2 freq olds (2) - 3 freq soldier (2) - 22 freq wolfie (2) - 5 freq odige (2) - 1 freq offie (2) - 2 freq sadie (2) - 25 freq elie (2) - 1 freq doddie (2) - 4 freq olif (2) - 1 freq goldies (2) - 1 freq elsie (2) - 62 freq orrie (2) - 3 freq gadie (2) - 5 freq claie (2) - 1 freq aedie (2) - 1 freq yaldie (2) - 3 freq |
oldie (0) - 2 freq olde (1) - 1 freq yaldie (2) - 3 freq old (2) - 178 freq aldi (2) - 9 freq goldie (2) - 3 freq oodie (2) - 1 freq ollie (2) - 7 freq oldies (2) - 1 freq bidie (3) - 3 freq elude (3) - 1 freq die (3) - 122 freq woodie (3) - 1 freq toadie (3) - 1 freq andie (3) - 1 freq eadie (3) - 1 freq eordie (3) - 1 freq illie (3) - 2 freq loddie (3) - 5 freq roadie (3) - 18 freq lie (3) - 259 freq didie (3) - 5 freq moodie (3) - 1 freq ilie (3) - 1 freq dydie (3) - 3 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 |
OLDIE |
Time to execute Levenshtein function - 0.679335 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 - 1.205240 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.099270 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.113387 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.000848 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. |