论文信息 - Constraint Dependency Grammar and Its Weak Generative Capacity

Constraint Dependency Grammar and Its Weak Generative Capacity

Summary In order to represent a combinatorial number of syntactically ambiguous parse trees efficiently, we have developed a grammatical theory called constraint dependency grammar. In this paper, the formal definition of constraint dependency grammar and its weak generative capacity are discussed. We show that the weak generative capacity of constraint dependency grammars with arity = 2, degree = 2 is strictly greater than that of context-free grammars.

Hiroshi Maruyama

[1] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] EarleyJay. An efficient context-free parsing algorithm , 1970 .

[4] D. G. Hays. Dependency Theory: A Formalism and Some Observations , 1964 .

[5] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.

[6] Masaru Tomita,et al. An Efficient Augmented-Context-Free Parsing Algorithm , 1987, CL.

[7] Robert C. Berwick,et al. Parsing with Assertion Sets and Information Monotonicity , 1985, IJCAI.

[8] Jungyun Seo,et al. Syntactic Graphs: A Representation for the Union of All Ambiguous Parse Trees , 1989, Comput. Linguistics.

[9] Hiroshi Maruyama,et al. Structural Disambiguation With Constraint Propagation , 1990, ACL.

[10] David L. Waltz,et al. Understanding Line drawings of Scenes with Shadows , 1975 .

[11] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[12] David A. Wroblewski,et al. Ambiguity Procrastination , 1987, AAAI.

[13] Hiroshi Maruyama. An Interactive Japanese Parser for Machine Translation , 1990, COLING.

[14] Kenneth Ward Church,et al. Coping with Syntactic Ambiguity or How to Put the Block in the Box on the Table , 1982, CL.