Type grammars as pregroups
Type grammars are usually based on the notion of a residuated monoid. In this article the author presents an alternative account of type grammars in which the notion of a pregroup is used instead. Starting from a partially ordered set \(A_{\leq }\) of basic types, simple and compounds types are constructed, the latter being strings of simple types. The lexicon of a natural language like English is built by assigning a compound type to its words and morphems. A string of words of type \(z\) is a sentence (type \(s\)) if \(z\leq s\). The small fragment of English defined in section 2 is applied to various grammatical constructions like negation and questions in the following sections. In sections 9 and 10 it is shown that the pregroup used for the English fragment cannot be taken as being freely generated by the set of basic types since in addition so-called reduction rules have to be introduced that do not respect the underlying partial order on the basic types. The grammar is therefore not entirely contained in the lexicon. As a result, the grammatical rules are not implicitly given in the lexicon.
- Pregroups and natural language processing
- Toward discourse representation via pregroup grammars
- From word to sentence: a pregroup analysis of the object pronoun \textit{who(m)}
- Pregroup grammars and Chomsky's earliest examples
- Pregroup grammars with letter promotions: complexity and context-freeness
- Lattice-ordered pregroups are semi-distributive
- Type logics and pregroups
- Parsing pregroup grammars and Lambek calculus using partial composition
- Learnability of pregroup grammars
- Applying pregroups to Italian statements and questions
- On the logic of -pregroups
- scientific article; zbMATH DE number 1341534 (Why is no real title available?)
- scientific article; zbMATH DE number 1953885 (Why is no real title available?)
- Galois connections in categorial type logic
- DisCoPy: monoidal categories in Python
- Quantum Mathematics in Artificial Intelligence
- Semantic unification. A sheaf theoretic approach to natural language
- Italian clitic patterns in pregroup grammar: state of the art
- A computational algebraic analysis of Hindi syntax
- Sentence entailment in compositional distributional semantics
- Functorial semantics for relational theories
- A computational algebraic approach to Latin grammar
This page was built for publication: Type grammars as pregroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949346)
