LING 209A: Computational Linguistics I
Lecture, four hours; laboratory, one hour. Overview of formal computational ideas underlying kinds of grammars used in theoretical linguistics and psycholinguistics. Themes include role of recursion, relationship between structure and interpretation (both PF and LF), relationship between grammars and probabilities, and relationship between derivations and parsing. S/U or letter grading.
Units unknown, graduate
Offered Spring quarters
- Predicted GPA
- 3.74
- A or A minus
- 100%
- D, F or withdrew
- 0%
- Sections
- Sections not published yet.
- By instructor
- Spring 2022
- All instructors
- 3.74 GPA
- 100% A
- 0% DFW
- 9 grades
- PERKINS
- 3.83 GPA
- 100% A
- 0% DFW
- 9 grades
- Prerequisites
- Not read yet
- Restrictions
- Not read yet
- Grading
- Not read yet
- Final exam
- Final time not published