Lecture, four hours; laboratory, one hour. Requisites: courses 120B, Program in Computing 10C (or Computer Science 32). Recommended: course 165B or 200B. Overview of formal computational ideas underlying kinds of grammars used in theoretical linguistics and psycholinguistics, and some connections to applications in natural language processing. Topics include recursion, relationship between probabilities and grammars, and parsing algorithms. P/NP or letter grading.

Review Summary

Clarity
N/A
Organization
N/A
Time
N/A
Overall
N/A

Course

Instructor
Dylan Bumford
Previously taught
23W
Formerly offered as
LING C185A

Previous Grades

Grade distributions not available.

Textbooks

Textbook information not available.