none2noIn 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.noneCapelletti M.; Tamburini F.Capelletti M.; Tamburini F
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
A type of ‘non-traditional constituents’ motivates an extended class of Combinatory Categorial Gramm...
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Sh...
none2noIn this paper we investigate the use of polymorphic categorial grammars as a model for parsi...
none2noIn this paper we investigate the use of polymorphic categorial grammars as a model for parsi...
Abstract. In this paper we investigate the use of polymorphic categorial grammars as a model for par...
We investigate the use of polymorphic categorial grammars as a model for parsing natural language. W...
This book is a study of the logical and computational properties of structure-preserving categorial ...
In this paper we present a scheme to extend a recognition algorithm for Context-Free Gram- mars (CFG...
This dissertation investigates which grammar formalism to use for representing the structure of natu...
This dissertation investigates which grammar formalism to use for representing the structure of natu...
In this thesis we discuss four formalisms, that lie between context-free grammars (KNG) and context-...
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can ha...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
A type of ‘non-traditional constituents’ motivates an extended class of Combinatory Categorial Gramm...
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Sh...
none2noIn this paper we investigate the use of polymorphic categorial grammars as a model for parsi...
none2noIn this paper we investigate the use of polymorphic categorial grammars as a model for parsi...
Abstract. In this paper we investigate the use of polymorphic categorial grammars as a model for par...
We investigate the use of polymorphic categorial grammars as a model for parsing natural language. W...
This book is a study of the logical and computational properties of structure-preserving categorial ...
In this paper we present a scheme to extend a recognition algorithm for Context-Free Gram- mars (CFG...
This dissertation investigates which grammar formalism to use for representing the structure of natu...
This dissertation investigates which grammar formalism to use for representing the structure of natu...
In this thesis we discuss four formalisms, that lie between context-free grammars (KNG) and context-...
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can ha...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
A type of ‘non-traditional constituents’ motivates an extended class of Combinatory Categorial Gramm...
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Sh...
Add to ORKG