Learnability of Pregroup Grammars

Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first theoretical approach, we provide learnability and non-learnability results in the sense of Gold for subclasses of Pregroup Grammars. In a second more practical approach, we propose an acquisition algorithm from a special kind of input called Feature-tagged Examples, that is based on sets of constraints. Key-words. Learning from positive examples, Pregroup grammars, Computational linguistics, Categorial Grammars, Context-Free grammars.

• Type: Conference
• Year: 2004
• Where: ICGI
• Authors: Denis Béchet, Annie Foret, Isabelle Tellier
• Keywords: Computational Linguistics, Context-free Grammars, ICGI 2004, Natural Language Processing, Pregroup Grammars