Weak and Strong Learning of Context-Free Grammars - 2012
Center for Language & Speech Processing(CLSP), JHU via YouTube
Earn Your Business Degree, Tuition-Free, 100% Online!
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore a comprehensive lecture on the advancements in unsupervised learning of context-free grammars using distributional techniques. Delve into the challenges of moving from weak learning algorithms to strong algorithms capable of learning correct structures. Examine a new theoretical approach based on transformations of grammars through morphisms of algebraic structures. Discover how this model leads to predictions about syntactic structure in natural languages. Learn about the syntactic concept lattice and its role as a basis for weak learning algorithms for CFGs. Gain insights from Alexander Clark, a researcher in grammatical inference, theoretical and mathematical linguistics, and unsupervised learning from the Department of Computer Science at Royal Holloway, University of London.
Syllabus
Weak and Strong Learning of Context-Free Grammars – Alexander Clark (UCL) - 2012
Taught by
Center for Language & Speech Processing(CLSP), JHU