Implementing Tabular Deduction for Multimodal Logical Grammar

Robustness in Tabular Deduction for Multimodal Logical Grammar - Part 1

Resource Logics, Grammars, and Processing

The paper discusses work in progress on developing a tabular deduction method for multimodal logical grammar. The method is based on a compilation procedure, a single elimination rule for multiplicative and additive (t) binary operators, and two rules defining residuation for the unary modals i/ #i . The method aims to achieve for multimodal logical grammar what chart-based parsing does for CFG...

A Categorial Type Logic

In logical categorial grammar (Morrill 2011[22], Moot and Retoré 2012[10]) syntactic structures are categorial proofs and semantic structures are intuitionistic proofs, and the syntax-semantics interface comprises a homomorphism from syntactic proofs to semantic proofs. Thereby, logical categorial grammar embodies in a pure logical form the principles of compositionality, lexicalism, and parsin...

A Left Corner Parser for Tree Adjoining Grammars

Tabular parsers can be defined as deduction systems where formulas, called items, are sets of complete or incomplete constituents (Sikkel, 1997; Shieber, Schabes and Pereira, 1995). Formally, given an input string w = a1 . . . an with n ≥ 0 and a grammar G, a parser IP is a tuple (I,H,D) where I is a set of items, H is a set of hypothesis ([ai, i − 1, i] with 1 ≤ i ≤ n) that encodes the input s...

On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar

Cooper’s storage technique for scoping in situ operators has been employed in theoretical and computational grammars of natural language (NL) for over thirty years, but has been widely viewed as ad hoc and unprincipled. Recent work by Pollard within the framework of convergent grammar (CVG) took a step in the direction of clarifying the logical status of Cooper storage by encoding its rules wit...