Learning Language from a Large (Unannotated) Corpus
Not on the map. Why?
Abstract (arXiv)
A novel approach to the fully automated, unsupervised extraction of dependency grammars and associated syntax-to-semantic-relationship mappings from large text corpora is described. The suggested approach builds on the authors' prior work with the Link Grammar, RelEx and OpenCog systems, as well as on a number of prior papers and approaches from the statistical language learning literature. If successful, this approach would enable the mining of all the information needed to power a natural language comprehension and generation system, directly from a large, unannotated corpus.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Jan 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 2.
4 papers.
- 2022Unsupervised Tokenization Learningcited by 2
- 2023Self-tuning hyper-parameters for unsupervised cross-lingual tokenizationcited by 1
- 2023Evolution of Efficient Symbolic Communication Codescited by 1
- 2022On Unsupervised Training of Link Grammar Based Language Modelscited by 0
- 2023Evolution of Efficient Symbolic Communication Codes4 Jun 2023
- 2023Self-tuning hyper-parameters for unsupervised cross-lingual tokenization4 Mar 2023
- 2022On Unsupervised Training of Link Grammar Based Language Models27 Aug 2022
- 2022Unsupervised Tokenization Learning23 May 2022