Parsing Beyond Context-Free Grammars

Laura Kallmeyer

ISBN 10: 364214845X / ISBN 13: 9783642148453

Published by Springer Berlin Heidelberg Aug 2010, 2010

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 260 pp. Englisch. Seller Inventory # 9783642148453

Bibliographic Details

Title: Parsing Beyond Context-Free Grammars

Publisher: Springer Berlin Heidelberg Aug 2010

Publication Date: 2010

Binding: Buch

Condition: Neu

About this title

Synopsis:

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.