登入選單
返回Google圖書搜尋
Parsing Beyond Context-Free Grammars
Laura Kallmeyer
出版Springer Science & Business Media, 2010-08-16
主題Language Arts & Disciplines / Linguistics / GeneralComputers / Speech & Audio ProcessingComputers / Artificial Intelligence / Natural Language ProcessingLanguage Arts & Disciplines / Linguistics / Historical & Comparative
ISBN36421484689783642148460
URLhttp://books.google.com.hk/books?id=F5wC0dko1L4C&hl=&source=gbs_api
EBookSAMPLE
註釋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.