Interfacing Constraint-Based Grammars and Generation Algorithms

Details Interfacing Constraint-Based Grammars and Generation Algorithms Interfacing Constraint-Based Grammars and Generation Algorithms

2000-08-07

arxiv.org/abs/cs/0008003v1

Proc. Workshop on Analysis for Generation, 1st International Natural Language Generation Conference, Mitzpe Ramon, Israel, Jun

Computer Science

Computation and Language

8 pages, uses colacl.sty

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Interfacing Constraint-Based Grammars and Generation Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interfacing Constraint-Based Grammars and Generation Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interfacing Constraint-Based Grammars and Generation Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507326