In this paper we present a new method for machine learning-based optimization of linguist-written Constraint Grammars. The effect of rule ordering/sorting, grammar-sectioning and systematic rule changes is discussed and quantitatively evaluated. The F-score improvement was 0.41 percentage points for a mature (Danish) tagging grammar, and 1.36 percentage points for a half-size grammar, translating into a 7-15% error reduction relative to the performance of the untuned grammars.
By parsing is here meant the automatic assignment of morphological and syntactic structure (but not ...
In this paper, we propose two enhance-ments to a statistical machine translation based approach to g...
Abstract. Blache [1] introduced Property Grammar as a formalism where linguistic information is repr...
We discuss a two-stage disambiguation technique for linguistically precise broad-coverage grammars: ...
Abstract. This paper presents a solution for overcoming the lexical resource gap when mounting rule-...
In this dissertation, it is shown how efficient natural language parsing with constraint-based gramm...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
This thesis addresses the issue of how Natural Language Processing (nlp) systems using `constraint-b...
We study the impact of source length and verbosity of the tuning dataset on the per-formance of para...
Abstract We specialize an efficient while linguistically savvy constraint solving model of grammar i...
10 pages, 6 tables, 6 figuresLarge pre-trained language models (LM) based on Transformers allow to g...
This study is a slightly revised version of the author's 1993 Ph.D. dissertation, University of Cali...
In this paper, we propose two enhance-ments to a statistical machine translation based approach to g...
International audienceLarge pre-trained language models (LM) based on Transformers allow to generate...
When a language evolves, meta-models and associated grammars need to be co-evolved to stay mutually ...
By parsing is here meant the automatic assignment of morphological and syntactic structure (but not ...
In this paper, we propose two enhance-ments to a statistical machine translation based approach to g...
Abstract. Blache [1] introduced Property Grammar as a formalism where linguistic information is repr...
We discuss a two-stage disambiguation technique for linguistically precise broad-coverage grammars: ...
Abstract. This paper presents a solution for overcoming the lexical resource gap when mounting rule-...
In this dissertation, it is shown how efficient natural language parsing with constraint-based gramm...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
This thesis addresses the issue of how Natural Language Processing (nlp) systems using `constraint-b...
We study the impact of source length and verbosity of the tuning dataset on the per-formance of para...
Abstract We specialize an efficient while linguistically savvy constraint solving model of grammar i...
10 pages, 6 tables, 6 figuresLarge pre-trained language models (LM) based on Transformers allow to g...
This study is a slightly revised version of the author's 1993 Ph.D. dissertation, University of Cali...
In this paper, we propose two enhance-ments to a statistical machine translation based approach to g...
International audienceLarge pre-trained language models (LM) based on Transformers allow to generate...
When a language evolves, meta-models and associated grammars need to be co-evolved to stay mutually ...
By parsing is here meant the automatic assignment of morphological and syntactic structure (but not ...
In this paper, we propose two enhance-ments to a statistical machine translation based approach to g...
Abstract. Blache [1] introduced Property Grammar as a formalism where linguistic information is repr...