| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| near-enough (0) - 1 freq hard-enough (3) - 1 freq langenough (4) - 1 freq near-high (4) - 1 freq rear-enn (5) - 1 freq enough (5) - 911 freq near-aboot (5) - 1 freq near-shut (5) - 2 freq near-haun (5) - 5 freq near-low (5) - 1 freq €œenough (5) - 1 freq scarborough (5) - 1 freq near-on (5) - 2 freq near-front (5) - 1 freq 'enough (5) - 1 freq year-en (5) - 1 freq hearkent (6) - 2 freq deanbernhaugh (6) - 1 freq see-through (6) - 3 freq percentage (6) - 8 freq hearken (6) - 28 freq ravenous (6) - 2 freq nearaboot (6) - 3 freq neared (6) - 3 freq near-seen (6) - 1 freq |
near-enough (0) - 1 freq near-high (5) - 1 freq hard-enough (5) - 1 freq langenough (7) - 1 freq near-on (7) - 2 freq year-en (8) - 1 freq 'enough (8) - 1 freq fermanagh (8) - 10 freq €œenough (8) - 1 freq bernagh (8) - 1 freq an-ugh (8) - 1 freq rear-enn (8) - 1 freq near-aboot (8) - 1 freq near-shut (8) - 2 freq enough (8) - 911 freq near-low (8) - 1 freq near-haun (8) - 5 freq ne'er-endin (9) - 1 freq earrings (9) - 8 freq near-nyaakit (9) - 1 freq near-white (9) - 1 freq borough (9) - 1 freq learning (9) - 33 freq neerendin (9) - 1 freq bearetnh (9) - 1 freq |
SoundEx code - N652 norms - 5 freq norns - 7 freq nearmaist - 1 freq narrowing - 1 freq near-nyaakit - 1 freq neurons - 1 freq narrenschiff - 1 freq normous - 2 freq nairrowing - 1 freq nairns' - 1 freq near-enough - 1 freq near-incestuous - 1 freq neuromagnetic - 1 freq norriemacqueen - 1 freq |
MetaPhone code - NRNF near-enough - 1 freq |
NEAR-ENOUGH |
| Time to execute Levenshtein function - 0.216334 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.393580 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.028351 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.037727 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.000973 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. |