Parsing Beyond Context-Free Grammars

Laura Kallmeyer

ISBN 10: 3642264530 / ISBN 13: 9783642264535

Verlag: Springer Berlin Heidelberg, 2012

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - 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.

Bestandsnummer des Verkäufers 9783642264535

Bibliografische Details

• Titel: Parsing Beyond Context-Free Grammars
• Verlag: Springer Berlin Heidelberg
• Erscheinungsjahr: 2012
• Sprache: Englisch
• ISBN-10: 3642264530
• ISBN-13: 9783642264535
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 235B x 155 H x 15 T Millimeter Breite: 235 mm, Höhe: 155 mm, Tiefe: 15 mm
• Gewicht: 400 Gramm

Über diesen Titel

Inhaltsangabe

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.