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.

鉴于无语境语法（CFG）不能充分描述自然语言，超出CFG的语法形式化，而且在计算上仍可操作，是计算语言学家的核心兴趣。本书对CFG和PTIME之间的形式语言景观进行了广泛的概述，从树状邻接语法到多上下文自由语法，然后到范围连接语法，同时解释了这些形式机制的可用解析技术。

尽管在阅读本书时，熟悉解析和形式语言的基本概念是有帮助的，但这并不是一个严格的要求。本书有许多与不同形式主义和算法有关的插图和例子，以及各章摘要、问题和解决方案。本书对计算语言学和形式语言理论方面的学生和研究人员很有用。