An Efficient LR Parser Generator for Tree Adjoining Grammars
暂无分享,去创建一个
[1] Stuart M. Shieber,et al. Sentence Disambiguation by a Shift-Reduce Parsing Technique , 1983, ACL.
[2] Aravind K. Joshi,et al. Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.
[3] Aravind K. Joshi,et al. Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..
[4] Masaru Tomita,et al. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .
[5] Mark-Jan Nederhof,et al. An Alternative LR Algorithm for TAGs , 1998, COLING-ACL.
[6] Masaru Tomita,et al. Efficient parsing for natural language , 1985 .
[7] K. Vijay-Shanker,et al. Deterministic Left to Right Parsing of Tree Adjoining Languages , 1990, ACL.
[8] Carlos A. Prolo,et al. Fast LR parsing Using Rich (Tree Adjoining) Grammars , 2002, EMNLP.
[9] Ted Briscoe,et al. Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars , 1993, CL.
[10] Mark Johnson,et al. Variations on incremental interpretation , 1993, Journal of Psycholinguistic Research.
[11] Anne Abeillé,et al. A Lexicalized Tree Adjoining Grammar for English , 1990 .
[12] Richard C. Waters,et al. Tree Insertion Grammar: A Cubic-Time, Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced , 1995, CL.
[13] Aravind K. Joshi,et al. Mathematical and computational aspects of lexicalized grammars , 1990 .
[14] E. N. Wrigley,et al. GLR Parsing With Probability , 1991 .
[15] Fernando C. N. Pereira. Natural language parsing: A new characterization of attachment preferences , 1985 .
[16] Paola Merlo,et al. Parsing with principles and classes of information , 1996 .
[17] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..
[18] Saul Corn,et al. Explicit Definitions and Linguistic Dominoes , 1967 .
[19] Ann Bies,et al. The Penn Treebank: Annotating Predicate Argument Structure , 1994, HLT.