| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onsetters (0) - 1 freq metters (3) - 8 freq cretters (3) - 8 freq onleukers (3) - 2 freq snatters (3) - 1 freq settes (3) - 1 freq nutters (3) - 7 freq ingethers (3) - 1 freq owersetters (3) - 10 freq netter (3) - 6 freq letters (3) - 142 freq 'letters (3) - 1 freq otters (3) - 3 freq sneesters (3) - 1 freq oysters (3) - 1 freq sesters (3) - 3 freq owresetters (3) - 1 freq setter's (3) - 1 freq setter (3) - 4 freq snotters (3) - 8 freq netter's (3) - 1 freq onsets (3) - 2 freq betters (3) - 6 freq unsettles (3) - 1 freq conseeders (3) - 2 freq |
onsetters (0) - 1 freq nutters (4) - 7 freq unsettles (4) - 1 freq natters (4) - 1 freq betters (5) - 6 freq styters (5) - 1 freq setter (5) - 4 freq snotters (5) - 8 freq absenters (5) - 1 freq onsets (5) - 2 freq oxsters (5) - 8 freq monsters (5) - 15 freq sottars (5) - 3 freq settlers (5) - 11 freq knitters (5) - 1 freq setter's (5) - 1 freq deserters (5) - 2 freq netter's (5) - 1 freq ingethers (5) - 1 freq owresetters (5) - 1 freq settes (5) - 1 freq snatters (5) - 1 freq metters (5) - 8 freq cretters (5) - 8 freq netter (5) - 6 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 omucket - 1 freq onestepbayond - 2 freq oneagt - 1 freq |
MetaPhone code - ONSTRS onsetters - 1 freq |
ONSETTERS |
| Time to execute Levenshtein function - 0.202795 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.429242 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.034025 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.039820 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.000860 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. |