Interfacing Constraint-Based Grammars and Generation Algorithms
| dc.creator | Busemann, Stephan | |
| dc.date | 2000-08-07 | |
| dc.date.accessioned | 2026-07-07T03:16:25Z | |
| dc.date.available | 2026-07-07T03:16:25Z | |
| dc.description | Constraint-based grammars can, in principle, serve as the major linguistic knowledge source for both parsing and generation. Surface generation starts from input semantics representations that may vary across grammars. For many declarative grammars, the concept of derivation implicitly built in is that of parsing. They may thus not be interpretable by a generation algorithm. We show that linguistically plausible semantic analyses can cause severe problems for semantic-head-driven approaches for generation (SHDG). We use SeReal, a variant of SHDG and the DISCO grammar of German as our source of examples. We propose a new, general approach that explicitly accounts for the interface between the grammar and the generation algorithm by adding a control-oriented layer to the linguistic knowledge base that reorganizes the semantics in a way suitable for generation. | |
| dc.description | 8 pages, uses colacl.sty | |
| dc.identifier | https://arxiv.org/abs/cs/0008003 | |
| dc.identifier | http://arxiv.org/abs/cs/0008003 | |
| dc.identifier | Proc. Workshop on Analysis for Generation, 1st International Natural Language Generation Conference, Mitzpe Ramon, Israel, June 12, 2000. pp. 14-21 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30351 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | Interfacing Constraint-Based Grammars and Generation Algorithms | |
| dc.type | text |