| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onset (0) - 7 freq inset (1) - 2 freq onsets (1) - 2 freq unmet (2) - 3 freq onles (2) - 2 freq onnen (2) - 2 freq onley (2) - 18 freq onkent (2) - 2 freq yset (2) - 2 freq corset (2) - 2 freq owsen (2) - 3 freq once (2) - 123 freq one' (2) - 1 freq bonnet (2) - 34 freq set (2) - 1501 freq sunset (2) - 28 freq consent (2) - 11 freq sonnet (2) - 12 freq onner (2) - 3 freq onpit (2) - 1 freq €˜set (2) - 1 freq oney (2) - 15 freq ense (2) - 15 freq owsed (2) - 9 freq ansed (2) - 1 freq |
onset (0) - 7 freq inset (1) - 2 freq onsite (2) - 1 freq onsets (2) - 2 freq unst (2) - 12 freq kinset (3) - 1 freq insert (3) - 3 freq net (3) - 87 freq ont (3) - 5 freq unser (3) - 3 freq ons (3) - 1 freq alset (3) - 1 freq ootset (3) - 15 freq insec (3) - 2 freq inlet (3) - 1 freq upset (3) - 65 freq on-it (3) - 2 freq anet (3) - 1 freq neest (3) - 88 freq insect (3) - 3 freq onsein (3) - 2 freq niest (3) - 2 freq beset (3) - 4 freq endet (3) - 42 freq const (3) - 1 freq |
SoundEx code - O523 onygates - 4 freq onset - 7 freq oanside - 1 freq oncywuty - 1 freq onsite - 1 freq onside - 2 freq onicthin - 1 freq onstage - 7 freq 'onest - 1 freq oneste - 9 freq oniegates - 15 freq ongaed - 2 freq oniegait - 2 freq onygaits - 7 freq on-stapp't - 1 freq onsatisfactorie- - 1 freq onsatisfactorie - 1 freq on-said - 1 freq omnigaddrum - 2 freq 'omnigaddrum' - 1 freq omnigadderum - 1 freq onsetters - 1 freq onuised - 1 freq onstaundin - 2 freq onigate - 1 freq on-steid - 11 freq onsteid - 11 freq onygate - 1 freq onsets - 2 freq oÂ’mucket - 1 freq onestepbayond - 2 freq oneagt - 1 freq |
MetaPhone code - ONST onset - 7 freq oanside - 1 freq onsite - 1 freq onside - 2 freq 'onest - 1 freq oneste - 9 freq on-said - 1 freq onuised - 1 freq |
ONSET |
| Time to execute Levenshtein function - 0.197266 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.361765 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.029033 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.040617 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.000783 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. |