Generation as Deduction on Labelled Proof Nets


In the framework of labelled proof nets the task of parsing in categorial grammar can be reduced to the problem of rst-order matching under theory. Here we shall show how to use the same method of labelled proof nets to reduce the task of generating to the problem of higher-order matching. 
DOI: 10.1007/BFb0052164


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics