| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uswal (0) - 8 freq ushal (1) - 1 freq uswall (1) - 1 freq uiswal (1) - 6 freq usual (1) - 240 freq swam (2) - 35 freq swald (2) - 2 freq swaal (2) - 2 freq swan (2) - 23 freq usefal (2) - 1 freq seal (2) - 31 freq shal (2) - 26 freq swaa (2) - 2 freq twal (2) - 120 freq oswald (2) - 4 freq eeswal (2) - 10 freq stal (2) - 4 freq uwcl (2) - 1 freq swael (2) - 2 freq upwae (2) - 1 freq swat (2) - 7 freq sal (2) - 56 freq 'twal (2) - 2 freq swall (2) - 21 freq uswally (2) - 1 freq |
uswal (0) - 8 freq uiswal (1) - 6 freq ushal (2) - 1 freq swael (2) - 2 freq eeswal (2) - 10 freq swaal (2) - 2 freq uswall (2) - 1 freq usual (2) - 240 freq ydwal (3) - 1 freq asweel (3) - 18 freq swaw (3) - 12 freq saal (3) - 3 freq wal (3) - 24 freq skal (3) - 1 freq sway (3) - 10 freq sweel (3) - 20 freq sweil (3) - 1 freq sowl (3) - 128 freq swap (3) - 20 freq dwal (3) - 1 freq swa (3) - 2 freq uisual (3) - 8 freq sewel (3) - 1 freq swab (3) - 1 freq sowel (3) - 87 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 - USWL uswal - 8 freq uiswal - 6 freq uswall - 1 freq uswally - 1 freq |
USWAL |
| Time to execute Levenshtein function - 0.216854 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.373008 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.027670 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.038208 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.001143 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. |