| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| usage (0) - 10 freq sage (1) - 9 freq uisage (1) - 9 freq usige (1) - 1 freq usages (1) - 1 freq urge (2) - 27 freq usan (2) - 4 freq sate (2) - 64 freq swage (2) - 1 freq usain (2) - 1 freq umrage (2) - 1 freq munage (2) - 6 freq wage (2) - 20 freq unsafe (2) - 2 freq sake (2) - 245 freq saige (2) - 3 freq uisge (2) - 5 freq adage (2) - 2 freq saga (2) - 12 freq 'age (2) - 4 freq uissage (2) - 3 freq ushare (2) - 1 freq rage (2) - 85 freq ukase (2) - 1 freq 'sae (2) - 49 freq |
usage (0) - 10 freq uisage (1) - 9 freq usige (1) - 1 freq sage (1) - 9 freq saige (2) - 3 freq uisge (2) - 5 freq sag (2) - 4 freq sago (2) - 1 freq saga (2) - 12 freq usages (2) - 1 freq same (3) - 1730 freq sig (3) - 3 freq cage (3) - 59 freq image (3) - 102 freq ustae (3) - 2 freq visage (3) - 3 freq sale (3) - 63 freq use (3) - 466 freq sages (3) - 1 freq safe (3) - 284 freq veage (3) - 9 freq sausage (3) - 45 freq isg (3) - 1 freq viage (3) - 1 freq sare (3) - 30 freq |
SoundEx code - U220 uses - 47 freq ukase - 1 freq uises - 36 freq uisage - 9 freq uisses - 2 freq uizes - 7 freq uissis - 1 freq uissage - 3 freq usage - 10 freq usige - 1 freq useco - 1 freq 'uises - 1 freq ujazqaa - 1 freq ukhka - 1 freq uzykj - 4 freq uxoc - 1 freq uigeach - 1 freq |
MetaPhone code - USJ uisge - 5 freq uisage - 9 freq uissage - 3 freq usage - 10 freq usige - 1 freq usj - 1 freq uisge - 1 freq |
USAGE |
| Time to execute Levenshtein function - 0.219485 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.370899 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.029379 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.037458 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.000920 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. |