Graph Matching and Graph Rewriting: GREW tools for corpus exploration, maintenance and conversion
Abstract
This article presents a set of tools built around the Graph Rewriting computational framework which can be used to compute complex rule-based transformations on linguistic structures. Application of the graph matching mechanism for corpus exploration, error mining or quantitative typology are also given.
Domains
Computation and Language [cs.CL]Origin | Files produced by the author(s) |
---|