Adjuncts and the Processing of Lexical Rules
| dc.creator | van Noord, Gertjan | |
| dc.creator | Bouma, Gosse | |
| dc.date | 1994-04-28 | |
| dc.date | 1994-05-01 | |
| dc.date.accessioned | 2026-07-07T08:58:34Z | |
| dc.date.available | 2026-07-07T08:58:34Z | |
| dc.description | The standard HPSG analysis of Germanic verb clusters can not explain the observed narrow-scope 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' techniques from constraint-logic programming can be used to process such lexical rules. | |
| dc.description | 8 pages (a4wide), to be published in Coling-94 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9404011 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9404011 | |
| dc.identifier | Proceedings of Coling 1994 Kyoto | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/147377 | |
| dc.subject | Computation and Language | |
| dc.title | Adjuncts and the Processing of Lexical Rules | |
| dc.type | text |