CS 4705 Final Review CS4705 Julia Hirschberg. Format and Coverage Covers only material from thru (i.e. beginning with Probabilistic Parsing) Same format.

Slides:



Advertisements
Similar presentations
Sequence Classification: Chunking Shallow Processing Techniques for NLP Ling570 November 28, 2011.
Advertisements

Statistical NLP: Lecture 3
1 Discourse, coherence and anaphora resolution Lecture 16.
Discourse Martin Hassel KTH NADA Royal Institute of Technology Stockholm
Word sense disambiguation and information retrieval Chapter 17 Jurafsky, D. & Martin J. H. SPEECH and LANGUAGE PROCESSING Jarmo Ritola -
Chapter 18: Discourse Tianjun Fu Ling538 Presentation Nov 30th, 2006.
For Friday No reading Homework –Chapter 23, exercises 1, 13, 14, 19 –Not as bad as it sounds –Do them IN ORDER – do not read ahead here.
NLP and Speech Course Review. Morphological Analyzer Lexicon Part-of-Speech (POS) Tagging Grammar Rules Parser thethe – determiner Det NP → Det.
CS4705 Natural Language Processing.  Regular Expressions  Finite State Automata ◦ Determinism v. non-determinism ◦ (Weighted) Finite State Transducers.
Introduction to Semantics To be able to reason about the meanings of utterances, we need to have ways of representing the meanings of utterances. A formal.
CS Word Sense Disambiguation. 2 Overview A problem for semantic attachment approaches: what happens when a given lexeme has multiple ‘meanings’?
CS 4705 Lecture 19 Word Sense Disambiguation. Overview Selectional restriction based approaches Robust techniques –Machine Learning Supervised Unsupervised.
CS 4705 Algorithms for Reference Resolution. Anaphora resolution Finding in a text all the referring expressions that have one and the same denotation.
Final Review CS4705 Natural Language Processing. Semantics Meaning Representations –Predicate/argument structure and FOPC Thematic roles and selectional.
CS4705 Natural Language Processing.  Final: December 18 th 1:10-4, 1024 Mudd ◦ Closed book, notes, electronics  Don’t forget courseworks evaluation:
CS 4705 Lecture 21 Algorithms for Reference Resolution.
Natural Language Generation Martin Hassel KTH CSC Royal Institute of Technology Stockholm
Introduction to CL Session 1: 7/08/2011. What is computational linguistics? Processing natural language text by computers  for practical applications.
Course Summary LING 575 Fei Xia 03/06/07. Outline Introduction to MT: 1 Major approaches –SMT: 3 –Transfer-based MT: 2 –Hybrid systems: 2 Other topics.
CS 4705 Word Sense Disambiguation. Overview Selectional restriction based approaches Robust techniques –Machine Learning Supervised Unsupervised –Dictionary-based.
تمرين شماره 1 درس NLP سيلابس درس NLP در دانشگاه هاي ديگر ___________________________ راحله مکي استاد درس: دکتر عبدالله زاده پاييز 85.
Pragmatics I: Reference resolution Ling 571 Fei Xia Week 7: 11/8/05.
1/23 Applications of NLP. 2/23 Applications Text-to-speech, speech-to-text Dialogues sytems / conversation machines NL interfaces to –QA systems –IR systems.
11 CS 388: Natural Language Processing: Syntactic Parsing Raymond J. Mooney University of Texas at Austin.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2005 Lecture 1 21 July 2005.
NLU: Frames Frame KR is a good way to represent common sense –can define stereotypical aspects of some domain we are interested in analyzing –sentences.
9/8/20151 Natural Language Processing Lecture Notes 1.
Universität des Saarlandes Department 4.3 English Linguistics Professor Dr. N. R. Norrick Lecture: Semantics Semantics: Exam Topics.
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
Lecture 12: 22/6/1435 Natural language processing Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
PropBank, VerbNet & SemLink Edward Loper. PropBank 1M words of WSJ annotated with predicate- argument structures for verbs. –The location & type of each.
For Friday Finish chapter 23 Homework: –Chapter 22, exercise 9.
Scott Duvall, Brett South, Stéphane Meystre A Hands-on Introduction to Natural Language Processing in Healthcare Annotation as a Central Task for Development.
Lycos Retriever: An Information Fusion Engine Brian Ulicny.
Ling 570 Day 17: Named Entity Recognition Chunking.
Semantics: Representations and Analyses Slides adapted from Julia Hirschberg, Dan Jurafsky, Chris Manning.
CS 4705 Lecture 19 Word Sense Disambiguation. Overview Selectional restriction based approaches Robust techniques –Machine Learning Supervised Unsupervised.
1 CSI 5180: Topics in AI: Natural Language Processing, A Statistical Approach Instructor: Nathalie Japkowicz Objectives of.
GTRI.ppt-1 NLP Technology Applied to e-discovery Bill Underwood Principal Research Scientist “The Current Status and.
Collocations and Information Management Applications Gregor Erbach Saarland University Saarbrücken.
For Wednesday Read chapter 23 Homework: –Chapter 22, exercises 1,4, 7, and 14.
October 2005CSA3180 NLP1 CSA3180 Natural Language Processing Introduction and Course Overview.
Linguistic Essentials
Coherence and Coreference Introduction to Discourse and Dialogue CS 359 October 2, 2001.
Lecture 21 Computational Lexical Semantics Topics Features in NLTK III Computational Lexical Semantics Semantic Web USCReadings: NLTK book Chapter 10 Text.
Rules, Movement, Ambiguity
For Monday Read chapter 24, sections 1-3 Homework: –Chapter 23, exercise 8.
For Friday Finish chapter 24 No written homework.
For Monday Read chapter 26 Last Homework –Chapter 23, exercise 7.
LING 001 Introduction to Linguistics Spring 2010 Syntactic parsing Part-Of-Speech tagging Apr. 5 Computational linguistics.
CS460/IT632 Natural Language Processing/Language Technology for the Web Lecture 1 (03/01/06) Prof. Pushpak Bhattacharyya IIT Bombay Introduction to Natural.
For Friday Finish chapter 23 Homework –Chapter 23, exercise 15.
FILTERED RANKING FOR BOOTSTRAPPING IN EVENT EXTRACTION Shasha Liao Ralph York University.
For Monday Read chapter 26 Homework: –Chapter 23, exercises 8 and 9.
Overview of Statistical NLP IR Group Meeting March 7, 2006.
Week 3a.  -roles, feature checking CAS LX 522 Syntax I.
Statistical NLP: Lecture 3
INAGO Project Automatic Knowledge Base Generation from Text for Interactive Question Answering.
Lecture 21 Computational Lexical Semantics
Algorithms for Reference Resolution
Natural Language - General
CS4705 Natural Language Processing
Introduction Task: extracting relational facts from text
CS4705 Natural Language Processing
Linguistic Essentials
CS224N Section 3: Corpora, etc.
CS4705 Natural Language Processing
Relations Between Words
Information Retrieval
Presentation transcript:

