autocorrect
v1.2.0
Published
Find the best matching word using the first smallest Levenshtein distance
Readme
autocorrect 
Finds the best matching word using the first smallest Levenshtein distance.
Usage
Default options
var autocorrect = require('autocorrect')()
autocorrect('mbryo') // embryoCustom dictionary path
var path = '/usr/share/dict/words'
var autocorrect = require('autocorrect')({dictionary: path})
autocorrect('mbryo') // embryoCustom words
var words = ['word', 'weird', 'wired']
var autocorrect = require('autocorrect')({words: words})
autocorrect('wared') // wiredOptions
words- a list of words to use for matchingdictionary- path to dictionary file

