Đang chuẩn bị liên kết để tải về tài liệu:
Báo cáo khoa học: "ENGLISH GENERATOR FOR A CASE-LABELLED DEPENDENCY REPRESENING"

The paper describes a progrmn which has been constructed to produce English strings from a case-labellea depenaency representation. The program uses an especially single and uniform control structure with a well defined separation of the different knowledge sources used during ge~,eration. Furthermore, the majority of t/le syst~n's knowledge is expressed in a declarative form, so in priciple the generator 's knowledge bases could be used for purposes other than gex,eration. | AN ENGLISH GENERATOR FOR A CASE-LABELLED DEPENDENCY REPRESENTATION John Irving Tait Acorn Computers Ltd. Fulbourn Road Cherry Hinton Cambridge CB1 4JN u. K. Abstract The paper describes a program which has been constructed to produce English strings from a case-labelled dependency representation. The program uses an especially simple and uniform control structure with a well defined separation of the different knowledge sources used during generation. Furthermore the majority of tlie system s knowledge is expressed in a declarative form so in priciple the generator s knowledge bases could be used for purposes other than generation. The generator uses a two-pass control structure the first translating from the semantically orientated case-labelled dependency structures into surface syntactic trees and the second translating from these trees into English strings. The generator is very flexible it can be run in such a way as to produce all the possible syntactically legitimate variations on a given utterance and has built in facilities to do some synonym substitution. It has been used in a number of application domains notably as a part of a free text retrieval system and as part of a natural language front end to a relational database system. 1. Introduction This paper describes a program which has been constructed to translate iron Boguraev s case-labelled dependency representations Boguraev 1979 see also Boguraev and sparck Jones 1982 to English strings. Although the principles on which the program lias been constructed are primarily a new mix of established ideas the generator incorporates a number of novel features. In particular it combines an especially simple and uniform control structure with a well defined separation of tile different knowledge sources used during generation. It operates in two passes the first translating from the semantically orientated case-labelled dependency structures into surface syntactic trees and the second translating from these .