Parsing Beyond Context-Free Grammars
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 th
- PDF / 2,214,024 Bytes
- 253 Pages / 439.37 x 666.142 pts Page_size
- 101 Downloads / 195 Views
Editorial Board: A. Bundy J. G. Carbonell M. Pinkal H. Uszkoreit M. Veloso W. Wahlster M. J. Wooldridge
Advisory Board: Luigia Carlucci Aiello Franz Baader Wolfgang Bibel Leonard Bolc Craig Boutilier Ron Brachman Bruce G. Buchanan Anthony Cohn Artur d’Avila Garcez Luis Fari˜nas del Cerro Koichi Furukawa Georg Gottlob Patrick J. Hayes James A. Hendler Anthony Jameson Nick Jennings Aravind K. Joshi Hans Kamp Martin Kay Hiroaki Kitano Robert Kowalski Sarit Kraus Maurizio Lenzerini Hector Levesque John Lloyd
For further volumes: http://www.springer.com/series/5216
Alan Mackworth Mark Maybury Tom Mitchell Johanna D. Moore Stephen H. Muggleton Bernhard Nebel Sharon Oviatt Luis Pereira Lu Ruqian Stuart Russell Erik Sandewall Luc Steels Oliviero Stock Peter Stone Gerhard Strube Katia Sycara Milind Tambe Hidehiko Tanaka Sebastian Thrun Junichi Tsujii Kurt VanLehn Andrei Voronkov Toby Walsh Bonnie Webber
Laura Kallmeyer
Parsing Beyond Context-Free Grammars
123
PD Dr. Laura Kallmeyer SFB 833 Universit¨at T¨ubingen Nauklerstr. 35 72074 T¨ubingen Germany [email protected] Managing Editors Prof. Dr. Dov M. Gabbay Augustus De Morgan Professor of Logic King’s College London Dept. Computer Science London WC2R 2LS United Kingdom
Prof. Dr. J¨org Siekmann Forschungsbereich Deduktions- und Multiagentensysteme, DFKI Stuhlsatzenweg 3, Geb. 43 66123 Saarbr¨ucken, Germany
Cognitive Technologies ISSN 1611-2482 ISBN 978-3-642-14845-3 e-ISBN 978-3-642-14846-0 DOI 10.1007/978-3-642-14846-0 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2010933793 ACM Computing Classification (1998): I.2.7, F.4, J.5 c Springer-Verlag Berlin Heidelberg 2010 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: K¨unkelLopka GmbH, Heidelberg Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Preface
Given that context-free grammars cannot adequately describe natural languages, grammar formalisms beyond CFG that are still computationally tractable are of central interest for computational linguists. However, despite the considerable interest in such formalisms and in their various parsing algorithms, a coherent textbook that allows access to the large body of knowled
Data Loading...
