Learning grammar with a divide-and-concur neural network
Not on the map. Why?
Abstract (arXiv)
We implement a divide-and-concur iterative projection approach to context-free grammar inference. Unlike most state-of-the-art models of natural language processing, our method requires a relatively small number of discrete parameters, making the inferred grammar directly interpretable -- one can read off from a solution how to construct grammatically valid sentences. Another advantage of our approach is the ability to infer meaningful grammatical rules from just a few sentences, compared to the hundreds of gigabytes of training data many other models employ. We demonstrate several ways of applying our approach: classifying words and inferring a grammar from scratch, taking an existing grammar and refining its categories and rules, and taking an existing grammar and expanding its lexicon as it encounters new words in new data.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 24 references that are in the map. First posted on arXiv 18 Jan 2022.
Builds on
7 of 24 references.
References · 7
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2020It's Hard for Neural Networks To Learn the Game of Lifecited by 13
- 2020Reconstructing cellular automata rules from observations at nonconsecutive timescited by 5
- 2019Learning Without Losscited by 4
- 2021Avoiding Traps in Nonconvex Problemscited by 1
Built on by
Not cited yet.