| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auldest (0) - 46 freq aaldest (1) - 8 freq aulest (1) - 7 freq aul'est (1) - 1 freq bauldest (1) - 1 freq aldest (1) - 1 freq cauldest (1) - 5 freq eldest (2) - 18 freq oulest (2) - 5 freq haurdest (2) - 1 freq aaldist (2) - 1 freq owldest (2) - 5 freq aulden (2) - 15 freq allest (2) - 1 freq auldgit (2) - 1 freq fullest (2) - 2 freq eildest (2) - 2 freq auldies (2) - 1 freq wildest (2) - 3 freq aulder (2) - 244 freq furdest (2) - 2 freq nudest (2) - 1 freq guldert (2) - 13 freq auld's (2) - 3 freq aulds (2) - 3 freq |
auldest (0) - 46 freq aaldest (1) - 8 freq aldest (1) - 1 freq aaldist (2) - 1 freq oldest (2) - 3 freq eldest (2) - 18 freq eildest (2) - 2 freq cauldest (2) - 5 freq bauldest (2) - 1 freq aul'est (2) - 1 freq aulest (2) - 7 freq wildest (3) - 3 freq nudest (3) - 1 freq loudest (3) - 9 freq auldies (3) - 1 freq aulds (3) - 3 freq aalest (3) - 4 freq loodest (3) - 3 freq allest (3) - 1 freq oulest (3) - 5 freq auldgit (3) - 1 freq owldest (3) - 5 freq amidst (4) - 7 freq widest (4) - 3 freq loest (4) - 1 freq |
SoundEx code - A432 although - 158 freq auldest - 46 freq altogether - 6 freq auld's - 3 freq auldhouseburn - 3 freq auldhouse - 1 freq aldo's - 29 freq auld-sons - 1 freq althegither - 2 freq althegether - 1 freq aaldest - 8 freq aldi's - 2 freq altocumulus - 1 freq auldsters - 2 freq aaldist - 1 freq €”although - 1 freq aulds - 3 freq aaltaegethir - 1 freq aldest - 1 freq aldiuk - 3 freq auldgit - 1 freq auldsideheid - 1 freq aaltaegither - 1 freq auldies - 1 freq |
MetaPhone code - ALTST auldest - 46 freq aaldest - 8 freq aaldist - 1 freq aldest - 1 freq |
AULDEST |
| Time to execute Levenshtein function - 0.213124 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.359149 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.029098 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.038895 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.000890 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. |