Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
usual (0) - 235 freq uisual (1) - 8 freq uswal (1) - 8 freq usual- (1) - 1 freq ushal (1) - 1 freq uizual (2) - 12 freq mutual (2) - 27 freq skal (2) - 1 freq unusual (2) - 24 freq shal (2) - 26 freq dual (2) - 7 freq usman (2) - 1 freq saal (2) - 3 freq uswall (2) - 1 freq qual (2) - 2 freq usa (2) - 52 freq usduyl (2) - 1 freq unul (2) - 1 freq sua (2) - 1 freq sal (2) - 55 freq usta (2) - 1 freq seal (2) - 31 freq uzul (2) - 1 freq ustae (2) - 2 freq suql (2) - 1 freq |
usual (0) - 235 freq uisual (1) - 8 freq sal (2) - 55 freq saal (2) - 3 freq seal (2) - 31 freq uswal (2) - 8 freq usual- (2) - 1 freq ushal (2) - 1 freq sail (3) - 100 freq yaisual (3) - 1 freq slae (3) - 8 freq isla (3) - 26 freq islay (3) - 4 freq asail (3) - 1 freq soil (3) - 30 freq seel (3) - 1 freq visual (3) - 5 freq slaa (3) - 3 freq sol (3) - 4 freq ousel (3) - 1 freq slay (3) - 5 freq seil (3) - 3 freq sel (3) - 75 freq seyal (3) - 2 freq saul (3) - 60 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 - USL usually - 171 freq usual - 235 freq uisual - 8 freq usli - 1 freq uizual - 12 freq usual- - 1 freq uisually - 3 freq uizually - 2 freq uzul - 1 freq |
USUAL |
Time to execute Levenshtein function - 0.185280 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.401001 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.026945 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.036509 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.000842 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. |