TAILIEUCHUNG - Báo cáo khoa học: "Categorial grammar,modalities and algebraic semantics"

This paper contributes to the theory of substructural logics .that are of interest to categorial grammarians. Combining semantic ideas of Hepple [1990] and Morrill [1990], proof-theoretic ideas of Venema [1993b; 1993a] and the theory of equational specifications, a class of resource-preserving logics is defined, for which decidability and completeness theorems are established. | Categorial grammar modalities and algebraic semantics Koen Versmissen Onderzoeksinstituut voor Taal en Spraak Universiteit Utrecht Trans 10 3512 JK Utrecht Netherlands Abstract This paper contributes to the theory of substructural logics that are of interest to categorial grammarians. Combining semantic ideas of Hepple 1990 and Morrill 1990 proof-theoretic ideas of Venema 1993b 1993a and the theory of equational specifications a class of resource-preserving logics is defined for which decidability and completeness theorems are established. 1 Introduction The last decade has seen a keen revival of investigations into the suitability of using categorial grammars as theories of natural language syntax and semantics. Initially this research was for the larger part confined to the classical categorial calculi of Aj-dukiewicz 1935 and Bar-Hillel 1953 and in particular the Lambek calculus L Lambek 1958 Moort-gat 1988 and some of its close relatives. Although it turned out to be easily applicable to fairly large sets of linguistic data one couldn t realistically expect the Lambek calculus to be able to account for all aspects of grammar. The reason for this is the diversity of the constructions found in natural language. The Lambek calculus is good at reflecting surface phrase structure but runs into problems when other linguistic phenomena are to be described. Consequently recent work in categorial grammar has shown a trend towards diversification of the ways in which the linguistic algebra is structured with an accompanying ramification of proof theory. One of the main innovations of the past few years has been the introduction of unary type connectives usually termed modalities that are used to reflect certain special features linguistic entities may possess. This strand of research originates with Morrill 1990 who adds to L a unary connective with the following proof rules r T nr I-A ______________ r OB r F A Q art- DA or here denotes

• Báo cáo khoa học
• Categorial grammar
• modalities and algebraic semantics
• Koen Versmissen
• scientific reports
• model language
• process natural language
• Accurate Context Free Parsing
• Combinatory Categorial Grammar
• Timothy A
• D
• Fowler and Gerald Penn
• báo cáo khoa học
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• Constraint Based Categorial Grammar
• Gosse Bouma
• long Papers
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Efficient Normal Form Parsing
• Jason Eisner
• Generative Models
• Statistical Parsing
• EFFICIENT INCREMENTAL PROCESSING
• Mark Hepple
• A DEFINITE CLAUSE
• VERSION OF CATEGORIAL GRAMMAR
• Remo Pareschi
• ZERO MORPHEMES
• UNIFICATION BASED COMBINATORY
• Multi Modal Combinatory
• Jason Baldridge
• A Note on Categorial Grammar
• Disharmony
• Permutation
• EFFICIENT PROCESSING
• FLEXIBLE CATEGORIAL GRAMMAR
• AN ALGORITHM FOR GENERATION
• UNIFICATION CATEGORIAL GRAMMAR
• Jonathan Calder
• Prediction in Chart Parsing Algorithms
• Categorial Unification Grammar
• PROOF FIGURES
• STRUCTURAL OPERATORS
• Tuples
• Discontinuity
• Gapping in Categorial Grammar
• A Memory Based Approach
• Treatment of Serial Verb Construction
• Combinatory Categorial Gramma