Two-level, Many-Paths Generation
| dc.creator | Knight, Kevin | |
| dc.creator | Hatzivassiloglou, Vasileios | |
| dc.date | 1995-06-10 | |
| dc.date.accessioned | 2026-07-07T09:09:55Z | |
| dc.date.available | 2026-07-07T09:09:55Z | |
| dc.description | Large-scale natural language generation requires the integration of vast amounts of knowledge: lexical, grammatical, and conceptual. A robust generator must be able to operate well even when pieces of knowledge are missing. It must also be robust against incomplete or inaccurate inputs. To attack these problems, we have built a hybrid generator, in which gaps in symbolic knowledge are filled by statistical methods. We describe algorithms and show experimental results. We also discuss how the hybrid generation model can be used to simplify current generators and enhance their portability, even when perfect knowledge is in principle obtainable. | |
| dc.description | 9 pages, Compressed and uuencoded postscript. To appear: ACL-95 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9506010 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9506010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151205 | |
| dc.subject | Computation and Language | |
| dc.title | Two-level, Many-Paths Generation | |
| dc.type | text |