Skip to main content

Application of Graph Rewriting to Natural Language Processing

Application of Graph Rewriting to Natural Language Processing

Guillaume Bonfante, Bruno Guillaume, Guy Perrier

ISBN: 978-1-119-52234-8

Apr 2018, Wiley-ISTE

272 pages


* VAT information


The paradigm of Graph Rewriting is used very little in the field of Natural Language Processing. But graphs are a natural way of representing the deep syntax and the semantics of natural languages. Deep syntax is an abstraction of syntactic dependencies towards semantics in the form of graphs and there is a compact way of representing the semantics in an underspecified logical framework also with graphs. Then, Graph Rewriting reconciles efficiency with linguistic readability for producing representations at some linguistic level by transformation of a neighbor level: from raw text to surface syntax, from surface syntax to deep syntax, from deep syntax to underspecified logical semantics and conversely.

Related Resources


Request an Evaluation Copy for this title

1. Introduction

2. Graphs

3. Graphs for surface and deep syntax of natural languages

4. Underspecified logical representation of semantics with graphs

5. Graph Rewriting

6. Syntactic Parsing with Graph Rewriting

7. From Surface Syntax to Deep Syntax

8. From Deep Syntax to Underspecified Semantics

9. An application of pattern matching: exploration and validation of annotated corpora

10. A complete application of Graph Rewriting to translation

11. Conclusion