Parsing Beyond Context-Free Grammars
Parsing Beyond Context-Free Grammars
复制标题
DOI：
10.1007/978-3-642-14846-0
复制
发表时间：
2010-08
期刊：
影响因子：
--
通讯作者：
Laura Kallmeyer
中科院分区：
文献类型：
--
作者：
Laura Kallmeyer
鉴于上下文无关语法（CFG）无法充分描述自然语言，CFG 之外仍然易于计算处理的语法形式是计算语言学家的主要兴趣。本书广泛概述了 CFG 和 PTIME 之间的形式语言景观，从树邻接语法到多重上下文无关语法，然后到范围连接语法，同时解释了这些形式主义的可用解析技术。尽管熟悉语法分析和形式语言的基本概念对阅读本书很有帮助，但这并不是一个严格的要求。该演示文稿配有许多与不同形式和算法相关的插图和示例，以及章节摘要、问题和解决方案。本书对于计算语言学和形式语言理论的学生和研究人员很有用。
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.