| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| olden (0) - 1 freq holden (1) - 2 freq older (1) - 27 freq olde (1) - 1 freq golden (1) - 87 freq ogden (1) - 2 freq otder (2) - 1 freq elven (2) - 1 freq eldin (2) - 3 freq folder (2) - 4 freq rodden (2) - 15 freq elren (2) - 1 freq pleen (2) - 1 freq onnen (2) - 2 freq adden (2) - 1 freq cleen (2) - 3 freq widen (2) - 13 freq order (2) - 277 freq owsen (2) - 3 freq odin (2) - 43 freq often (2) - 126 freq aden (2) - 2 freq ode (2) - 13 freq oldest (2) - 3 freq alven (2) - 1 freq |
olden (0) - 1 freq aulden (2) - 15 freq laden (2) - 13 freq eldon (2) - 1 freq ogden (2) - 2 freq eldin (2) - 3 freq olde (2) - 1 freq older (2) - 27 freq holden (2) - 2 freq golden (2) - 87 freq wooden (3) - 37 freq den (3) - 104 freq slyden (3) - 1 freq o'deen (3) - 1 freq leiden (3) - 3 freq biden (3) - 9 freq goulden (3) - 2 freq alen (3) - 1 freq boldin (3) - 1 freq foldeen (3) - 1 freq peden (3) - 30 freq odeon (3) - 4 freq holdin (3) - 18 freq oilmen (3) - 1 freq laen (3) - 3 freq |
SoundEx code - O435 oul-time - 2 freq oul-tyme - 1 freq oldmeldrum - 1 freq olden - 1 freq old-timey - 1 freq oldnorthroad - 2 freq |
MetaPhone code - OLTN olden - 1 freq |
OLDEN |
| Time to execute Levenshtein function - 0.193673 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.355648 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.029076 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.037984 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.000905 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. |