Parsing Beyond Context-Free Grammars

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 P...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Kallmeyer, Laura (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Cognitive Technologies,
Temas:
Computational linguistics.
Natural language processing (Computer science).
Computational Linguistics.
Natural Language Processing (NLP).
Acceso en línea:Texto Completo
Tabla de 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.

Ejemplares similares