A Finite-State Morphological Processor For Spanish
暂无分享,去创建一个
[1] Jorge E. Mezei,et al. On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..
[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[3] Kenneth Ward Church,et al. Complexity, Two-Level Morphology and Finnish , 1988, COLING.
[4] Evelyne Tzoukermann,et al. The Application of a Morphological Analyzer to On-Line French Dictionaries , 1988 .
[5] Kimmo Koskenniemi,et al. A General Computational Model for Word-Form Recognition and Production , 1984 .
[6] Kimmo Koskenniemi,et al. A Compiler for Two-level Phonological Rules , 1987 .
[7] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[8] Danielle Corbin. Morphologie dérivationnelle et structuration du lexique , 1987 .
[9] Marcel Paul Schützenberger,et al. A Remark on Finite Transducers , 1961, Inf. Control..
[10] Joan Feigenbaum,et al. Cryptographic Protection of Databases and Software , 1989, Distributed Computing And Cryptography.