Skip to Main content Skip to Navigation

Application of Graph Rewriting to Natural Language Processing

Guillaume Bonfante 1 Bruno Guillaume 2 Guy Perrier 2
1 CARBONE - Carbone
LORIA - FM - Department of Formal Methods
2 SEMAGRAMME - Semantic Analysis of Natural Language
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : 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.
Document type :
Complete list of metadata
Contributor : Bruno Guillaume Connect in order to contact the contributor
Submitted on : Wednesday, June 13, 2018 - 11:20:06 AM
Last modification on : Wednesday, November 3, 2021 - 7:09:19 AM


  • HAL Id : hal-01814386, version 1


Guillaume Bonfante, Bruno Guillaume, Guy Perrier. Application of Graph Rewriting to Natural Language Processing. ISTE Wiley, 1, pp.272, 2018, Logic, Linguistics and Computer Science Set, Christian Rétoré, 1786300966. ⟨hal-01814386⟩



Les métriques sont temporairement indisponibles