Optional and Iterated Types for Pregroup Grammars

@inproceedings{Bchet2008OptionalAI,
  title={Optional and Iterated Types for Pregroup Grammars},
  author={Denis B{\'e}chet and Alexandre Ja. Dikovsky and Annie Foret and Emmanuelle Garel},
  booktitle={LATA},
  year={2008}
}
Pregroup grammars are a context-free grammar formalism which may be used to describe the syntax of natural languages. However, this formalism is not able to naturally define types corresponding to optional and iterated arguments such as optional complements of verbs or verbs' adverbial modifiers. This paper introduces two constructions that make up for this deficiency. 
Introduction of Option and Iteration into Pregroup Grammars
TLDR
Two constructions are introduced and formalized that make up for the inadequacy of context-free grammar formalism in terms of defining types of optional or iterated arguments.
A pregroup toolbox for parsing and building grammars of natural languages
TLDR
This paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approach based on majority partial composition.
PPQ : a pregroup parser using majority composition
TLDR
A parser based on pregroup grammar that uses a tabular approach based on majority partial composition and a polynomial parsing algorithm is presented.
On Harmonic CCG and Pregroup Grammars
This paper studies mappings between CCG and pregroup grammars, to allow a transfer of linguistic resources from one formalism to the other. We focus on mappings that preserve the binary structures,
NP-Completeness of Grammars Based Upon Products of Free Pregroups
  • Denis Béchet
  • Computer Science
    Categories and Types in Logic, Language, and Physics
  • 2014
TLDR
This article defines a particular grammar built on the product of three free pregroups that is used to encode any SAT problem as a membership problem in the language corresponding to the grammar.
Parsing with Categorial Grammars Workshop ESSLLI 2009
TLDR
A new method to perform lexical disambiguation of Interaction Grammars dealing with the order constraints on words is proposed and it is shown how this invariant can be computed statically from the grammar.
Two Models of Learning Iterated Dependencies
TLDR
Categorial Dependency Grammars satisfying a reasonable condition on iterated (i.e., repeatable and optional) dependencies are shown to be incrementally learnable in the limit.
Incremental learning of iterated dependencies
TLDR
It is shown that the CDG satisfying reasonable and linguistically valid conditions on the iterated dependencies are incrementally learnable in the limit from dependency structures.
On the Logic of Expansion in Natural Language
TLDR
It is proved soundness and completeness of displacement calculus with additives and this modality, for phase semantics, has as a corollary semantic Cut-elimination.
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)
TLDR
Two Papers on FC Disjunction in State-Based Semantics and the Foundations of State-based Semantics show that the relationship between FC disjunction and semantics and state-based semantics is driven by different underlying mechanisms.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
Introduction of Option and Iteration into Pregroup Grammars
TLDR
Two constructions are introduced and formalized that make up for the inadequacy of context-free grammar formalism in terms of defining types of optional or iterated arguments.
Lambek Grammars Based on Pregroups
TLDR
This paper proves some new theorems on pre-groups and study grammars based on the calculus of free pregroups that are equivalent to context-free Grammars and discusses the relation of pregroups to the Lambek calculus.
An Algebraic Approach to French Sentence Structure
TLDR
This paper proposes to investigate the structure of French sentences with the help of a minimal algebraic technique based on the assignment of types to words that is carefully adjusted to account for the order of preverbal clitic pronouns in a sentence.
An Algebraic Analysis of Clitic Pronouns in Italian
We analyze both pre-and post-verbal clitics in Italian in the context of infinitival phrases and declarative sentences, using a new form of categorial grammar in which one assigns to each morpheme a
TYPE GRAMMAR MEETS GERMAN WORD ORDER
TLDR
This is an attempt to see whether German word order can be analyzed by assigning types (here elements of a free pregroup) to individual German words, rather than by applying Chomskian transformations to parsing trees or by introducing Moortgat's modalities.
Logical Aspects of Computational Linguistics: Second International Conference, LACL'97 Nancy, France, September 22-24, 1997 Selected Papers
TLDR
Theoretic Analysis of Intonation and Linear Logic Treatment of Phrase Structure Grammars For Unbounded Dependencies and Mathematical Vernacular and Conceptual Well-Formedness in Mathematical Language.
Parsing English with a Link Grammar
TLDR
This work has encoded English grammar into a new formal grammatical system called a link grammar, and written a program (based on new algorithms) for efficiently parsing with this very complex grammar.
The Mathematics of Sentence Structure
TLDR
An effective rule (or algorithm) for distinguishing sentences from nonsentences is obtained, which works not only for the formal languages of interest to the mathematical logician, but also for natural languages such as English, or at least for fragments of such languages.
Type Grammar Revisited
TLDR
This work explores 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 the requirement of freeness may have to relax.
An Algebraic Approach to the German Noun Phrase
TLDR
The purpose of this article is to demonstrate that agreement can be handled by the algebraic notion of pregroup, and is part of an ongoing investigation of German sentence structure with the help of pregroups.
...
...