Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
older (0) - 26 freq holder (1) - 2 freq golder (1) - 1 freq otder (1) - 1 freq folder (1) - 4 freq owlder (1) - 14 freq dolder (1) - 1 freq alder (1) - 1 freq odder (1) - 1 freq solder (1) - 2 freq bolder (1) - 1 freq olden (1) - 1 freq olde (1) - 1 freq owder (1) - 1 freq order (1) - 271 freq elder (1) - 58 freq gleer (2) - 1 freq olxep (2) - 1 freq milder (2) - 2 freq adder (2) - 4 freq elders (2) - 21 freq yonder (2) - 67 freq ooner (2) - 2 freq onner (2) - 3 freq polders (2) - 1 freq |
older (0) - 26 freq alder (1) - 1 freq elder (1) - 58 freq owder (2) - 1 freq aulder (2) - 243 freq louder (2) - 40 freq olde (2) - 1 freq looder (2) - 36 freq aalder (2) - 24 freq eilder (2) - 1 freq ouldir (2) - 1 freq order (2) - 271 freq folder (2) - 4 freq olden (2) - 1 freq otder (2) - 1 freq golder (2) - 1 freq holder (2) - 2 freq dolder (2) - 1 freq owlder (2) - 14 freq solder (2) - 2 freq bolder (2) - 1 freq odder (2) - 1 freq wider (3) - 54 freq olds (3) - 3 freq olr (3) - 2 freq |
SoundEx code - O436 older - 26 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 - 26 freq owlder - 14 freq €˜older - 1 freq ouldir - 1 freq |
OLDER |
Time to execute Levenshtein function - 0.168677 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.337982 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.027210 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.037234 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.000854 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. |