Parsing Beyond Context-Free Grammars [recurso electrónico] / by Laura Kallmeyer.

Por: Kallmeyer, Laura [author.]Colaborador(es): SpringerLink (Online service)Tipo de material: Texto

TextoSeries Cognitive Technologies ; 0Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Descripción: XII, 248 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642148460Tema(s): Linguistics | Translators (Computer programs) | Computational linguistics | Linguistics | Computational Linguistics | Language Translation and LinguisticsFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 410.285 Clasificación LoC:P98-98.5Recursos en línea: Libro electrónico Texto

Contenidos:

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.

En: Springer eBooksResumen: 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.

Existencias ( 1 )
Notas de título ( 3 )

Existencias
Tipo de ítem	Biblioteca actual	Colección	Signatura	Copia número	Estado	Fecha de vencimiento	Código de barras
Libro Electrónico	Biblioteca Electrónica	Colección de Libros Electrónicos	P98 -98.5 (Browse shelf(Abre debajo))	1	No para préstamo		374876-2001

Navegando Biblioteca Electrónica Estantes, Código de colección: Colección de Libros Electrónicos Cerrar el navegador de estanterías (Oculta el navegador de estanterías)

Previo								Siguiente
Previo	P98 .E384 2014 Efficient computation of argumentation semantics	P98 -98.5 Handbook of Natural Language Processing and Machine Translation	P98 -98.5 Natural Language Processing and Information Systems	P98 -98.5 Parsing Beyond Context-Free Grammars	P98 -98.5 Multilingual Information Access Evaluation II. Multimedia Experiments	P98 -98.5 Multilingual Information Access Evaluation I. Text Retrieval Experiments	P98 -98.5 Multilingual and Multimodal Information Access Evaluation	Siguiente

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.