Implementing Constraint Grammar using SAT solver.
git clone https://github.com/inariksit/cgsat
It's using SAT+ by Koen Claessen, more precisely, my fork. As of December 2016, I've moved the actual Haskell format and the BNFC parser into another repository, cghs. All of this should be included in
stack build. It should fetch stuff from my two other git repositories. You should also have
alex as executables.
Structure of the repository:
- Disambiguate: Use SAT-based implementation as a disambiguator, just like VISL CG-3 or any other CG engine out there.
- Analyse: Detect conflicts in a grammar.
- Spanish, English, Hungarian and Finnish CG rules and morpho analysed data to use as examples.
- Papers on this project: 2015 CG workshop at NoDaLiDa, and 2016 LREC. (See cgexp for another experiment, hopefully becoming a paper at 2017 CG workshop.)
- (cg.bib)[https://github.com/inariksit/cgsat/blob/master/doc/cg.bib] for all things CG-related.
- All the various versions between December 2014 - December 2016. Not in any particular order, definitely doesn't compile.
- CG_SAT: Takes the CG format in cghs, turns it into a SAT-problem. TODO rewrite this to work with the new format.
- AmbiguityClass: Extra feature of ambiguity classes. Needs a representative lexicon in order to work properly. Written by Koen Claessen, to be modified to my new format.
- Spec: TODO write some tests. Tests for the format and parser are in cghs.