| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uid (0) - 1 freq huid (1) - 2 freq iid (1) - 1 freq 'id (1) - 3 freq nuid (1) - 1 freq upd (1) - 1 freq euid (1) - 4 freq muid (1) - 7 freq ruid (1) - 13 freq puid (1) - 1 freq wid (1) - 3772 freq utd (1) - 11 freq fuid (1) - 37 freq pid (1) - 1 freq kid (1) - 104 freq did (1) - 2859 freq lid (1) - 71 freq aid (1) - 37 freq tid (1) - 25 freq usd (1) - 1 freq uis (1) - 17 freq uzid (1) - 1 freq vid (1) - 4 freq bid (1) - 77 freq mid (1) - 60 freq |
uid (0) - 1 freq yid (1) - 87 freq oid (1) - 1 freq auid (1) - 1 freq euid (1) - 4 freq id (1) - 597 freq eid (1) - 4 freq iid (1) - 1 freq ud (1) - 4 freq aid (1) - 37 freq di (2) - 69 freq ad (2) - 126 freq die (2) - 122 freq aide (2) - 1 freq aed (2) - 2 freq uik (2) - 1 freq und (2) - 12 freq suid (2) - 47 freq sid (2) - 19 freq uiq (2) - 2 freq d (2) - 462 freq wuid (2) - 454 freq gid (2) - 302 freq yed (2) - 7 freq dii (2) - 1 freq |
SoundEx code - U300 ut - 9 freq uid - 1 freq ¸'ut - 1 freq uth - 1 freq ud - 4 freq utha - 1 freq uydh - 1 freq utd - 11 freq uydo - 1 freq |
MetaPhone code - UT ut - 9 freq uid - 1 freq ¸'ut - 1 freq ud - 4 freq uydh - 1 freq uydo - 1 freq |
UID |
| Time to execute Levenshtein function - 0.228443 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.390383 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.028397 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.037043 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.000955 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. |