LING 209A

Computational Linguistics I

Description: 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: 5.0
1 of 1
Overall Rating N/A
Easiness N/A / 5
Clarity N/A / 5
Workload N/A / 5
Helpfulness N/A / 5
1 of 1

Adblock Detected

Bruinwalk is an entirely Daily Bruin-run service brought to you for free. We hate annoying ads just as much as you do, but they help keep our lights on. We promise to keep our ads as relevant for you as possible, so please consider disabling your ad-blocking software while using this site.

Thank you for supporting us!