Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Computational Linguistics
A computational treatment of lexical rules in HPSG as covariation in lexical entries
Computational Linguistics
On building a more efficient grammar by exploiting types
Natural Language Engineering
Robust grammatical analysis for spoken dialogue systems
Natural Language Engineering
Towards an account of extraposition in HPSG
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Parsing ambiguous structures using controlled disjunctions and unary quasi-trees
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Applying lexical rules under subsumption
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Reversible delayed lexical choice in a bidirectional framework
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
The standard HPSG analysis of germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters.We present an extension of the HPSG analysis that accounts for the systematic ambiguity of the scope of adjuncts in verb cluster constructions, by treating adjuncts as members of the subcat list. The extension uses powerful recursive lexical rules, implemented as complex constraints. We show how 'delayed evaluation' techiniques from constraint-logic programming can be used to process such lexical rules.