Parsing with Finite-State Transducers
暂无分享,去创建一个
[1] Aravind K. Joshi,et al. Mathematical and computational aspects of lexicalized grammars , 1990 .
[2] Mehryar Mohri. Analyse et representation par automates de structures syntaxiques composees. Application aux completives , 1993 .
[3] M. Gross. The Construction of Local Grammars , 1997 .
[4] Lauri Karttunen,et al. Two-Level Morphology with Composition , 1992, COLING.
[5] Yves Schabes,et al. The Lexical Analysis of Natural Languages , 1997 .
[6] Christian Leclère,et al. La structure des phrases Simples en francais: Constructions Intransitives , 1979 .
[7] Emmanuel Roche,et al. Enhancing a large scale dictionary with a two-level system , 1993, EACL.
[8] J. V. Leeuwen. Rational Transductions for Phonetic Conversion and Phonology , 1997 .
[9] Maurice Gross,et al. Grammaire transformationnelle du français : syntaxe du verbe , 1968 .
[10] Yves Schabes,et al. Finite-State Approximation of Phrase-Structure Grammars , 1997 .
[11] Emmanuel Roche. Smaller Representations for Finite-State Transducers and Finite-State Automata , 1995, CPM.
[12] Emmanuel Roche. Analyse syntaxique transformationnelle du francais par transducteurs et lexique-grammaire , 1993 .
[13] Aravind K. Joshi,et al. Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..
[14] Maurice Gross,et al. Notes du cours de syntaxe , 1976 .
[15] Fernando Pereira,et al. Weighted Rational Transductions and their Application to Human Language Processing , 1994, HLT.