Loading...
Please wait, while we are loading the content...
Similar Documents
Bidirectional C art Generation Natural Language xts
| Content Provider | Semantic Scholar |
|---|---|
| Author | Masahiko Haruno O. Dent, Yasuharu Matsumoto, Fuji Nagao, Makoto |
| Copyright Year | 1993 |
| Abstract | This paper presents Bidirectional Chart Generation (BCG) algorithm as an uniform control mechanism for sentence generation and text planning. It is an extension of Semantic Hea.d Driven Generation algorithm [Shieber e2 al., 19891 in that recomputation of partial structures and backtracking are avoided by using a chart ta.ble. These properties enable to handle a large scale grammar including text planning and to implement the algorithm in parallel programming languages. Other merits of the algorithm are to deal with multiple contexts and to keep every partial structure in the chart. It becomes easier for the generator to find a recovery strategy when user cannot understand the generated text. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.aaai.org/Papers/AAAI/1993/AAAI93-053.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
