We investigate the use of polymorphic categorial grammars as a model for parsing natural language. We will show that, despite the undecidability of the general model, a subclass of polymorphic categorial grammars, which we call linear, is mildly context-sensitive and we propose a polynomial parsing algorithm for them. An interesting aspect of the resulting system is the absence of spurious ambiguity.
Polymorphic Categorial Grammars: expressivity and computational properties / Capelletti M.; Tamburini F.. - STAMPA. - (2009), pp. 21-27. (Intervento presentato al convegno ESSLLI Workshop on Parsing with Categorial Grammars tenutosi a Bordeaux, France nel 20-24/7/2009).
Polymorphic Categorial Grammars: expressivity and computational properties
TAMBURINI, FABIO
2009
Abstract
We investigate the use of polymorphic categorial grammars as a model for parsing natural language. We will show that, despite the undecidability of the general model, a subclass of polymorphic categorial grammars, which we call linear, is mildly context-sensitive and we propose a polynomial parsing algorithm for them. An interesting aspect of the resulting system is the absence of spurious ambiguity.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
