| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onygate (0) - 1 freq onigate (1) - 1 freq onygates (1) - 4 freq onygaits (2) - 7 freq onysake (2) - 1 freq ingate (2) - 4 freq onyane (2) - 13 freq weygate (2) - 1 freq onymare (2) - 2 freq negate (2) - 2 freq ootgate (2) - 1 freq waygate (2) - 1 freq overgate (3) - 3 freq animate (3) - 1 freq ongan (3) - 2 freq onytime (3) - 11 freq doungate (3) - 1 freq onieane (3) - 1 freq coogate (3) - 2 freq innate (3) - 3 freq oneste (3) - 9 freq oniegates (3) - 15 freq lydgate (3) - 1 freq onywuty (3) - 1 freq conflate (3) - 1 freq |
onygate (0) - 1 freq onigate (1) - 1 freq ingate (2) - 4 freq negate (2) - 2 freq onygates (2) - 4 freq ungat (3) - 1 freq ootgate (3) - 1 freq waygate (3) - 1 freq onygaits (3) - 7 freq weygate (3) - 1 freq gate (4) - 294 freq onsite (4) - 1 freq engage (4) - 40 freq oneagt (4) - 1 freq nate (4) - 9 freq nyght (4) - 3 freq on-tae (4) - 1 freq ongaan (4) - 1 freq ongaun (4) - 57 freq nyte (4) - 1 freq ongaed (4) - 2 freq onywety (4) - 1 freq rinagate (4) - 2 freq inate (4) - 1 freq ontae (4) - 350 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 - ONKT ongaed - 2 freq oniegait - 2 freq onigate - 1 freq onygate - 1 freq oneagt - 1 freq |
ONYGATE |
| Time to execute Levenshtein function - 0.200895 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.372600 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.028707 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.039481 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.000936 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. |