Course pages 2012–13
Machine Learning for Language Processing
Stephen Clark's lectures:
- Jan 21 Lecture 1: Introduction to Machine Learning (Naive Bayes Classification)
- Jan 22 Lecture 2: Maximum Entropy Tagging and Classification
- Feb 4 Lecture 3: Graphical Models
- Feb 5/11 Lecture 4: Discriminative Sequence Models and Conditional Random Fields
- Feb 18 Lecture 5: The Perceptron for Structured Prediction
- Feb 26 Lecture 6: The Dual-Form Perceptron (leading to Kernels)
- Mar 11 Lecture 7: Topic Modelling and Latent Dirichlet Allocation
Instructions, Schedule and Reading List
See Syllabus etc for lecture details, assessment scheme, and deadlines
L = lecture, S = Seminar (Two presentations per seminar)
Please select three papers that you would like to present in order of preference by noon on Friday 18th January and email your selections to Ted.Briscoe@cl.cam.ac.uk. I will assign papers by 5pm that day. Do not do this if you are only auditing the course.
There will be 2 presentations per 50 minute session. Your presentations should be about 15 minutes allowing for a further 5 minutes for questions, and 10 minutes at the end of each session for general discussion. You should summarise the paper briefly (remember eeryone will have read it), explicate any parts you found difficult or innovative, and critically evaluate the work described. For your evaluation you should consider questions like: To what extent have the stated aims of the research been achieved? To what extent is the work replicable given the information provided? In what way does the work advance the state of the art?, etc. You may prepare slides and use the data or overhead projector and/or whiteboard. You should liaise with your co-presenter to decide the order in which to make presentations. The first presentation should briefly define the task, the others should not. You should have all slides for the session loaded onto a single laptop set up with the data projector by the beginning of each session.
All students should read all the papers and come to all sessions prepared to discuss each paper after the presentations
You may write an essay on a topic related to the paper you present, or any of the course material. Alternatively you may undertake a small project on text classification using existing datasets and machine learning software and submit a project report. In both cases, your essay or report should not exceed 5000 words and will be due in around the end of the first week of Easter Term.
You should discuss and agree your essay topic or project with Ted.Briscoe@cl.cam.ac.uk by email after the division (week 4) of the Lent Term. Write a proposal of up to 500 words outlining the topic or project giving a preliminary reading list and indicating what resources you plan to use, if relevant. The first draft of your proposal should reach me by Monday, 4th March at the latest.
Your essay topic should involve an in-depth critical evaluation of a specific machine learning technique and its application to language processing, or of a specific language processing task and machine learning techniques that have been applied to that task. Little credit will be given for summaries of papers. An example of a possible title/topic on named entity recognition might be `To what extent do we need sequential models to achieve accurate NER?' This essay might critically examine the claim made by Ratinov and Roth that NE recognition and classification can be done accurately by conditioning only on the class label assigned to the previous word(s) (as well as other invariant observed features of the context) without (Viterbi) decoding to find the most likely path of label assignments. In doing this, it might review the NER task definition and consider how dealing adequately with conjoined or otherwise complex NEs (Mazur and Dale) might affect their claims. It might also propose an experiment that would resolve the issue empirically and/or identify one that has been published that sheds some light on it.
Suitable small projects will need to make use of existing labelled datasets and existing machine learning tools that are distributed and documented, so that they can be completed in reasonable time. Some examples of text classificataion tasks and datasets are: spam filtering (lingspam, genspam), sentiment of movie reviews ("sentiment polarity datasets" Pang), named entity recognition (conll shared task ner), hedge (scope) detection (conll shared task hedge scope), language identification (altw 2010 langid dataset), document topic classification (Reuters-21578), genre classification (genre collection repository), and many more. Some examples of (good) machine learning toolkits are SVMlight, WEKA, or Mallet. A project might replicate a published experiment but try different feature types or a different classifier, and describe the experiment and report results in a comparable manner to the relevant (short) paper.