CS 124: From Languages to Information

TL;DR

Welcome to "From Languages to Information"!!

Q: Do I have to buy a textbook?
A: No, we will be using online pdf chapters pointed to below.

Q: Do I have to come to lecture or will there be videos?
A: This is a flipped class which means many of the lectures are recorded, but
1. 8 lectures (in blue below) are required, meaning the material is not on video but will be on the final
2. 5 classes will be devoted to useful in-class group exercises that are strongly recommended

The details are at the bottom of the webpage; you are responsible for reading this syllabus in its entirety before class Thursday Jan 7.
Have fun!!!!

Logistics

Instructor

Dan Jurafsky (jurafsky@stanford.edu)
Office: Margaret Jacks 117
Office Hours: Tuesday 2:00-2:50pm, Thursday 2:00-2:50pm (except no office hours Tuesday Jan 12)

Teaching Assistants

Jade Huang (head TA)
Naveen Arivazhagan
Ignacio Cases
Jennifer Lu
Brad Huang
Raghav Gupta
Brandon Garcia
Mikaela Grace
Kevin McKenzie
Natalia Silveira

TA Office Hours

• Wednesdays 7:00pm to 10:00pm in Huang 203 and 219
• Tuesdays 1:15pm to 3:00pm in Huang B020
• Thursdays 6:00pm to 8:00pm in Huang 203

Class Time

Tuesday and Thursday 3:00-4:20pm in 420-40

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-win1516-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-win1516-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 and attendence 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.

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 several times, with a time lag of 10 minutes in 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. We will take the highest score over all attempts for each quiz. The first two attempts will not be penalized; subsequent attempts will incur a cumulative 20% penalty (e.g., the maximum score possible is 80% on the 3rd attempt and 60% on the 4th attempt). Review Quizzes for each week are due 11:59pm Tuesday of the following week. There are no late days for review quizzes.

Class Participaton

Attendence is strongly recommended but optional except for the 8 lectures in blue bold. Reminder: I won't be actually taking attendence 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 5 in-class sessions devoted to group problem-solving. You can get credit for class participation by:: helpful answers on the class forum, asking good question of the invited speakers, helping out other students in office hours, participating in the in-class group exercises, being the first person to find typos in the textbook (not counting bugs in figure or chapter numbering).

Programming Assignments

6 programming assignments (in Java or Python, your choice). 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.

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 15, 7:00pm-10:00pm, Mudd Chemistry Building AUD
  

The alternate final is:

• Monday Mar 14, 3:30pm-6:30pm, Bishop Auditorium (in Lathrop Library)

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

Final grade

• 55% homeworks
• 27% final exam
• 11% weekly review quizzes
• 7% participation in forums and class