Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
usual (0) - 240 freq uisual (1) - 8 freq uswal (1) - 8 freq ushal (1) - 1 freq usual- (1) - 1 freq suql (2) - 1 freq unul (2) - 1 freq seal (2) - 31 freq usa (2) - 52 freq stal (2) - 4 freq sal (2) - 56 freq acual (2) - 1 freq usually (2) - 176 freq qual (2) - 3 freq aqual (2) - 3 freq saal (2) - 3 freq casual (2) - 22 freq usduyl (2) - 1 freq usta (2) - 1 freq ustae (2) - 2 freq uzul (2) - 1 freq uiswal (2) - 6 freq visual (2) - 5 freq usefal (2) - 1 freq usan (2) - 4 freq |
usual (0) - 240 freq uisual (1) - 8 freq seal (2) - 31 freq saal (2) - 3 freq sal (2) - 56 freq ushal (2) - 1 freq usual- (2) - 1 freq uswal (2) - 8 freq sol (3) - 4 freq seyal (3) - 2 freq asl (3) - 1 freq seil (3) - 3 freq yoosual (3) - 5 freq osla (3) - 1 freq slaa (3) - 3 freq sl (3) - 7 freq unusal (3) - 1 freq sulu (3) - 1 freq sale (3) - 63 freq slae (3) - 8 freq islay (3) - 4 freq sool (3) - 1 freq seel (3) - 1 freq asail (3) - 1 freq yaisual (3) - 1 freq |
SoundEx code - U240 usually - 176 freq usual - 240 freq ugly - 74 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 - 176 freq usual - 240 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.231719 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.361436 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.027243 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.037386 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.000956 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. |