| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onygates (0) - 4 freq onygate (1) - 1 freq negates (2) - 1 freq oniegates (2) - 15 freq onigate (2) - 1 freq onygaits (2) - 7 freq sumgates (3) - 1 freq nyght's (3) - 1 freq waygate (3) - 1 freq onysake (3) - 1 freq gates (3) - 104 freq onyane's (3) - 1 freq midgates (3) - 1 freq byganes (3) - 2 freq ingate (3) - 4 freq agates (3) - 1 freq saegates (3) - 1 freq oates (3) - 1 freq inmates (3) - 1 freq ongaens (3) - 2 freq negated (3) - 2 freq onyane (3) - 13 freq onyways (3) - 5 freq negate (3) - 2 freq fowkgates (3) - 8 freq |
onygates (0) - 4 freq oniegates (2) - 15 freq negates (2) - 1 freq onygate (2) - 1 freq onygaits (2) - 7 freq onigate (3) - 1 freq negated (4) - 2 freq ongaens (4) - 2 freq inmates (4) - 1 freq saegates (4) - 1 freq ongauns (4) - 63 freq awegates (4) - 1 freq agates (4) - 1 freq engages (4) - 3 freq negate (4) - 2 freq rinagates (4) - 1 freq gates (4) - 104 freq ingate (4) - 4 freq ongaeins (5) - 2 freq negatin (5) - 2 freq nights (5) - 68 freq angles (5) - 29 freq ingines (5) - 4 freq nats (5) - 2 freq mygets (5) - 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 omucket - 1 freq onestepbayond - 2 freq oneagt - 1 freq |
MetaPhone code - ONKTS onygates - 4 freq oniegates - 15 freq onygaits - 7 freq |
ONYGATES |
| Time to execute Levenshtein function - 0.186564 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.359299 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.032229 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.040664 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.001204 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. |