Parsing/Theorem-Proving for Logical Grammar CatLog3

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logical Grammar

The canonical linguistic process is the cycle of the speech-circuit [Saussure, 1915]. A speaker expresses a psychological idea by means of a physiological articulation. The signal is transmitted through the medium by a physical process incident on a hearer who from the consequent physiological impression recovers the psychological idea. The hearer may then reply, swapping the roles of speaker a...

متن کامل

Compton's Method for Proving Logical Limit Laws

Developments in the study of logical limit laws for both labelled and unlabelled structures, based on the methods of Compton (1987/1989), are surveyed, and a sandwich theorem is proved for multiplicative systems.

متن کامل

Grammar and Logical Types

This paper represents categorial grammar as an implicational type theory in the spirit of Girard's linear logic, and illustrates linguistic applications of a range of type-constructors over and above implication. The type theoretic perspective is concerned with a correspondence between the logic of types, and computational operations over the objects inhabiting types. In linguistic applications...

متن کامل

Implementing Tabular Deduction for Multimodal Logical Grammar

The paper proposes a method for tabular deduction for multimodal logical grammar, extending a method for linear logic presented in (Hepple, 1996; Hepple, 1998). Tabular deduction for multimodal logical grammar avoids redundant computation like chart parsing does for CFGs. The method discussed here enables one to process any kind of multimodal logical grammar fragment. An implementation of the m...

متن کامل

Polymorphism in English Logical Grammar

The quantifiers and connectives of English present difficulties to standard (Church-style) type theory in linguistics in that they can apply systematically to objects of different form. This paper sketches solutions to this problem with some extensions to the simply typed lambda calculus, including Damas-Milner types and System F or the polymorphic lambda calculus. The goal is to maintain the “...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logic, Language and Information

سال: 2019

ISSN: 0925-8531,1572-9583

DOI: 10.1007/s10849-018-09277-w