Generalised Graph Grammars for Natural Language Processing
Oliver Robert Fox, Giacomo Bergami
TL;DR
A new query language for graph matching and rewriting is proposed overcoming {the declarative} limitation of Cypher while outperforming {Neo4j} on graph matching and rewriting by at least one order of magnitude.
Abstract
This seminal paper proposes a new query language for graph matching and rewriting overcoming {the declarative} limitation of Cypher while outperforming {Neo4j} on graph matching and rewriting by at least one order of magnitude. We exploited columnar databases (KnoBAB) to represent graphs using the Generalised Semistructured Model.