Log In
Or create an account ->
Imperial Library
Home
About
News
Upload
Forum
Help
Login/SignUp
Index
Cover
Table of Contents
Introduction
1 Programming with Graphs
1.1. Creating a graph
1.2. Feature structures
1.3. Information searches
1.4. Recreating an order
1.5. Using patterns with the GREW library
1.6. Graph rewriting
2 Dependency Syntax: Surface Structure and Deep Structure
2.1. Dependencies versus constituents
2.2. Surface syntax: different types of syntactic dependency
2.3. Deep syntax
3 Graph Rewriting and Transformation of Syntactic Annotations in a Corpus
3.1. Pattern matching in syntactically annotated corpora
3.2. From surface syntax to deep syntax
3.3. Conversion between surface syntax formats
4 From Logic to Graphs for Semantic Representation
4.1. First order logic
4.2. Abstract meaning representation (AMR)
4.3. Minimal recursion semantics, MRS
5 Application of Graph Rewriting to Semantic Annotation in a Corpus
5.1. Main stages in the transformation process
5.2. Limitations of the current system
5.3. Lessons in good practice
5.4. The DSQ_to_DMRS conversion system
6 Parsing Using Graph Rewriting
6.1. The Cocke–Kasami–Younger parsing strategy
6.2. Reducing syntactic ambiguity
6.3. Description of the POS_to_SSQ rule system
6.4. Evaluation of the parser
7 Graphs, Patterns and Rewriting
7.1. Graphs
7.2. Graph morphism
7.3. Patterns
7.4. Graph transformations
7.5. Graph rewriting system
7.6. Strategies
8 Analysis of Graph Rewriting
8.1. Variations in rewriting
8.2. What can and cannot be computed
8.3. The problem of termination
8.4. Confluence and verification of confluence
Appendix
A1.1. Sets
A1.2. Relations and functions
A1.3. Equivalences and orders
A1.4. Languages and finite sequences
Bibliography
Index
End User License Agreement
← Prev
Back
Next →
← Prev
Back
Next →