Parsing Beyond Context-Free Grammars

1. Front Matter

   Pages i-xii

   PDF

2. Introduction

   • Laura Kallmeyer

   Pages 1-15

3. Grammar Formalisms for Natural Languages

   • Laura Kallmeyer

   Pages 17-40

4. Parsing: Preliminaries

   • Laura Kallmeyer

   Pages 41-52

5. Tree Adjoining Grammars

   • Laura Kallmeyer

   Pages 53-75

6. Parsing Tree Adjoining Grammars

   • Laura Kallmeyer

   Pages 77-108

7. Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems

   • Laura Kallmeyer

   Pages 109-129

8. Parsing MCFG, LCFRS and Simple RCG

   • Laura Kallmeyer

   Pages 131-156

9. Range Concatenation Grammars

   • Laura Kallmeyer

   Pages 157-175

10. Parsing Range Concatenation Grammars

    • Laura Kallmeyer

    Pages 177-192

11. Automata

    • Laura Kallmeyer

    Pages 193-214

12. Back Matter

    Pages 215-247

    PDF

Given that context-free grammars (CFG) cannot adequately describe natural languages, grammar formalisms beyond CFG that are still computationally tractable are of central interest for computational linguists. This book provides an extensive overview of the formal language landscape between CFG and PTIME, moving from Tree Adjoining Grammars to Multiple Context-Free Grammars and then to Range Concatenation Grammars while explaining available parsing techniques for these formalisms. Although familiarity with the basic notions of parsing and formal languages is helpful when reading this book, it is not a strict requirement. The presentation is supported with many illustrations and examples relating to the different formalisms and algorithms, and chapter summaries, problems and solutions. The book will be useful for students and researchers in computational linguistics and in formal language theory.

• Grammar formalisms
• Index
• Linear context-free rewriting syst
• Linear context-free rewriting systems (LCFRS)
• Mildly context-sensitive languages
• Multiple context-free grammars (MCFG)
• Natural-language processing
• Parsing
• Range concatenation grammars (RCG)
• Tree Adjoining Grammar
• Tree adjoining grammars
• computational linguistics
• grammar
• natural language

From the reviews:

“The book was developed out of lectures held by the author and, true to its intention, is very self-contained. It contains definitions for all used mathematical notions and relies only on basic math and simple arguments to make its points. … To reinforce the material, each chapter contains a small number of exercises, which are typically rather simple to solve and can perfectly be used to self-test. … the textbook contains an extensive bibliography that can serve as a starting point for individual research.” (Andreas Maletti, Zentralblatt MATH, Vol. 1252, 2012)

• SFB 833: Bedeutungskonstitution, Universität Tübingen, Tübingen, Germany

  Laura Kallmeyer

Policies and ethics