Volltext-Downloads (blau) und Frontdoor-Views (grau)

Learning domain-specific grammars from a small number of examples

  • In this paper we investigate the problem of grammar inference from a different perspective. The common approach is to try to infer a grammar directly from example sentences, which either requires a large training set or suffers from bad accuracy. We instead view it as a problem of grammar restriction or sub-grammar extraction. We start from a large-scale resource grammar and a small number of examples, and find a sub-grammar that still covers all the examples. To do this we formulate the problem as a constraint satisfaction problem, and use an existing constraint solver to find the optimal grammar. We have made experiments with English, Finnish, German, Swedish and Spanish, which show that 10–20 examples are often sufficient to learn an interesting domain grammar. Possible applications include computer-assisted language learning, domain-specific dialogue systems, computer games, Q/A-systems, and others.

Export metadata

Additional Services

Share in Twitter Search Google Scholar


Author:Herbert LangeORCiD, Peter LjunglöfORCiD
Parent Title (English):Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) - Volume 1. February 22-24, 2020, in Valletta, Malta
Place of publication:Setúbal
Editor:Ana Rocha, Luc Steels, Jaap van den Herik
Document Type:Conference Proceeding
Year of first Publication:2020
Date of Publication (online):2022/08/26
Publishing Institution:Leibniz-Institut für Deutsche Sprache (IDS)
Tag:computational linguistics; constraint solving; sub-grammar extraction
GND Keyword:Beispiel; Computerlinguistik; Constraint-Erfüllung; Fremdsprachenlernen; Grammatik; Kontrastive Grammatik; Zweisprachigkeit
First Page:422
Last Page:430
DDC classes:400 Sprache / 400 Sprache, Linguistik
Open Access?:ja
Licence (English):License LogoCreative Commons - Attribution-NonCommercial-NoDerivs 4.0 International