CS 4705 Final Review CS4705 Julia Hirschberg

Format and Coverage Covers only material from thru (i.e. beginning with Probabilistic Parsing) Same format as midterm: –Short answers: 2-3 sentences –True/False: for false statements provide true correction that is not just the negation of the false statement, e.g.

–Good answer: The exam is on Dec 14. FALSE! The exam is on Dec 16. –Bad answer: The exam is on Dec 14. FALSE! The exam is not on Dec 14.. Exercises Short essays: 2 essays, 3-5 paragraphs each The final will be only slightly longer than the midterm, although you will have the full 3h to complete it.

Probabilistic Parsing Problems with CFGs: –Rules unordered, many possible parses Solutions: –Weight the rules by their probabilities –But rules aren’t sensitive to lexical items or subcategorization frames –Add headwords to trees –Add subcategorization probabilities –Add complement/adjunct distinction –Etc.

Semantics Meaning Representations –Predicate/argument structure and FOPC –Problems with mapping to NL (e.g. and  ^) Frame semantics Having Haver: S HadThing: Car –Problems with reasoning from representation

Subcategorization Frames and Thematic Roles What patterns of arguments can different verbs take? –NP likes NP –NP likes Inf-VP –NP likes NP Inf-VP What roles can arguments take? –Agent, Patient, Theme (The ice melted), Experiencer (Bill likes pizza), (Bill likes pizza), Stimulus (Bill likes pizza), Goal (Bill ran to Copley Square), Recipient (Bill gave the book to Mary), Instrument (Bill ate the burrito with a plastic spork), Location (Bill sits under the tree on Wednesdays)

Selectional Restrictions George assassinated the senator. ?The spider assassinated the fly *Cain assassinated Able. George broke the bank.

Lexical Semantics Lexemes Lexicon Wordnet: synsets Framenet: subcategorization frames/verb semantics

Word Relations Types of word relations –Homonymy: bank/bank –Homophones: red/read –Homographs: bass/bass –Polysemy: bank/sperm bank –Synonymy: big/large –Hyponym/hypernym: poodle/dog –Metonymy: (printing press)/the press –Meronymy: (wheel)/car –Metaphor: Nothing scares Google.

Word Sense Disambiguation Time flies like an arrow. Tasks: all-words vs. lexical sample Techniques: –Supervised, semi-supervised bootstrapping, unsupervised –Corpora needed –Features that are useful –Competitions and Evaluation methods Specific approaches: –Naïve Bayes, Decision Lists, Dictionary-based, Selectional Restrictions

Discourse Structure and Coherence Topic segmentation –Useful Features –Hearst’s TexTiling – how does it work? –Supervised methods – how do we evaluate? Coherence relations –Hobbs’ –Rhetorical Structure Theory – what are it’s problems?

Reference Terminology Referring expressions Discourse referents Anaphora and cataphora Coreference Antecendents Pronouns One-anaphora Definite and indefinite NPs Anaphoric chains

Constraints on Anaphoric Reference Salience Recency of mention: rule of 2 sentences Discourse structure Agreement Grammatical function Repeated mention Parallel construction Verb semantics/thematic roles Pragmatics

Algorithms for Coreference Resolution Lappin & Leas Hobbes Centering Theory Supervised approaches Evaluation

Information Extraction Template-based IE –Named Entity Tagging –Sequence-based relation tagging: supervised and bootstrapping –IE for Question Answering, e.g. biographical information (Biadsy’s `bouncing’ between Wikipedia and Google)

Information Retrieval Vector-Space model –Cosine similarity –TF/IDF weighting NIST competition retrieval tasks Techniques for improvement Metrics –Precision, recall, F-measure

Question Answering Factoid questions Useful Features Answer typing UT Dallas System

Summarization Types and approaches to summarization –Indicative vs. informative –Generative vs. extractive –Single vs. multi-document –Generic vs. user-focused Useful features Evaluation methods Newsblaster – how does it work? –Multi-document –Sentence fusion and ordering –Topic tracking

MT Multilingual challenges –Orthography, Lexical ambiguity, morphology, syntax MT Approaches: –The Pyramid –Statistical vs. Rule-based vs. Hybrid Evaluation metrics –Human vs. Bleu score –Criteria: fluency vs. accuracy

Dialogue Turns and Turn-taking Speech Acts and Dialogue Acts Grounding Intentional Structure: Centering Pragmatics –Presupposition –Conventional Implicature –Conversational Implicature

The Final Dec. 16, MUDD 535, 1:10-4pm Good luck!