TAILIEUCHUNG - Báo cáo khoa học: "AUTOMATED INVERSION OF LOGIC GRAMMARS FOR GENERATION"

We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation process: a parser and a generator for this language. The centerpiece of the system is the inversion algorithm designed to compute the generator code from the parser's PROLOG code, using the collection of minimal sets of essential arguments (MSEA) for predicates. The system has been implemented to work with Definite Clause Grammars (DCG) and is a part of an English-Japanese machine translation project currently under development at NYU's Courant Institute. . | AUTOMATED INVERSION OF LOGIC GRAMMARS FOR GENERATION Tomek Strzalkowski and Ping Peng Courant Institute of Mathematical Sciences New York University 251 Mercer Street New York NY 10012 ABSTRACT We describe a system of reversible grammar in which given a logic-grammar specification of a natural language two efficient PROLOG programs are derived by an off-line compilation process a parser and a generator for this language. The centerpiece of the system is the inversion algorithm designed to compute the generator code from the parser s PROLOG code using the collection of minimal sets of essential arguments MSEA for predicates. The system has been implemented to work with Definite Clause Grammars DCG and is a part of an English-Japanese machine translation project currently under development at NYU s Courant Institute. INTRODUCTION The results reported in this paper are part of the ongoing research project to explore possibilities of an automated derivation of both an efficient parser and an efficient generator for natural language such as English or Japanese from a formal specification for this language. Thus given a grammar-like description of a language specifying both its syntax as well as semantics by which we mean a correspondence of well-formed expressions of natural language to expressions of a formal representation language we want to obtain by a fully automatic process two possibly different programs a parser and a generator. The parser will translate well-formed expression of the source language into expressions of the language of semantic representation such as regularized operator-argument forms or formulas in logic. The generator on the other hand will accept well-formed expressions of the semantic representation language and produce corresponding expressions in the source natural language. Among the arguments for adopting the bidirectional design in NLP the following are perhaps the most widely shared A bidirectional NLP system or a system whose inverse

TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.