LING 185A
Computational Linguistics I
Description: 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.
Units: 5.0
Units: 5.0
1 of 1
Most Helpful Review
Winter 2020 - Tim knows his shit and is very articulate. I don't know if it's just the material, but Prof. Hunter knows how to connect the dots between conceptual knowledge and actual implementation in Haskell. Highly recommend taking this class and professor. Coursework involves ~8 coding assignments worth 75% of your total grade, but gives you the option to drop the first 3 if you mess up even though those are the easiest. Then it's 20% final project (that I opted out of thanks to Corona and 5% mini pop-quizzes for attendance). After Week 5 (CFGs), the theory gets kinda ass lowkey and coding becomes much harder. Tim never directly answers questions on how to write a certain function but steers you in the right direction, so utilize friends and TA to help if you are stuck. Overall would recommend the class, I started just wanting to get an A and move on, but now Tim has made me appreciate computational linguistics on a deeper level.
Winter 2020 - Tim knows his shit and is very articulate. I don't know if it's just the material, but Prof. Hunter knows how to connect the dots between conceptual knowledge and actual implementation in Haskell. Highly recommend taking this class and professor. Coursework involves ~8 coding assignments worth 75% of your total grade, but gives you the option to drop the first 3 if you mess up even though those are the easiest. Then it's 20% final project (that I opted out of thanks to Corona and 5% mini pop-quizzes for attendance). After Week 5 (CFGs), the theory gets kinda ass lowkey and coding becomes much harder. Tim never directly answers questions on how to write a certain function but steers you in the right direction, so utilize friends and TA to help if you are stuck. Overall would recommend the class, I started just wanting to get an A and move on, but now Tim has made me appreciate computational linguistics on a deeper level.
AD
Most Helpful Review
Spring 2019 - For people expecting a more linguistics type class with some interesting computational elements and cool coding projects, this is not it. You will use Haskell the entire class, so prior knowledge of functional programming (CS131) is a HUGE advantage. It also spends quite a bit of time on Finite State Automaton and context free grammars, so taking CS181 before would probably help too. Grade is made up of 70% homework, 20% final coding project and 10% pop quizzes. This class is not easy and homework may leave you frustrated, do not take this lightly.
Spring 2019 - For people expecting a more linguistics type class with some interesting computational elements and cool coding projects, this is not it. You will use Haskell the entire class, so prior knowledge of functional programming (CS131) is a HUGE advantage. It also spends quite a bit of time on Finite State Automaton and context free grammars, so taking CS181 before would probably help too. Grade is made up of 70% homework, 20% final coding project and 10% pop quizzes. This class is not easy and homework may leave you frustrated, do not take this lightly.
1 of 1
