Parsing schemata for practical text analysis /

Mostrar otras versiones (1)

The book presents a wide range of recent research results about parsing schemata, introducing formal frameworks and theoretical results while keeping a constant focus on applicability to practical parsing problems. The first part includes a general introduction to the parsing schemata formalism that...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Gómez-Rodríguez, Carlos
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Imperial College Press, ©2010.
Colección:Mathematics, computing, language, and life ; v. 1.
Temas:
Computer algorithms.
Parsing (Computer grammar)
Computational linguistics.
Algorithmes.
Analyse automatique (Linguistique)
Linguistique informatique.
algorithms.
computational linguistics.
COMPUTERS > Software Development & Engineering > Systems Analysis & Design.
Computational linguistics
Computer algorithms
Acceso en línea:Texto completo
Tabla de Contenidos:
  • 1. Introduction. 1.1. Motivation. 1.2. Background. 1.3. Outline of the book
  • 2. Preliminaries. 2.1. Context-free grammars. 2.2. Parsing algorithms and schemata. 2.3. The formalism of parsing schemata. 2.4. Advantages of parsing schemata
  • 3. A compiler for parsing schemata. 3.1. Motivation and goals. 3.2. System architecture. 3.3. Generated code. 3.4. Reading schemata. 3.5. The code generation process. 3.6. Indexing. 3.7. Discussion
  • 4. Practical complexity of constituency parsers. 4.1. Parsing natural language with CFGs. 4.2. Parsing with TAGs. 4.3. Parsing schemata for TAG. 4.4. Parsing schemata for the XTAG English grammar. 4.5. Comparing several parsers for the XTAG grammar. 4.6. Parsing with artificially-generated TAGs. 4.7. Overhead of TAG parsing over CFG parsing. 4.8. Discussion
  • 5. Error-repair parsing schemata. 5.1. Motivation. 5.2. Error repair in parsing schemata. 5.3. Lyon's error-repair parser. 5.4. Obtaining minimal distance parses. 5.5. Global and regional error repair. 5.6. Discussion
  • 6. Transforming standard parsers into error-repair parsers. 6.1. From standard parsers to error-repair parsers. 6.2. Formal description of the error-repair transformation. 6.3. Proof of correctness of the error-repair transformation. 6.4. Optimising the results of the transformation. 6.5. Discussion
  • 7. Dependency parsing schemata. 7.1. Motivation. 7.2. The formalism of dependency parsing schemata. 7.3. Parsing schemata for projective dependency parsers. 7.4. Relations between dependency parsers. 7.5. Proving the correctness of dependency parsers. 7.6. Parsing schemata for non-projective dependency parsers. 7.7. Parsing schemata for Link Grammar parsers. 7.8. Discussion
  • 8. Mildly non-projective dependency parsing. 8.1. Motivation. 8.2. Preliminaries. 8.3. The WG[symbol] parser. 8.4. The WG[symbol] parser. 8.5. Parsing ill-nested structures. 8.6. Discussion
  • 9. Conclusions. 9.1. Future work.

Ejemplares similares