JPSG parser on constraint logic programming

Authors:
Hirosi Tuda;Kôiti Hasida;Hidetosi Sirai
Affiliations:
University of Tokyo, Hongo, Bunkyo-ku Tokyo, Japan;Institute for New Generation Computer Technology (ICOT), Mita, Minato-ku Tokyo, Japan;Tamagawa University, Tamagawa gakuen, Machida-shi Tokyo, Japan
Venue:
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Year:
1989

Citing 2
Cited 6

The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Conditioned unification for natural language processing

COLING '86 Proceedings of the 11th coference on Computational linguistics

Constraint projection: an efficient treatment of disjunctive feature descriptions

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A constraint-based approach to linguistic performance

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Semantics of complex sentences in Japanese

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Syntactic constraints on relativization in Japanese

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
JAUNT: a constraint solver for disjunctive feature structures

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
A bottom-up generation for principle-based grammars using constraint propagation

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a constraint logic programming language cu-Prolog and introduces a simple Japanese parser based on Japanese Phrase Structure Grammar (JPSG) as a suitable application of cu-Prolog.cu-Prolog adopts constraint unification instead of the normal Prolog unification. In cu-Prolog, constraints in terms of user defined predicates can be directly added to the program clauses. Such a clause is called Constraint Added Horn Clause (CAHC). Unlike conventional CLP systems, cu-Prolog deals with constraints about symbolic or combinatorial objects. For natural language processing, such constraints are more important than those on numerical or boolean objects. In comparison with normal Prolog, cu-Prolog has more descriptive power, and is more declarative. It enables a natural implementation of JPSG and other unification based grammar formalisms.