How to get preferred readings in natural language analysis

Authors:
Jun-ichi Tsujii;Yukiyoshi Mato;Yuoji Ikeda;Makoto Nagao
Affiliations:
Kyoto University, Kyoto, Japan;Kyoto University, Kyoto, Japan;Kyoto University, Kyoto, Japan;Kyoto University, Kyoto, Japan
Venue:
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Year:
1988

Citing 3
Cited 3

Semantic interpretation against ambiguity

Semantic interpretation against ambiguity
Analysis grammar of Japanese in the Mu-Project: a procedural approach to analysis grammar

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Language As a Cognitive Process: Syntax

Language As a Cognitive Process: Syntax

High-probability syntactic links

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
High-probability syntactic links

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
An agreement corrector for Russian

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a parsing program called KGW+p which is designed for integrating various sorts of knowledge to get most preferred structural descriptions of sentences. The system accepts not only a set of rules specifying constraints which any descriptions of sentences should satisfy, but also preferential rules which are utilized in selecting most preferred descriptions among possible ones. During the parsing process, the preferetial rules are utilized to select feasible parsing paths. Furthermore, KGW+p is complete in the sense that it can generate all possible structural descriptions of sentences it required. The descriptions are generated in a preferential order.