Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uyoacl (0) - 1 freq yoal (2) - 1 freq ykal (3) - 1 freq coal (3) - 132 freq uswall (3) - 1 freq bloack (3) - 4 freq lyall (3) - 9 freq uoa (3) - 1 freq knoack (3) - 7 freq hyooch (3) - 1 freq unpack (3) - 5 freq shoal (3) - 2 freq poach (3) - 2 freq udmal (3) - 1 freq ushal (3) - 1 freq shoack (3) - 2 freq unloack (3) - 1 freq yoaq (3) - 1 freq froack (3) - 2 freq ycl (3) - 1 freq uswal (3) - 8 freq stoal (3) - 2 freq ryall (3) - 1 freq broach (3) - 6 freq yoch (3) - 1 freq |
uyoacl (0) - 1 freq ycl (3) - 1 freq yoal (3) - 1 freq coal (3) - 132 freq foal (4) - 2 freq ryal (4) - 3 freq youl (4) - 1 freq yowl (4) - 11 freq goal (4) - 89 freq usual (4) - 235 freq youll (4) - 2 freq uwcl (4) - 1 freq ayqal (4) - 1 freq yock (4) - 8 freq yall (4) - 3 freq hoal (4) - 4 freq yal (4) - 2 freq cl (4) - 5 freq acual (4) - 1 freq col (4) - 11 freq coul (4) - 56 freq caaaal (4) - 1 freq yarl (4) - 18 freq cal (4) - 29 freq ceol (4) - 1 freq |
SoundEx code - U240 usually - 171 freq usual - 235 freq ugly - 69 freq uswal - 8 freq uisual - 8 freq uckle - 1 freq uiswal - 6 freq ushal - 1 freq usli - 1 freq uizual - 12 freq usual- - 1 freq uisually - 3 freq uswall - 1 freq uswally - 1 freq uizually - 2 freq ukela - 4 freq uwcl - 1 freq uyoacl - 1 freq 'ugly' - 1 freq uzul - 1 freq |
MetaPhone code - UYKL uyoacl - 1 freq |
UYOACL |
Time to execute Levenshtein function - 0.368818 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.524665 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.062121 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.037513 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.000836 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. |