Automated Lossless Hyper-Minimization for Morphological Analyzers
暂无分享,去创建一个
[1] Kenneth R. Beesley. Constraining Separated Morphotactic Dependencies in Finite-State Grammars , 1998 .
[2] Jeffrey D. Ullman,et al. Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.
[3] Andreas Maletti,et al. Optimal Hyper-Minimization , 2011, Int. J. Found. Comput. Sci..
[4] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .
[5] Viliam Geffert,et al. Hyper-minimizing minimized deterministic finite state automata , 2009, RAIRO Theor. Informatics Appl..
[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[7] Tommi A. Pirinen,et al. Heuristic Hyper-minimization of Finite State Lexicons , 2014, LREC.
[8] Lauri Karttunen,et al. Finite State Morphology , 2003, CSLI Studies in Computational Linguistics.
[9] Tommi A. Pirinen,et al. HFST Tools for Morphology - An Efficient Open-Source Package for Construction of Morphological Analyzers , 2009, SFCM.
[10] Tao Jiang,et al. Minimal NFA Problems are Hard , 1991, SIAM J. Comput..
[11] Tommi A. Pirinen,et al. HFST - Framework for Compiling and Applying Morphologies , 2011, SFCM.