论文信息 - Analysing Constraint Grammars with a SAT-solver

Analysing Constraint Grammars with a SAT-solver

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.

Koen Claessen | Inari Listenmaa

[1] Atro Voutilainen,et al. A language-independent system for parsing unrestricted text , 1995 .

[2] Koen Claessen,et al. Constraint Grammar as a SAT problem , 2015 .

[3] Lene Antonsen,et al. Next to nothing – a cheap South Saami disambiguator , 2011 .

[4] Eckhard Bick. ML-Tuned Constraint Grammars , 2013, PACLIC.

[5] Anna Freud,et al. Grammatical Framework Programming With Multilingual Grammars , 2016 .

[6] Torbjörn Lager. Transformation-Based Learning of Rules for Constraint Grammar Tagging , 2001, NODALIDA.

[7] Joakim Nivre,et al. Part of Speech Tagging from a Logical Point of View , 2001, LACL.

[8] Eckhard Bick. A Constraint Grammar-Based Parser for Spanish , 2006 .

[9] Torbjörn Lager. Logic for Part-of-Speech Tagging and Shallow Parsing , 1998, NODALIDA.

[10] Atro Voutilainen. Hand-Crafted Rules , 1999 .

[11] Penelope Sibun,et al. A Practical Part-of-Speech Tagger , 1992, ANLP.

[12] Martin Eineborg,et al. Induction of Constraint Grammar-Rules Using Progol , 1998, ILP.

[13] Atro Voutilainen,et al. Inducing constraint grammars , 1996, ICGI.

[14] Tommi A. Pirinen,et al. Using weighted finite state morphology with VISL CG-3 - Some experiments with free open source Finnish resources , 2015 .

[15] Lene Antonsen,et al. Reusing Grammatical Resources for New Languages , 2010, LREC.