Computation and Learnability in Linguistic Theory


This course introduces the advanced linguistics or computer science student to the fields of learnability and computation as they apply to the study of linguistic theories and natural language. Topics covered include the formal language hierarchy, including the subregular languages; issues in the learnability of phonology, morphology, and syntax; and algorithms specific to constraint-based linguistic grammars. Prerequisites: either CS 130 or Ling 317 and at least one of the following: Ling 309, Ling 311, Ling 313, or Ling 315.
Course Attributes: EN S; AS SSC; FA SSC; AR SSC

Section 01

Computation and Learnability in Linguistic Theory
View Course Listing - FL2022