Application of Graph Rewriting to Natural Language Processing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Books Year : 2018

Application of Graph Rewriting to Natural Language Processing

Guillaume Bonfante
  • Function : Author
  • PersonId : 830993
Bruno Guillaume
Guy Perrier
  • Function : Author
  • PersonId : 8101
  • IdHAL : guy-perrier


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.
No file

Dates and versions

hal-01814386 , version 1 (13-06-2018)


  • 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⟩
308 View
0 Download


Gmail Facebook X LinkedIn More