斯坦福的NLP Class

GoTo
About The Course

Hello! We are offering this course on Natural Language Processing free and online to students worldwide, starting on March 12, 2012, continuing Stanford's exciting forays into large scale online instruction. Students have access to screencast lecture videos, are given quiz questions, assignments and exams, receive regular feedback on progress, and can participate in a discussion forum. Those who successfully complete the course will receive a statement of accomplishment. Taught by Professors Jurafsky and Manning, the curriculum draws from Stanford's courses in Natural Language Processing. You will need a decent internet connection for accessing course materials, but should be able to watch the videos on your smartphone.

The course covers a broad range of topics in natural language processing, including word and sentence tokenization, text classification and sentiment analysis, spelling correction, information extraction, parsing, meaning extraction, and question answering, We will also introduce the underlying theory from probability, statistics, and machine learning that are crucial for the field, and cover fundamental algorithms like n-gram language modeling, naive bayes and maxent classifiers, sequence models like Hidden Markov Models, probabilistic dependency and constituent parsing, and vector-space models of meaning.

Why Study Natural Language Processing?

Natural language processing is the technology for dealing with our most ubiquitous product: human language, as it appears in emails, web pages, tweets, product descriptions, newspaper stories, social media, and scientific articles, in thousands of languages and varieties. In the past decade, successful natural language processing applications have become part of our everyday experience, from spelling and grammar correction in word processors to machine translation on the web, from email spam detection to automatic question answering, from detecting people's opinions about products or services to extracting appointments from your email. In this class, you'll learn the fundamental algorithms and mathematical models for human language processing and how you can use them to solve practical problems in dealing with language data wherever you encounter it.

What Background Do I Need?

No background in natural language processing is required. Students will be expected to know a bit of basic probability (know Bayes rule), a bit about vectors and vector spaces (could length normalize a vector), a bit of calculus (know that the derivative of a function is zero at a maximum or minimum of the function), but we will review these concepts as we first use them. You should have reasonable programming ability (know about hash tables and graph data structures), be able to write programs in either Java or Python, and have a computer (Windows, Mac or Linux) with internet access.

What Textbook Should I Buy?

We will provide detailed lecture notes for all the technical content, which will be yours to keep after the end of class. Many students do fine just working from the lectures and notes. But others find it very useful to have an accompanying textbook, for reinforcing the core material, as a source of additional exercises, and as a reference for the future.

The best textbook for the class is Jurafsky and Martin, Speech and Language Processing 2nd Edition, complemented by chapters from Manning, Schütze and Raghavan 2008; other useful, good books include Manning and Schütze 1999, and Bird, Klein and Loper 2009.

Preparation

To prepare for the class in advance, you may consider reading through some sections of the textbooks (Jurafsky and Martin, Speech and Language Processing 2nd Edition, and Manning, Schütze and Raghavan 2008). Or, if you're rusty or not very experienced in either Java or Python, it'd be great to work through early parts of Bird, Klein and Loper 2009.

The following topics will be covered in the first two weeks:

  1. Introduction and Overview:
  2. Basic Text Processing: J+M Chapters 2.1, 3.9; MR+S Chapters 2.1-2.2
  3. Minimum Edit Distance: J+M Chapter 3.11
  4. Language Modeling: J+M Chapter 4
  5. Spelling Correction: J+M Chapters 5.9, Peter Norvig (2007) How to Write a Spelling Corrector

About The Instructor

Professors Jurafsky and Manning are the leading natural language processing educators, through their textbooks on natural language processing, speech, and information retrieval.

Dan Jurafsky is Professor of Linguistics and Professor by Courtesy of Computer Science at Stanford University. Dan received his Bachelors degree in Linguistics in 1983 and his Ph.D. in Computer Science in 1992, both from the University of California at Berkeley, and also taught at the University of Colorado, Boulder before joining the Stanford faculty in 2004. He is the recipient of a MacArthur Fellowship and has served on a variety of editorial boards, corporate advisory boards, and program committees. Dan's research extends broadly throughout natural language processing as well as its application to the behavioral and social sciences.

Christopher Manning is an Associate Professor of Computer Science and Linguistics at Stanford University. Chris received a Bachelors degree and University Medal from the Australian National University and a Ph.D. from Stanford in 1994, both in Linguistics. Chris taught at Carnegie Mellon University and The University of Sydney before joining the Stanford faculty in 1999. He is a Fellow of the American Association for Artificial Intelligence and of the Association for Computational Linguistics, and is one of the most cited authors in natural language processing, for his research on a broad range of statistical natural language topics from tagging and parsing to grammar induction and text understanding.

Frequently Asked Questions

  1. What is the format of the class?

    The class will consist of lecture videos, which are broken into small chunks, usually between 8 and 15 minutes each. Most of these contain integrated quiz questions. There will also be standalone problem sets that are not part of video lectures, and programming assignments.

  2. Will the text of the lectures be available?

    We hope to transcribe the lectures into text to make them more accessible for those not fluent in English.

  3. Do I need to watch the lectures live?

    No. You can watch the lectures at your leisure.

  4. Can online students ask questions and/or contact the professors?

    Yes, but not directly. There is a Q&A forum in which students rank questions and answers, so that the most important questions and the best answers bubble to the top. Teaching staff will monitor these forums, so that important questions not answered by other students can be addressed.

  5. Will other Stanford resources be available to online students?

    No.

  6. How much work will I be expected to do in this class?

    You need to work about 10 hours a week to complete the course.

     

    • About 2 hours of video segments each week, containing inline ungraded quiz questions
    • A weekly, graded multiple choice and short answer problem set (about 1 hour to complete).
    • A substantial weekly programming assignment (about 6 hours to complete).
  7. How much does it cost to take the course?

    Nothing: it's free!

  8. Will I get university credit for taking this course?

    No.

     

    https://www.coursera.org/nlp/auth/welcome

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值