论文信息 - A Bottom-up Generation for Principle-based Grammars Using Constraint Propagation

A Bottom-up Generation for Principle-based Grammars Using Constraint Propagation

A bottom-up generation algorithm for principle-based grammars is proposed. Bottom-up generation has (1) an inefficiency because of a high degree of nondeterminism, (2) a limitation caused by inability to process logical forms produced by grammar rules, and (3) an identity semantic problem. This paper describes a solution to these problems and implementation issues for the algorithm using a constraint logic programming language.

Masato Ishizaki | M. Ishizaki

[1] Kôiti Hasida,et al. JPSG Parser on Constraint Logic Programming , 1989, EACL.

[2] Ivan A. Sag,et al. Information-based syntax and semantics , 1987 .

[3] Gertjan van Noord,et al. A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms , 1989, ACL.

[4] Douglas E. Appelt,et al. Bidirectional Grammars and the Design of Natural Language Generation Systems , 1987, TINLAP.

[5] Kôiti Hasida,et al. Dependency Propagation: A Unified Theory of Sentence Comprehension and Generation , 1987, IJCAI.

[6] Takao Gunji,et al. Japanese Phrase Structure Grammar , 1987 .

[7] M. Dincbas. Constraints, logic programming and deductive databases , 1988 .

[8] Henk Zeevat,et al. An Algorithm for Generation in Unification Categorial Grammar , 1989, EACL.

[9] Ivan A. Sag,et al. Information-Based Syntax and Semantics: Volume 1, Fundamentals , 1987 .

[10] Jerry R. Hobbs. Ontological Promiscuity , 1985, ACL.

[11] Stuart M. Shieber,et al. A Uniform Architecture for Parsing and Generation , 1988, COLING.

[12] Jürgen Wedekind. Generation as structure driven derivation , 1988, COLING.