Add to ORKGWe 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
In this paper we present a new method for machine learning-based optimization of linguist-written Co...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
In this dissertation, it is shown how efficient natural language parsing with constraint-based gramm...
We represent Constraint Grammar (CG) as a Boolean satisfiability (SAT) problem. Encoding CG in logic...
Modeling in constraint programming is a hard task that requires considerable expertise. Automated mo...
Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism that has proven effe...
Grammar engineering has a lot in common with software engineering. Analogous to a program specificat...
Abstract We specialize an efficient while linguistically savvy constraint solving model of grammar i...
We argue in this paper in favor of a fully constraint-based approach in the perspective of grammar d...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
Abstract. A wide range of constraints can be specified using automata or formal languages. The GRAMM...
In this paper we investigate the problem of grammar inference from a different perspective. The comm...
Inside the framework of robust parsers for the syntactic analysis of unrestricted text, the aim of ...
The manual design of grammars for accurate natural language analysis is an iterative process; while ...
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
In this paper we present a new method for machine learning-based optimization of linguist-written Co...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
In this dissertation, it is shown how efficient natural language parsing with constraint-based gramm...
We represent Constraint Grammar (CG) as a Boolean satisfiability (SAT) problem. Encoding CG in logic...
Modeling in constraint programming is a hard task that requires considerable expertise. Automated mo...
Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism that has proven effe...
Grammar engineering has a lot in common with software engineering. Analogous to a program specificat...
Abstract We specialize an efficient while linguistically savvy constraint solving model of grammar i...
We argue in this paper in favor of a fully constraint-based approach in the perspective of grammar d...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
Abstract. A wide range of constraints can be specified using automata or formal languages. The GRAMM...
In this paper we investigate the problem of grammar inference from a different perspective. The comm...
Inside the framework of robust parsers for the syntactic analysis of unrestricted text, the aim of ...
The manual design of grammars for accurate natural language analysis is an iterative process; while ...
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
In this paper we present a new method for machine learning-based optimization of linguist-written Co...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
In this dissertation, it is shown how efficient natural language parsing with constraint-based gramm...