Parsing Beyond Context-Free Grammars

Front Cover
Springer Science & Business Media, Aug 16, 2010 - Language Arts & Disciplines - 248 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

1 Introduction
1
2 Grammar Formalisms for Natural Languages
16
Preliminaries
41
4 Tree Adjoining Grammars
53
5 Parsing Tree Adjoining Grammars
77
6 Multiple ContextFree Grammars and Linear ContextFree Rewriting Systems
109
7 Parsing MCFG LCFRS and Simple RCG
130
8 Range Concatenation Grammars
157
9 Parsing Range Concatenation Grammars
177
10 Automata
193
Hierarchy of Grammar Formalisms
215
List of Acronyms
217
Solutions
219
References
235
Index
245
Copyright

Common terms and phrases

Bibliographic information