Computational Linguistics I

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
10.0 / 10
Organization
10.0 / 10
Time
5-10 hrs/week
Overall
10.0 / 10

Reviews

    Quarter Taken: Fall 2023 In-Person
    Grade: A+

    Note: I am writing this review for Professor Perkins who taught in F23. Not sure why the professor is listed as Douglas Merchant here.

    I absolutely loved this class! Prof. Perkins is a great lecturer who breaks down the concepts in a clear and understandable way. The grading scheme is 75% homework and 25% final project, which is quite nice since there are no exams. The homeworks are pretty weighty though and really start to pick up after HW 3. Most of the homeworks involve writing Haskell code. It can be a big change to go from typical programming languages like C++ and python to a functional language like Haskell, but I thought it was pretty manageable since Perkins taught us everything we needed to know about Haskell for the purposes of the course.

Course

Instructor
Douglas Merchant
Previously taught
24F 23F 22F 22W 21S
Formerly offered as
LING C185A

Grading Information

  • No group projects

  • Attendance not required

  • No midterms

  • No final

  • 0% recommend the textbook

Previous Grades

Grade distributions not available.