Switch Graphs for Parsing Type Logical Grammars
نویسندگان
چکیده
Parsing in type logical grammars amounts to theorem proving in a substructural logic. This paper takes the proof net presentation of Lambek’s associative calculus as a case study. It introduces switch graphs for online maintenance of the Danos-Regnier acyclicity condition on proof nets. Early detection of Danos-Regnier acyclicity violations supports early failure in shift-reduce parsers. Normalized switch graphs represent the combinatorial potential of a set of analyses derived from lexical and structural ambiguities. Packing these subanalyses and memoizing the results leads directly to a dynamic programming algorithm for Lambek grammars.
منابع مشابه
Using the Spoken Dutch Corpus for type-logical grammar induction
Abstract The dependency-based annotation format employed within the Spoken Dutch Corpus (CGN) project (van der Wouden et al., 2002) has been designed in such a way as to enable a transparent mapping to the derivational structures of current ‘lexicalized’ grammar formalisms. Through such translations, the CGN tree bank can be used to train and evaluate computational grammars within these framewo...
متن کاملParsing Corpus-Induced Type-Logical Grammars
Type-logical grammars which have been automatically extracted from linguistic corpora provide parsers for these grammars with a considerable challenge. The size of the lexicon and the combinatory possibilities of the lexical entries both call for rethinking of the traditional type-logical parsing strategies. We show how methods from statistical natural language processing can be incorporated in...
متن کاملChart Parsing Multimodal Grammars
The short note describes the chart parser for multimodal type-logical grammars which has been developed in conjunction with the type-logical treebank for French. The chart parser presents an incomplete but fast implementation of proof search for multimodal type-logical grammars using the"deductive parsing"framework. Proofs found can be transformed to natural deduction proofs.
متن کاملHybrid Type-Logical Grammars, First-Order Linear Logic and the Descriptive Inadequacy of Lambda Grammars
Hybrid type-logical grammars (Kubota & Levine 2012, Kubota & Levine 2013c, Kubota & Levine 2013a) are a relatively new framework in computational linguistics, which combines insights from the Lambek calculus (Lambek 1958) and lambda grammars (Oehrle 1994, Muskens 2001, Muskens 2003)— lambda grammars are also called, depending on the authors, abstract categorial grammars (de Groote 2001) and lin...
متن کاملInterfacing Sentential and Discourse TAG-based Grammars
Tree-Adjoining Grammars (TAG) have been used both for syntactic parsing, with sentential grammars, and for discourse parsing, with discourse grammars. But the modeling of discourse connectives (coordinate conjunctions, subordinate conjunctions , adverbs, etc.) in TAG-based formalisms for discourse differ from their modeling in sentential grammars. Because of this mismatch, an intermediate, not ...
متن کامل