tailieunhanh - Báo cáo khoa học: "A PROLOG IMPLEMENTATION OF LEXICAL LANGUAGE FUNCTIONAL PROCESSING GRAMMAR SYSTEM AS A BASE FOR A NATURAL"

We think the parts are of interest in their o~. The paper consists of three sections: (I) We give a detailed description of the PROLOG implementation of the parser which is based on the theory of lexical functional grammar (I/V.). The parser covers the fragment described in [1,94]. ., it is able to analyse constructions involving functional control and long distance dependencies. We will to show that - PROLOG provides an efficient tool for LFG-implementation: a phrase structure rule annotated with ftmctional schemata l i k e ~ M~ w~is ~^ be interpreted as, first, identifying the special grmr,m/tical. | A PROLOG IMPLEMENTATION OF LEXICAL FUNCTIONAL GRAMMAR AS A BASE FOR A NATURAL LANGUAGE PROCESSING SYSTEM Werner Frey and Uwe Reyle Department of Linguistics University of Stuttgart W-Germany 0. ABSTRACT The alm of this paper is to present parts of our system 2 which is to construct a database out of a narrative natural language text. Wfe think the parts are of interest in their own. The paper consists of three sections I We give a detailed description of the IROWG -implementation of the parser which is based on the theory of lexical functional granmar LFG . The parser covers the fragment described in 1 4 . . it is able to analyse constructions involving functional control and long distance dependencies. We will to show that - PROLOG provides an efficient tool for LEU-implementation a phrase structure rule annotated with functional schemata likeS to be interpreted as first identifying the special grammatical relation of subject position of any sentence analyzed by this clause to be the NP appearing in it and second as identifying all grammatical relations of the sentence with those of the VP. This universal interpretation of the LFG-metavariables T and J corresponds to the universal quantification of variables appearing in KOIDG-clauses. The procedural semantics of ĨR0L0G Is such that the instantiation of the variables in a clause is inherited from the Instantiation given by Its subgoals If they succeed. Thus there is no need for a separate component which solves the set of equations obtained by applying the LFG algorithm. -there is a canonical way of translating LFG into a IR0LŨG programs. II Ebr the semantic representation of texts we use the Discourse Representation Theory developped by Hans Kamp. At present the implementation Includes the fragment described in 4 . In addition it analyses different types of negation and certain equi- and raising-verbs. We postulate some requirements a senantic representation has to fulfill In order to be able to analyse whole

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.