Effective search space reduction for spell correction using character neural embeddings
暂无分享,去创建一个
[1] Jeffrey Dean,et al. Efficient Estimation of Word Representations in Vector Space , 2013, ICLR.
[2] Eibe Frank,et al. An Empirical Comparison of Exact Nearest Neighbour Algorithms , 2007, PKDD.
[3] Jeffrey Dean,et al. Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.
[4] Gregory V. Bard,et al. Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric , 2007, ACSW.
[5] Trevor Darrell,et al. New Algorithms for Efficient High-Dimensional Nonparametric Classification , 2006 .
[6] Mans Hulden,et al. Fast approximate string matching with finite automata , 2009 .
[7] Stephen M. Omohundro,et al. Five Balltree Construction Algorithms , 2009 .
[8] Jennifer Pedler,et al. A Large List of Confusion Sets for Spellchecking Assessed Against a Corpus of Real-word Errors , 2010, LREC.
[9] Fred J. Damerau,et al. A technique for computer detection and correction of spelling errors , 1964, CACM.
[10] Gaël Varoquaux,et al. Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..
[11] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[12] Marcos Zampieri,et al. Effective Spell Checking Methods Using Clustering Algorithms , 2013, RANLP.