| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auldgit (0) - 1 freq audit (2) - 12 freq ludgit (2) - 5 freq auldest (2) - 46 freq auldyin (2) - 1 freq mudgit (2) - 1 freq nudgit (2) - 1 freq fauldit (2) - 16 freq budget (3) - 31 freq aught (3) - 4 freq aulds (3) - 3 freq pundit (3) - 3 freq fauldie (3) - 7 freq haultit (3) - 1 freq bulderit (3) - 1 freq bullit (3) - 1 freq bauldest (3) - 1 freq mulctit (3) - 1 freq mouldit (3) - 1 freq alignit (3) - 1 freq auldrife (3) - 1 freq aidit (3) - 1 freq alludit (3) - 2 freq fudgie (3) - 4 freq cauldrif (3) - 2 freq |
auldgit (0) - 1 freq ludgit (2) - 5 freq nudgit (3) - 1 freq mudgit (3) - 1 freq auldest (3) - 46 freq luggit (4) - 8 freq fledgit (4) - 1 freq legit (4) - 4 freq eildit (4) - 12 freq pledgit (4) - 1 freq ludgin (4) - 7 freq aldest (4) - 1 freq fidgit (4) - 3 freq aaldist (4) - 1 freq aaldest (4) - 8 freq edgit (4) - 1 freq fauldit (4) - 16 freq budget (4) - 31 freq audit (4) - 12 freq auldyin (4) - 1 freq ludges (5) - 2 freq wuddit (5) - 1 freq guldert (5) - 13 freq cauldest (5) - 5 freq wudfit (5) - 2 freq |
SoundEx code - A432 although - 157 freq auldest - 46 freq altogether - 6 freq auld's - 3 freq auldhouseburn - 3 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 - ALJT alleged - 1 freq auldgit - 1 freq |
AULDGIT |
| Time to execute Levenshtein function - 0.205985 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.407444 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.028399 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.038401 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.004079 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. |