Analysing constraint grammars with a SAT-solver
Paper i proceeding, 2016

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.

SAT

Grammar analysis

Constraint grammar

Författare

Inari Listenmaa

Göteborgs universitet

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik

10th International Conference on Language Resources and Evaluation, LREC 2016; Grand Hotel Bernardin Conference CenterPortoroz; Slovenia; 23 May 2016 through 28 May 2016

699-706

Ämneskategorier

Data- och informationsvetenskap

ISBN

978-295174089-1

Mer information

Senast uppdaterat

2018-02-21