| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| usopen (0) - 1 freq hopen (2) - 1 freq aspen (2) - 9 freq sope (2) - 3 freq reopen (2) - 1 freq sopes (2) - 1 freq open (2) - 719 freq 'open (2) - 4 freq spen (2) - 29 freq €˜open (2) - 5 freq toppen (3) - 1 freq open- (3) - 1 freq ugsome (3) - 65 freq scoopen (3) - 1 freq steen (3) - 114 freq pope (3) - 26 freq sen (3) - 155 freq usher (3) - 3 freq sypes (3) - 5 freq chosen (3) - 48 freq gappen (3) - 2 freq spoken (3) - 214 freq 'appen (3) - 1 freq stoapen (3) - 1 freq pen (3) - 119 freq |
usopen (0) - 1 freq spen (2) - 29 freq aspen (2) - 9 freq span (3) - 17 freq speno (3) - 1 freq soopin (3) - 7 freq speyn (3) - 1 freq speen (3) - 17 freq speun (3) - 2 freq sypin (3) - 12 freq spon (3) - 1 freq spin (3) - 64 freq spein (3) - 2 freq spun (3) - 28 freq spean (3) - 1 freq hopen (3) - 1 freq reopen (3) - 1 freq open (3) - 719 freq sopes (3) - 1 freq sope (3) - 3 freq 'open (3) - 4 freq sipel (4) - 1 freq sype (4) - 4 freq spet (4) - 1 freq european (4) - 171 freq |
SoundEx code - U215 ussf-fendit - 1 freq uisfuness - 1 freq uissfuness - 1 freq uccupant - 1 freq uxfm - 1 freq uiwzponfha - 1 freq usopen - 1 freq ucbmbupurh - 1 freq |
MetaPhone code - USPN usopen - 1 freq |
USOPEN |
| Time to execute Levenshtein function - 0.207650 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.532210 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.028205 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.041281 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.001005 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. |