LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Pregroups: Models and Grammars
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Fundamenta Informaticae
k-valued non-associative Lambek categorial grammars are not learnable from strings
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Efficiency of Pregroups and the French Noun Phrase
Journal of Logic, Language and Information
From word to sentence: a pregroup analysis of the object pronoun who(m)
Journal of Logic, Language and Information
Commutation-augmented pregroup grammars and push-down automata with cancellation
Information and Computation
Optional and Iterated Types for Pregroup Grammars
Language and Automata Theory and Applications
Exploring Feature Agreement in French with Parallel Pregroup Computations
Journal of Logic, Language and Information
A modular and parameterized presentation of pregroup calculus
Information and Computation
Fully lexicalized pregroup grammars
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Pregroup calculus as a logic functor
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Generalized categorial dependency grammars
Pillars of computer science
Mildly context-sensitive languages via buffer augmented pregroup grammars
Time for verification
A savateev-style parsing algorithm for pregroup grammars
FG'09 Proceedings of the 14th international conference on Formal grammar
Clitic movement in pregroup grammar: a cross-linguistic approach
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
On categorial grammars as logical information systems
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Pregroup grammars with letter promotions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Agreement and cliticization in italian: a pregroup analysis
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Fundamenta Informaticae
Pregroup grammars with letter promotions: Complexity and context-freeness
Journal of Computer and System Sciences
Studia Logica
| Hi-index | 0.00 |
Lambek [14] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pre-groups and study grammars based on the calculus of free pregroups. We prove that these grammars are equivalent to context-free grammars. We also discuss the relation of pregroups to the Lambek calculus.