An English language question answering system for a large relational database
Communications of the ACM
An Introduction to Database Systems
An Introduction to Database Systems
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Responding intelligently to unparsable inputs
Computational Linguistics
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
Interpreting syntactically ill-formed sentences
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Analysis of conjunctions in a rule-based parser
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Generalized memory manipulating actions for parsing natural language
COLING '86 Proceedings of the 11th coference on Computational linguistics
Interpretation of noun phrases in intensional contexts
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
The assignment of grammatical relations in natural language processing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Weighted interaction of syntax and semantics in natural language analysis
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Representation and interpretation of determiners in natural language
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
In this paper we present a parser which al lows to make explicit the interconnections between syntax and semantics, to analyze the sentences in a quasi-deterministic fashion and, in many cases, to identify the roles of the various constituents even if the sentance is ill-formed. The main feature of the approach on which the parser is based consists in a two-level representation of the syntactic knowledge: a first set of rules emits hypotheses about the constituents of the sentence and their functional role and another set of rules verifies whether a hypothesis satisfies the constraints about the well-formedness of sentences. However, the application of the second set of rules is delayed until the semantic knowledge confirms the acceptability of the hypothesis. If the semantics reject it, a new hypothesis is obtained by applying a simple and relatively unexpensive "natural" modification; a set of these modifications is predefined and only when none of them is applicable a real backup is performed: in most cases this situation corresponds to a case where people would normally garden path.