Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
older (0) - 27 freq folder (1) - 4 freq olden (1) - 1 freq odder (1) - 1 freq owder (1) - 1 freq otder (1) - 1 freq holder (1) - 2 freq order (1) - 277 freq dolder (1) - 1 freq golder (1) - 1 freq bolder (1) - 2 freq owlder (1) - 14 freq solder (1) - 2 freq alder (1) - 1 freq olde (1) - 1 freq elder (1) - 58 freq orrer (2) - 1 freq adder (2) - 4 freq owner (2) - 28 freq o'dee (2) - 1 freq olr (2) - 2 freq edder (2) - 21 freq looder (2) - 36 freq roller (2) - 27 freq gulder (2) - 24 freq |
older (0) - 27 freq elder (1) - 58 freq alder (1) - 1 freq ouldir (2) - 1 freq solder (2) - 2 freq looder (2) - 36 freq eilder (2) - 1 freq louder (2) - 40 freq aulder (2) - 245 freq aalder (2) - 24 freq owlder (2) - 14 freq olde (2) - 1 freq bolder (2) - 2 freq order (2) - 277 freq owder (2) - 1 freq holder (2) - 2 freq otder (2) - 1 freq odder (2) - 1 freq olden (2) - 1 freq golder (2) - 1 freq dolder (2) - 1 freq folder (2) - 4 freq yowder (3) - 1 freq lner (3) - 1 freq idder (3) - 286 freq |
SoundEx code - O436 older - 27 freq olderfleet - 1 freq older-twin - 1 freq oil-drum - 1 freq owlder - 14 freq €˜older - 1 freq ouldir - 1 freq oltrvx - 1 freq oldrovers - 1 freq |
MetaPhone code - OLTR older - 27 freq owlder - 14 freq €˜older - 1 freq ouldir - 1 freq |
OLDER |
Time to execute Levenshtein function - 0.183485 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.367050 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.032308 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.039178 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.000871 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. |