| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| usages (0) - 1 freq sages (1) - 1 freq usage (1) - 10 freq sage (2) - 9 freq sakes (2) - 22 freq sates (2) - 9 freq images (2) - 17 freq saes (2) - 10 freq cages (2) - 9 freq uses (2) - 47 freq ages (2) - 153 freq 'ages (2) - 1 freq stages (2) - 16 freq uisage (2) - 9 freq mages (2) - 1 freq sawes (2) - 1 freq sales (2) - 32 freq pages (2) - 132 freq usige (2) - 1 freq sausages (2) - 25 freq saves (2) - 11 freq urges (2) - 2 freq saies (2) - 1 freq wages (2) - 41 freq munages (2) - 1 freq |
usages (0) - 1 freq sages (1) - 1 freq sagas (2) - 3 freq usage (2) - 10 freq sausages (3) - 25 freq usige (3) - 1 freq pages (3) - 132 freq sales (3) - 32 freq saves (3) - 11 freq urges (3) - 2 freq segas (3) - 1 freq rages (3) - 9 freq sawes (3) - 1 freq wages (3) - 41 freq saies (3) - 1 freq saes (3) - 10 freq mages (3) - 1 freq sakes (3) - 22 freq images (3) - 17 freq sates (3) - 9 freq cages (3) - 9 freq uses (3) - 47 freq uisage (3) - 9 freq stages (3) - 16 freq 'ages (3) - 1 freq |
SoundEx code - U222 usages - 1 freq uzowsijol - 1 freq |
MetaPhone code - USJS usages - 1 freq |
USAGES |
| Time to execute Levenshtein function - 0.271737 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.435560 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.036190 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.044822 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.001169 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. |