Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
near-shut (0) - 2 freq earshot (3) - 10 freq nearest (3) - 64 freq near-haun (3) - 5 freq near-white (3) - 1 freq near-seen (3) - 1 freq oer-het (4) - 1 freq naraeshun (4) - 1 freq neirish (4) - 2 freq neatest (4) - 1 freq neep-shed (4) - 1 freq ber-scud (4) - 1 freq neast (4) - 1 freq earlshaa (4) - 1 freq nerr-haun (4) - 1 freq near-on (4) - 2 freq near-aboot (4) - 1 freq perisht (4) - 2 freq neardest (4) - 1 freq hauf-shut (4) - 2 freq dearest (4) - 19 freq nearmaist (4) - 1 freq nourishit (4) - 1 freq nears (4) - 3 freq nearhan (4) - 28 freq |
near-shut (0) - 2 freq near-white (4) - 1 freq near-seen (5) - 1 freq nourishit (5) - 1 freq near-haun (5) - 5 freq earshot (5) - 10 freq nearest (5) - 64 freq nearmaist (6) - 1 freq neardest (6) - 1 freq hauf-shut (6) - 2 freq nor-aist (6) - 3 freq nor-east (6) - 21 freq naarest (6) - 1 freq wersht (6) - 2 freq near-aboot (6) - 1 freq perisht (6) - 2 freq neirish (6) - 2 freq neep-shed (6) - 1 freq naraeshun (6) - 1 freq oer-het (6) - 1 freq crashit (7) - 1 freq crusht (7) - 2 freq nourish (7) - 2 freq re-sit (7) - 1 freq grapeshot (7) - 2 freq |
SoundEx code - N623 nearest - 64 freq nor-east - 21 freq narrest - 6 freq nurst - 2 freq nearesthaund - 1 freq nor'easter - 1 freq norside - 1 freq nourishit - 1 freq nursed - 5 freq narkit - 1 freq nyirgit - 2 freq nor'west - 1 freq nouriced - 1 freq near-shut - 2 freq nor'aester - 2 freq noreaster - 1 freq nor-wastawa - 1 freq naarest - 1 freq nor-aist - 3 freq nourished - 1 freq nor-wast - 2 freq norwasterly - 1 freq nor-wasterd - 1 freq narcotiks - 1 freq nor-easters - 2 freq narked - 1 freq nor-westerly - 1 freq nursit - 1 freq naurest - 1 freq naerestforthewicked - 1 freq noreast - 2 freq nareystoepoker - 1 freq nursiedear - 1 freq |
MetaPhone code - NRXT nourishit - 1 freq near-shut - 2 freq nourished - 1 freq |
NEAR-SHUT |
Time to execute Levenshtein function - 0.201082 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.384605 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.028353 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.037012 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.000826 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. |