tailieunhanh - Báo cáo khoa học: "A TRANSFER MODEL USING A TYPED FEATURE STRUCTURE REWRITING SYSTEM WITH INHERITANCE"

We propose a model for transfer in machine translation which uses a rewriting system for typed feature structures. The grammar definitions describe transfer relations which are applied on the input structure (a typed feaane structure) by the interpreter to produce all possible transfer pairs. The formalism is based on the semantics of typed feature structures as described in [AR-Kaci 84]. INTRODUCTION We propose a new model for transfer in machine translation of dialogues. The goal is twofold: to develop a linguistically-based theory for transfer, and to develop a computer formalism with which we can implement such a theory, and. | A TRANSFER MODEL USING A Typed Feature Structure Rewriting System with Inheritance Rémi Zajac ATR Interpreting Telephony Research Laboratories Sanpeidani Inuidani Seika-cho Soraku-gun Kyoto 619-02 Japan zajac atr-ln . ABSTRACT We propose a model for transfer in machine translation which uses a rewriting system for typed feature structures. The grammar definitions describe uansfer relations which are applied on the input structure a typed feature structure by the interpreter to produce all possible transfer pairs. The formalism is based on the semantics of typed feature structures as described in Ait-Kaci 84 . INTRODUCTION We propose a new model for transfer in machine ưanslation of dialogues. The goal is twofold to develop a linguistically-based theory for transfer and to develop a computer formalism with which we can implement such a theory and which can be integrated with a unification-based parser. The desired properties of the grammar are 1 to accept as input a feature structure 2 to produce as output a feature structure 3 to be reversible 4 to be as close as possible to current theories and formalisms used for linguistic description. From 1 and 2 we need a rewriting formalism where a rule takes a feature structure as input and gives a feature structure as output From 3 this formalism should be in the class of unificationbased formalisms such as PROLOG and there should be no distinction between input and output From 4 as the theoretical basis of grammar development in ATR is HPSG Pollard and Sag 1987 we want the formalism to be as close as possible to HPSG. To meet these requữements a rewriting system for typed feature structures based on the semantics of typed feature structures described in Ait-Kaci 84 has been implemented at ATR by Martin Emele and the author Emele and Zajac 89 . The type system has a lattice structure and inheritance is achieved through the rewriting mechanism. Type definitions are applied by the interpreter on the .

TỪ KHÓA LIÊN QUAN