Switch graphs for parsing type logical grammars

Authors:
Bob Carpenter;Glyn Morrill
Affiliations:
Alias-i, Brooklyn, NY;Universitat Politècnica de Catalunya, Barcelona
Venue:
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Year:
2005

Citing 2
Cited 2

Linear logic

Theoretical Computer Science
Incremental processing and acceptability

Computational Linguistics

Efficient parsing with the product-free Lambek calculus

COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
LC graphs for the Lambek calculus with product

MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.