CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Analysing constraint grammars with a SAT-solver

Inari Listenmaa ; Koen Claessen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
10th International Conference on Language Resources and Evaluation, LREC 2016; Grand Hotel Bernardin Conference CenterPortoroz; Slovenia; 23 May 2016 through 28 May 2016 p. 699-706. (2016)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Constraint grammar; Grammar analysis; SAT

Denna post skapades 2017-12-29.
CPL Pubid: 254177