Type Grammar Revisited

@inproceedings{Lambek1997TypeGR,
  title={Type Grammar Revisited},
  author={J. Lambek},
  booktitle={LACL},
  year={1997}
}
  • J. Lambek
  • Published in LACL 1997
  • Mathematics, Computer Science
A protogroup is an ordered monoid in which each element a has both a left proto-inverse al such that ala ≤ 1 and a right protoinverse ar such that aar ≤ 1. We explore the assignment of elements of a free protogroup to English words as an aid for checking which strings of words are well-formed sentences, though ultimately we may have to relax the requirement of freeness. By a pregroup we mean a protogroup which also satisfies 1 ≤ aal and 1 ≤ ara, rendering al a left adjoint and ar a right… Expand

Paper Mentions

Toward discourse representation via pregroup grammars
  • A. Preller
  • Computer Science, Mathematics
  • J. Log. Lang. Inf.
  • 2007
Toward Discourse Representation via Pregroup
Bidirectional Functional Semantics for Pregroup Grammars
Cyclic pregroups and natural language: a computational algebraic analysis
Type Grammars as Pregroups
Pregroup Grammars and Chomsky’s Earliest Examples
  • J. Lambek
  • Mathematics, Computer Science
  • J. Log. Lang. Inf.
  • 2008
Free compact 2-categories
  • A. Preller, J. Lambek
  • Computer Science, Mathematics
  • Mathematical Structures in Computer Science
  • 2007
Should Pregroup Grammars be Adorned with Additional Operations?
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Some lattice models of bilinear logic
The Mathematics of Sentence Structure
Lambek grammars are context free
  • M. Pentus
  • Mathematics, Computer Science
  • [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
Weakly distributive categories
Categorial Type Logics
  • M. Moortgat
  • Computer Science
  • Handbook of Logic and Language
  • 1997
Language in action
  • J. Benthem
  • Mathematics, Computer Science
  • J. Philos. Log.
  • 1991
Handbook of Logic and Language
...
1
2
3
...