Given that context-free grammars (CFG) cannot adequately describe natural languages, grammar formalisms beyond CFG that are still computationally tractableare 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, problemsand solutions. The book will be useful for students and researchers in computational linguistics and in formal language theory. First textbook on this topic Includes chapter summaries, problems and solutions Offers researchers a detailed overview of research in the field INDICE: Introduction Grammar Formalisms for Natural Languages Parsing: Preliminaries Tree Adjoining Grammars Parsing Tree Adjoining Grammars Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems Parsing MCFG, LCFRS and Simple RCG Range Concatenation Grammars Parsing Range Concatenation Grammars Automata App. A, Hierarchy of Grammar Formalisms App. B, List of Acronyms Solutions References Index
- ISBN: 978-3-642-14845-3
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 240
- Fecha Publicación: 01/08/2010
- Nº Volúmenes: 1
- Idioma: Inglés