| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| netherbow (0) - 6 freq letterbox (3) - 6 freq nethertoon (3) - 2 freq nether (3) - 26 freq netherwood (3) - 7 freq tethert (4) - 3 freq neither (4) - 169 freq aither-or (4) - 1 freq neither'd (4) - 1 freq fether (4) - 23 freq rether (4) - 53 freq thenow (4) - 3 freq wether (4) - 2 freq jethro (4) - 2 freq gethered (4) - 8 freq throw (4) - 217 freq inthrow (4) - 1 freq letterboax (4) - 4 freq getherin (4) - 34 freq rethered (4) - 1 freq neether (4) - 7 freq peterson (4) - 2 freq nerrow (4) - 1 freq aether (4) - 1 freq heathercoo (4) - 1 freq |
netherbow (0) - 6 freq onthebaw (5) - 1 freq netherwood (5) - 7 freq inthrow (5) - 1 freq nether (5) - 26 freq nethertoon (5) - 2 freq neether's (6) - 1 freq nothers (6) - 1 freq nitherin (6) - 3 freq nithered (6) - 1 freq nithers (6) - 1 freq netbaw (6) - 1 freq thorow (6) - 1 freq enthrowe (6) - 1 freq anthroboi (6) - 1 freq netherdale (6) - 1 freq nithert (6) - 2 freq heathrow (6) - 2 freq neether (6) - 7 freq letterbox (6) - 6 freq asterbaw (6) - 8 freq naether (6) - 5 freq neither'd (6) - 1 freq neither (6) - 169 freq 'throw (6) - 1 freq |
SoundEx code - N361 netherbow - 6 freq naitherback - 1 freq natureprescriptions - 1 freq |
MetaPhone code - N0RB netherbow - 6 freq |
NETHERBOW |
| Time to execute Levenshtein function - 0.198176 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.432838 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.032728 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.037383 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. |