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.- Anthology ID:
- 2021.eacl-demos.21
- Volume:
- Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: System Demonstrations
- Month:
- April
- Year:
- 2021
- Address:
- Online
- Editors:
- Dimitra Gkatzia, Djamé Seddah
- Venue:
- EACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 168–175
- Language:
- URL:
- https://aclanthology.org/2021.eacl-demos.21
- DOI:
- 10.18653/v1/2021.eacl-demos.21
- Cite (ACL):
- Bruno Guillaume. 2021. Graph Matching and Graph Rewriting: GREW tools for corpus exploration, maintenance and conversion. In Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: System Demonstrations, pages 168–175, Online. Association for Computational Linguistics.
- Cite (Informal):
- Graph Matching and Graph Rewriting: GREW tools for corpus exploration, maintenance and conversion (Guillaume, EACL 2021)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-2/2021.eacl-demos.21.pdf