tailieunhanh - Báo cáo khoa học: "Type-Driven Semantic Interpretation of f-Structures"

The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a language and representations of their underlying meanings. This approach works well when the structural discrepancies between form and meaning representations are finitely bounded, but there are some phenomena in natural language, . adverbs in English, where this restriction does not hold. | Type-Driven Semantic Interpretation of f-Structures Jurgen Wedekind Institute for Natural Language Processing University of Stuttgart Azenbergstr. 12 D-7000 Stuttgart 1 FRG juergen@ Ronald M. Kaplan Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo Alto California 94304 USA Abstract The formal architecture of Lexical Functional Grammar offers a particular formal device the structural correspondence for modularizing the mapping between the surface forms of a language and representations of their underlying meanings. This approach works well when the structural discrepancies between form and meaning representations are finitely bounded but there are some phenomena in natural language . adverbs in English where this restriction does not hold. In this paper we describe rule-based type-driven interpretation algorithms which cover cases of such a structural misalignment by exploiting a new descriptive device the restriction operator . The algorithms are set up in such a way that recursive rules can be derived for the interpretation of adjunct sets within a codescription approach see Kaplan and Wedekind 1993 for details . 1 Introduction In Kaplan and Bresnan 1982 Lexical Functional Grammar LFG was introduced as a grammatical formalism that assigns to a sentence entities of two different levels of representation a c-structure representing information on the structure of the phrases of a sentence and an f-structure which represents its underlying predicate-argument structure. The structures are set in correspondence by a function from the c-structure nodes constituents into the substructures of the f-structure. The f-structure is identified with the smallest structure that satisfies the f-description a description of the f-structure which is built up by instantiation of the annotations of the context-free rules and projected off the c-structure by the correspondence mapping. This architecture was then extended by Kaplan

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã 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.