| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owldest (0) - 5 freq oldest (1) - 3 freq oddest (2) - 1 freq auldest (2) - 46 freq aaldest (2) - 8 freq oulest (2) - 5 freq eldest (2) - 18 freq aldest (2) - 1 freq wildest (2) - 3 freq widest (2) - 3 freq owlder (2) - 14 freq eildest (2) - 2 freq owlds (2) - 1 freq owreset (3) - 19 freq foldet (3) - 4 freq owls (3) - 3 freq oxides (3) - 1 freq owider (3) - 1 freq fullest (3) - 2 freq howlds (3) - 3 freq owes (3) - 4 freq olds (3) - 3 freq owerfest (3) - 1 freq owet (3) - 1 freq 'west (3) - 1 freq |
owldest (0) - 5 freq oldest (2) - 3 freq wildest (2) - 3 freq widest (3) - 3 freq owlds (3) - 1 freq eildest (3) - 2 freq aldest (3) - 1 freq auldest (3) - 46 freq eldest (3) - 18 freq aaldest (3) - 8 freq aaldist (4) - 1 freq loodest (4) - 3 freq loudest (4) - 9 freq cauldest (4) - 5 freq bauldest (4) - 1 freq wildwest (4) - 1 freq oulest (4) - 5 freq owlder (4) - 14 freq oddest (4) - 1 freq wouldnt (5) - 2 freq leest (5) - 12 freq baddest (5) - 1 freq coolest (5) - 1 freq aul'est (5) - 1 freq wylds (5) - 1 freq |
SoundEx code - O432 oolets - 1 freq oldest - 3 freq oldie-coloured - 1 freq owldest - 5 freq owlds - 1 freq olds - 3 freq olds - 1 freq oldies - 1 freq oldsayings - 2 freq |
MetaPhone code - OLTST oldest - 3 freq owldest - 5 freq |
OWLDEST |
| Time to execute Levenshtein function - 0.282451 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.381031 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.027357 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.038013 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.001268 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. |