| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owlder (0) - 14 freq older (1) - 26 freq owler (1) - 5 freq owider (1) - 1 freq owder (1) - 1 freq cowlder (1) - 1 freq owld (2) - 166 freq wider (2) - 54 freq wler (2) - 1 freq powder (2) - 10 freq holder (2) - 2 freq golder (2) - 1 freq odder (2) - 1 freq owver (2) - 1 freq mulder (2) - 1 freq folder (2) - 4 freq boolder (2) - 1 freq wilder (2) - 4 freq olden (2) - 1 freq boulder (2) - 9 freq owlds (2) - 1 freq gulder (2) - 24 freq milder (2) - 2 freq ow'er (2) - 1 freq calder (2) - 12 freq |
owlder (0) - 14 freq cowlder (2) - 1 freq welder (2) - 4 freq owder (2) - 1 freq wilder (2) - 4 freq older (2) - 26 freq owler (2) - 5 freq owider (2) - 1 freq elder (3) - 58 freq aalder (3) - 24 freq eilder (3) - 1 freq calder (3) - 12 freq balder (3) - 1 freq alder (3) - 1 freq solder (3) - 2 freq felder (3) - 1 freq ouldir (3) - 1 freq bolder (3) - 1 freq aulder (3) - 243 freq milder (3) - 2 freq dolder (3) - 1 freq owlds (3) - 1 freq golder (3) - 1 freq yowder (3) - 1 freq holder (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 |
OWLDER |
| Time to execute Levenshtein function - 0.291984 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.349178 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.026914 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.037310 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.000819 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. |