International audiencePregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup grammar that uses a tabular approach based on majority partial composition
AbstractThe concept of pregroup was introduced by Lambek for natural language analysis, with a close...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
The paper describes a parser for Categorial Grammar which provides fully word by word incremental in...
International audiencePregroup grammars are a mathematical formalism in the spirit of categorial gra...
International audiencePregroup grammars are a mathematical formalism in the spirit of categorial gra...
International audiencePregroup grammars are a context-free grammar formalism introduced as a simplif...
Abstract. The parsing algorithm for pregroup grammars presented here exploits regularities of types ...
The parsing algorithm for pregroup grammars presented here exploits regularities of types of a pregr...
International audiencePregroup grammars are context-free lexicalized grammars based upon free pregro...
Parsing of Arabic phrases is a crucial requirement for many applications such as question answering ...
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and...
International audienceThis paper investigates the learnability by positive examples in the sense of ...
Wydział Matematyki i Informatyki: Zakład Teorii ObliczeńW pracy rozważamy zagadnienia algorytmiczne ...
Pregroups and the French noun phrase We study mathematical and algorithmic properties of Lambek’s pr...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
AbstractThe concept of pregroup was introduced by Lambek for natural language analysis, with a close...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
The paper describes a parser for Categorial Grammar which provides fully word by word incremental in...
International audiencePregroup grammars are a mathematical formalism in the spirit of categorial gra...
International audiencePregroup grammars are a mathematical formalism in the spirit of categorial gra...
International audiencePregroup grammars are a context-free grammar formalism introduced as a simplif...
Abstract. The parsing algorithm for pregroup grammars presented here exploits regularities of types ...
The parsing algorithm for pregroup grammars presented here exploits regularities of types of a pregr...
International audiencePregroup grammars are context-free lexicalized grammars based upon free pregro...
Parsing of Arabic phrases is a crucial requirement for many applications such as question answering ...
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and...
International audienceThis paper investigates the learnability by positive examples in the sense of ...
Wydział Matematyki i Informatyki: Zakład Teorii ObliczeńW pracy rozważamy zagadnienia algorytmiczne ...
Pregroups and the French noun phrase We study mathematical and algorithmic properties of Lambek’s pr...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
AbstractThe concept of pregroup was introduced by Lambek for natural language analysis, with a close...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
The paper describes a parser for Categorial Grammar which provides fully word by word incremental in...
View in ORKG