| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ushare (0) - 1 freq share (1) - 281 freq shure (2) - 12 freq thare (2) - 503 freq shade (2) - 54 freq ushered (2) - 5 freq scare (2) - 20 freq sharp (2) - 85 freq snare (2) - 13 freq ushers (2) - 2 freq bshara (2) - 1 freq shaire (2) - 8 freq shard (2) - 2 freq awhare (2) - 2 freq shire (2) - 26 freq skare (2) - 4 freq ushert (2) - 3 freq 'ushare' (2) - 1 freq shared (2) - 86 freq 'sare (2) - 1 freq stare (2) - 69 freq ushal (2) - 1 freq shame (2) - 167 freq shark (2) - 21 freq sare (2) - 30 freq |
ushare (0) - 1 freq share (1) - 281 freq ashore (2) - 35 freq shar (2) - 6 freq usher (2) - 3 freq shore (2) - 188 freq shure (2) - 12 freq shire (2) - 26 freq shaire (2) - 8 freq shane (3) - 62 freq shave (3) - 18 freq whare (3) - 19 freq sharn (3) - 29 freq sharg (3) - 2 freq us're (3) - 1 freq hare (3) - 199 freq shae (3) - 853 freq sharet (3) - 3 freq ashoar (3) - 3 freq shir (3) - 1 freq sahara (3) - 7 freq shorie (3) - 2 freq ashaor (3) - 1 freq shuire (3) - 1 freq shair (3) - 445 freq |
SoundEx code - U260 us're - 1 freq usher - 3 freq user - 3 freq ussr - 3 freq uiser - 5 freq usri - 3 freq uksrw - 1 freq uighur - 34 freq ukxkr - 1 freq ueweaoijur - 1 freq ushare - 1 freq 'ushare' - 1 freq |
MetaPhone code - UXR usher - 3 freq ushare - 1 freq 'ushare' - 1 freq |
USHARE |
| Time to execute Levenshtein function - 0.199439 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.350519 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.028652 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.036231 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.001015 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. |