Syntactic preferences for robust parsing with semantic preferences

Authors:
Jin Wang
Affiliations:
New Mexico State University, Las Cruces, NM
Venue:
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Year:
1992

Citing 7
Cited 1

Integrated processing produces robust understanding

Computational Linguistics
Xtra: the design and implementation of a fully automatic machine translation system

Xtra: the design and implementation of a fully automatic machine translation system
Lexical semantics and preference semantics analysis

Lexical semantics and preference semantics analysis
Relaxation techniques for parsing grammatically III-formed input in Natural Language Understanding Systems

Computational Linguistics
Recovery strategies for parsing extragrammatical language

Computational Linguistics - Special issue on ill-formed input
Meta-rules as a basis for processing ill-formed input

Computational Linguistics - Special issue on ill-formed input
Preference semantics, ill-formedness, and metaphor

Computational Linguistics - Special issue on ill-formed input

PATI: An Approach for Identifying and Resolving Ambiguities

PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using constraints in robust parsing seems to have what we call "robust parsing paradox". Preference Semantics and Connectionism both offered a promising approach to this problem. However, Preference Semantics has not addressed the problem of how to make full use of syntactic constraints, and Connectionism has some inherent difficulties of its own which prevent it producing a practical system. In this paper we are proposing a method to add syntactic preferences to the Preference Semantics paradigm while maintaining its fundamental philosophy. It will be shown that syntactic preferences can be coded as a set of weights associated with the set of symbolically manipulatable rules of a new grammar formalism. The syntactic preferences such coded can be easily used to compute with semantic preferences. With the help of some techniques borrowed from Connectionism, these weights can be adjusted through training.