CS 124: From Languages to Information

Welcome to "From Languages to Information"!!

When and Where: Tu/Thu 3:00-4:20 Hewlett 200 (we just moved to this new room)
Textbook: none, we'll use free online pdf chapters
Coming to class: mostly required, even though this is a flipped class
Details: below. You are responsible for reading this entire syllabus before class Thursday Jan 11!

Most important: Have fun and learn lots!!!!

Logistics

Instructor

Dan Jurafsky (jurafsky@stanford.edu)
Office: Margaret Jacks 117
Office Hours: Thursdays 4:30-6:00 except not Feb 8; instead, Tuesday Feb 6 4:30-6:00

Teaching Assistants

Will Hamilton (head TA)
Janette Cheng
Timothy Dozat
Ashkon Farhangi
Gaspar Garcia
Robin Jia
Rafael Musa
Charissa Plattner
Kate Park
Kelly Shen
Stephanie Tang
Rob Voigt
Lucy Wang
Jeff Pyke

TA Office Hours

• Tuesdays 1:15pm to 3:00pm 420-245
• Wednesdays 7:00pm to 10:00pm in Huang 203 and 219
• Thursdays 6:00pm to 8:00pm in Huang 203, Huang 304 (overflow)

Class Time

Tuesday and Thursday 3:00-4:20pm in Hewlett 200

Email

If you have a question that is not confidential or personal, post it on the Piazza forum - responses tend to be quicker and have a wider audience. To contact the teaching staff directly, we strongly encourage you to come to office hours. If that is not possible, you can also email (non-technical questions only) to the course staff list, cs124-win1718-staff@lists.stanford.edu. We can not reply to email sent to individual staff members. If you have a matter to be discussed privately, please come to office hours, or use cs124-win1718-staff@lists.stanford.edu to make an appointment. For grading questions, please talk to us after class or during office hours.

We use the mailing list generated by Axess to convey messages to the class. We will assume that all students read these messages.

Honor Code

Since we occasionally reuse homeworks from previous years, we expect students not to copy, refer to, or look at the solutions in preparing their answers. It is an honor code violation to intentionally refer to a previous year's solutions. This applies both to the official solutions and to solutions that you or someone else may have written up in a previous year. It is also an honor code violation to find some way to look at the test set or interfere in any way with programming assignment scoring or tampering with the submit script.

Since quizzes are a form of assessment, students are not allowed to collaborate on completing quizzes. It is an honor code violation to discuss quiz questions with other students.

Textbooks

• There is no required textbook, but I will expect you to know the material listed above, drawn from the textbooks and other readings. The material in the readings will be tested on the final exam. Different people may learn better from different combinations of videos/lectures, reading the chapters, or coming to the in-class group exercises. The best-prepared students who do the best on the final exams tend to do all three. But I won't take roll for lectures and attendance is up to you.
  • Online new chapters from Jurafsky and Martin. third edition in progress. Speech and Language Processing.
  • Chapters from Manning, Raghavan, and Schutze. 2008. Introduction to Information Retrieval. Cambridge University Press. You can buy the book, get it from the library, or it's also available online *HERE*.

Course Description

Extracting meaning, information, and structure from human language text, speech, web pages, genome sequences, social networks, or any less structured information. Methods include: string algorithms, edit distance, language modeling, naive Bayes, inverted indices, vector semantics. Applications such as information retrieval, question answering, text classification, social network models, chatbots, genomic sequence alignment, word meaning extraction, recommender systems.

Prerequisites

CS 103, CS 107 and CS 109.

Required Work

Video Lectures

Each week, we will ask you to watch a set of video lectures (2 to 2.5 hours total). The videos will have some in-video questions embedded in them, which you should answer. You are required to watch the videos (or in some cases, attend the lectures that cover the identical material) but the embedded quizzes are not counted toward the final grade. For a few of the video lectures I'll do a duplicate in-class version for people who prefer to see the lecture live. For those duplicate lectures you can watch either the in-class or recorded version.

In class Lectures

Attendence is required at the 8 lectures + 1 group work marked with a * and in blue on the syllabus above. When I say required I mean that this material will be tested in the final but is not in the videos or chapters; I will not be taking attendance.

In-class group problem-solving

5 in-class sessions are for group problem-solving activities. Only the first one (Jan 11 on Unix text processing) is required; attendence at the other 4 is highly recommended. Previous students who did well in the class have reported that the in-class group exercises have been extremely useful.

Automated Review Quizzes

After watching a week's video lectures, we will ask you to answer an open-notes, open-book review quiz (about 5 questions) on the content that you just learned. Each review quiz may be attempted twice, with a time lag between each attempt. The questions, as well as the options for each question, are randomly selected from a larger pool each time you take a quiz. The system will automatically take the best score of your two attempts for the quiz. Review Quizzes for each week are due 11:59pm Tuesday of the following week. There are no late days for review quizzes.

Class Participation

Attendence is strongly recommended but optional except for the 8 lectures in blue bold plus the one group session (Jan 11) in blue bold, which are required. Reminder: I won't be actually taking attendeace but I'll being covering material that is not presented in the textbook or video lectures, and I will test this material on the final. In addition, there will be 4 other in-class sessions devoted to group problem-solving. You can also get extra credit for class participation by:: helpful answers on the class forum, helping out other students in office hours, being the first person to find typos in the textbook (not counting bugs in figure or chapter numbering).

Programming Assignments

6 Python programming assignments. Each assignment is due at 5:00pm on the Friday it is due.

Programming Assignment Collaboration: You may talk to anybody you want about the assignments and bounce ideas off each other. But you must write the actual programs yourself. We will use the normal automatic checks for overlap between your code and other students' code.

Late homeworks

You have 4 free late (calendar) days to use on programming assignments 1-5. You cannot use late days on PA 6. Once late days are exhausted, any PA turned in late will be penalized 20% per late day. Each 24 hours or part thereof that a homework is late uses up one full late day. However, no assignment will be accepted more than four days after its due date.

Readings

This class has a significant amount of textbook reading. Most weeks have around 30 textbook pages. The homeworks and exams will be based heavily on the readings.

Final exam:

• Tuesday Mar 20, 3:30pm-6:30pm Dinkelspiel Auditorium 100

The alternate final is the day before:

• Monday Mar 19, 12:15-3:15pm, also Dinkelspiel Auditorium 100

You can take whichever final you prefer. You don't have to RSVP, just show up.

Final grade computation

• 63% homeworks (PAs 1-5 are each worth the same, 9% (ignore the different point values for each homework). PA6 is worth 18%, double the others)
• 22% final exam
• 15% weekly review quizzes