Analysing Constraint Grammars with a SAT-solver

Inari Listenmaa, Koen Claessen


Abstract
We describe a method for analysing Constraint Grammars (CG) that can detect internal conflicts and redundancies in a given grammar, without the need for a corpus. The aim is for grammar writers to be able to automatically diagnose, and then manually improve their grammars. Our method works by translating the given grammar into logical constraints that are analysed by a SAT-solver. We have evaluated our analysis on a number of non-trivial grammars and found inconsistencies.
Anthology ID:
L16-1111
Volume:
Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16)
Month:
May
Year:
2016
Address:
Portorož, Slovenia
Editors:
Nicoletta Calzolari, Khalid Choukri, Thierry Declerck, Sara Goggi, Marko Grobelnik, Bente Maegaard, Joseph Mariani, Helene Mazo, Asuncion Moreno, Jan Odijk, Stelios Piperidis
Venue:
LREC
SIG:
Publisher:
European Language Resources Association (ELRA)
Note:
Pages:
699–706
Language:
URL:
https://aclanthology.org/L16-1111
DOI:
Bibkey:
Cite (ACL):
Inari Listenmaa and Koen Claessen. 2016. Analysing Constraint Grammars with a SAT-solver. In Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16), pages 699–706, Portorož, Slovenia. European Language Resources Association (ELRA).
Cite (Informal):
Analysing Constraint Grammars with a SAT-solver (Listenmaa & Claessen, LREC 2016)
Copy Citation:
PDF:
https://aclanthology.org/L16-1111.pdf