In this paper 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 these grammars.
Capelletti M., Tamburini F. (2009). Parsing with Polymorphic Categorial Grammars. RESEARCH IN COMPUTING SCIENCE, 41, 87-98.
Parsing with Polymorphic Categorial Grammars
TAMBURINI, FABIO
2009
Abstract
In this paper 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 these grammars.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
