| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nonbinary (0) - 1 freq non-binary (1) - 3 freq binary (3) - 4 freq ordinary (3) - 43 freq non-dairy (4) - 1 freq nominate (4) - 1 freq joinery (4) - 5 freq connery (4) - 5 freq topiary (4) - 2 freq contrary (4) - 7 freq gonnay (4) - 1 freq nominals (4) - 1 freq longingly (4) - 1 freq nominal (4) - 1 freq coronary (4) - 1 freq monetary (4) - 1 freq seminary (4) - 1 freq onnay (4) - 1 freq nonin (4) - 1 freq imaginary (4) - 19 freq ordinar (4) - 74 freq byordinary (4) - 1 freq donnart (4) - 3 freq obituary (4) - 5 freq onboard (4) - 2 freq |
nonbinary (0) - 1 freq non-binary (2) - 3 freq binary (5) - 4 freq webinar (6) - 4 freq connery (6) - 5 freq nonin (6) - 1 freq nonsinse (6) - 1 freq centenary (6) - 8 freq non-dairy (6) - 1 freq ordinary (6) - 43 freq cannery (7) - 1 freq ninian' (7) - 1 freq ninians (7) - 3 freq numbing (7) - 1 freq nanny (7) - 7 freq bonnier (7) - 24 freq nebbin (7) - 2 freq nonsence (7) - 1 freq gonner (7) - 1 freq ninian (7) - 5 freq nebbery (7) - 1 freq innunner (7) - 2 freq anunner (7) - 1 freq webbiner (7) - 1 freq nonense (7) - 1 freq |
SoundEx code - N515 non-functioning - 1 freq non-binary - 3 freq numbness - 3 freq numbing - 1 freq ninepence - 1 freq non-paiyment - 1 freq nonbinary - 1 freq |
MetaPhone code - NNBNR non-binary - 3 freq nonbinary - 1 freq |
NONBINARY |
| Time to execute Levenshtein function - 0.203905 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.396338 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.027863 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.037750 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.000891 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. |