Unsupervised Language Acquisition
Carl de Marcken (MIT)

TL;DR
This thesis proposes a computational, unsupervised approach to language acquisition using probabilistic models, enabling machines to learn language structures from raw data without explicit supervision.
Contribution
It introduces a novel framework for unsupervised language learning that separates content from representation, improving learning efficiency and accuracy over previous methods.
Findings
Performs well on vocabulary and grammar learning from unsegmented data
Achieves human-like structural understanding of utterances
Reduces search problems in language acquisition algorithms
Abstract
This thesis presents a computational theory of unsupervised language acquisition, precisely defining procedures for learning language from ordinary spoken or written utterances, with no explicit help from a teacher. The theory is based heavily on concepts borrowed from machine learning and statistical estimation. In particular, learning takes place by fitting a stochastic, generative model of language to the evidence. Much of the thesis is devoted to explaining conditions that must hold for this general learning strategy to arrive at linguistically desirable grammars. The thesis introduces a variety of technical innovations, among them a common representation for evidence and grammars, and a learning strategy that separates the ``content'' of linguistic parameters from their representation. Algorithms based on it suffer from few of the search problems that have plagued other…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Machine Learning and Algorithms · Computability, Logic, AI Algorithms
