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.
Rezensionen / Stimmen
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)
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
76
76 s/w Abbildungen
XII, 248 p. 76 illus.
Dateigröße
ISBN-13
978-3-642-14846-0 (9783642148460)
DOI
10.1007/978-3-642-14846-0
Schweitzer Klassifikation
Grammar Formalisms for Natural Languages.- Parsing: Preliminaries.- Tree Adjoining Grammars.- Parsing Tree Adjoining Grammars.- Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems.- Parsing MCFG, LCFRS and Simple RCG.- Range Concatenation Grammars.- Parsing Range Concatenation Grammars.- Automata.
