ML-Optimization of Ported Constraint Grammars
In this paper, we describe how a Constraint Grammar with linguist-written rules can be optimized and ported to another language using a Machine Learning technique. The effects of rule movements, sorting, grammar-sectioning and systematic rule modifications are discussed and quantitatively evaluated. Statistical information is used to provide a baseline and to enhance the core of manual rules. The best-performing parameter combinations achieved part-of-speech F-scores of over 92 for a grammar ported from English to Danish, a considerable advance over both the statistical baseline (85.7), and the raw ported grammar (86.1). When the same technique was applied to an existing native Danish CG, error reduction was 10{\%} (F=96.94).
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationMorphological AnalysisSimilar Papers 제목 키워드 기반
Joint learning of constraint weights and gradient inputs in Gradient Symbolic Computation with constrained optimization
This paper proposes a method for the joint optimization of constraint weights and symbol activations within the Gradient Symbolic Computation (GSC) framework. The set of grammars representable in GSC is proven to be a su…
Analysing Constraint Grammars with a SAT-solver
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 automaticall…
Probabilistic Grammars for Equation Discovery
Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, …
Equation DiscoverySymbolic RegressionHybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures
We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures. Covered are both discontinuous phrase structures and non-proje…
Abstract categorial grammars with island constraints and effective decidability
A well-known approach to treating syntactic island constraints in the setting of Lambek grammars consists in adding specific bracket modalities to the logic. We adapt this approach to abstract categorial grammars (ACG). …