CS4705 Natural Language Processing

Slides:



Advertisements
Similar presentations
1 CS 388: Natural Language Processing: N-Gram Language Models Raymond J. Mooney University of Texas at Austin.
Advertisements

C O N T E X T - F R E E LANGUAGES ( use a grammar to describe a language) 1.
About Grammars CS 130 Theory of Computation HMU Textbook: Sec 7.1, 6.3, 5.4.
Natural Language Processing Projects Heshaam Feili
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 2 Syntax A language that is simple to parse.
For Monday Read Chapter 23, sections 3-4 Homework –Chapter 23, exercises 1, 6, 14, 19 –Do them in order. Do NOT read ahead.
NLP and Speech Course Review. Morphological Analyzer Lexicon Part-of-Speech (POS) Tagging Grammar Rules Parser thethe – determiner Det NP → Det.
Shallow Processing: Summary Shallow Processing Techniques for NLP Ling570 December 7, 2011.
CS4705 Natural Language Processing.  Regular Expressions  Finite State Automata ◦ Determinism v. non-determinism ◦ (Weighted) Finite State Transducers.
Midterm Review CS4705 Natural Language Processing.
PZ02A - Language translation
Language Model. Major role: Language Models help a speech recognizer figure out how likely a word sequence is, independent of the acoustics. A lot of.
تمرين شماره 1 درس NLP سيلابس درس NLP در دانشگاه هاي ديگر ___________________________ راحله مکي استاد درس: دکتر عبدالله زاده پاييز 85.
More on Text Management. Context Free Grammars Context Free Grammars are a more natural model for Natural Language Syntax rules are very easy to formulate.
Albert Gatt Corpora and Statistical Methods Lecture 9.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2005 Lecture 1 21 July 2005.
Problem of the DAY Create a regular context-free grammar that generates L= {w  {a,b}* : the number of a’s in w is not divisible by 3} Hint: start by designing.
For Friday Finish chapter 23 Homework: –Chapter 22, exercise 9.
CISC 471 First Exam Review Game Questions. Overview 1 Draw the standard phases of a compiler for compiling a high level language to machine code, showing.
Some Probability Theory and Computational models A short overview.
1 Context-Free Languages. 2 Regular Languages 3 Context-Free Languages.
October 2005CSA3180 NLP1 CSA3180 Natural Language Processing Introduction and Course Overview.
ICS 482: Natural language Processing Pre-introduction
Saeid Pashzadeh Jan 2009 Theory of Computation 1.
1 Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Supertagging CMSC Natural Language Processing January 31, 2006.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Introduction Finite Automata accept all regular languages and only regular languages Even very simple languages are non regular (  = {a,b}): - {a n b.
Finite Automata Chapter 1. Automatic Door Example Top View.
CSC312 Automata Theory Lecture # 26 Chapter # 12 by Cohen Context Free Grammars.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 2 Context-Free Languages Some slides are in courtesy.
Overview of Statistical NLP IR Group Meeting March 7, 2006.
C Sc 132 Computing Theory Professor Meiliu Lu Computer Science Department.
Mid-Terms Exam Scope and Introduction. Format Grades: 100 points -> 20% in the final grade Multiple Choice Questions –8 questions, 7 points each Short.
Chapter 3 – Describing Syntax CSCE 343. Syntax vs. Semantics Syntax: The form or structure of the expressions, statements, and program units. Semantics:
Computability Joke. Context-free grammars Parsing. Chomsky
Formal Language & Automata Theory
Parsing and Parser Parsing methods: top-down & bottom-up
Automata and Languages What do these have in common?
Syntax Analysis Chapter 4.
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Context Free Languages
CS416 Compiler Design lec00-outline September 19, 2018
Course 2 Introduction to Formal Languages and Automata Theory (part 2)
CSE322 Chomsky classification
Probabilistic and Lexicalized Parsing
CPSC 388 – Compiler Design and Construction
Machine Learning in Natural Language Processing
Training Tree Transducers
CSCI 5832 Natural Language Processing
CSCI 5832 Natural Language Processing
Programming Languages
CS4705 Natural Language Processing
CS416 Compiler Design lec00-outline February 23, 2019
Theory of Computation Lecture #
Teori Bahasa dan Automata Lecture 9: Contex-Free Grammars
CPSC 503 Computational Linguistics
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
CSCI 5832 Natural Language Processing
David Kauchak CS159 – Spring 2019
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Lec00-outline May 18, 2019 Compiler Design CS416 Compiler Design.
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Context Free Grammars-II
Programming Languages 2nd edition Tucker and Noonan
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Review for the Midterm. Overview (Chapter 1):
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
COMPILER CONSTRUCTION
Presentation transcript:

CS4705 Natural Language Processing Midterm Review CS4705 Natural Language Processing

Midterm Review Statistical v. Symbolic Processing Regular Expressions 80/20 Rule Regular Expressions Finite State Automata Determinism v. non-determinism (Weighted) Finite State Transducers Morphology Word Classes Inflectional v. Derivational Affixation, infixation, concatenation Morphotactics

Morphological parsing Koskenniemi’s two-level morphology Porter stemmer Minimum Edit Distance (Levenshtein) N-grams Markov assumption Chain Rule Language Modeling Simple, Adaptive, Class-based (syntax-based), bursty Smoothing Add-one, Witten-Bell, Good-Turing Back-off Perplexity, Entropy Maximum Likelihood Estimation

Syntax Context Free Grammars Chomsky’s view: Syntax is cognitive reality Parse Trees Dependency Structure Part-of-Speech Tagging Hand Written Rules v. Statistical v. Hybrid Brill Tagging Types of Ambiguity Context Free Grammars Top-down v. Bottom-up Derivations Left Corners Grammar Equivalence Normal Forms (CNF)

Probabilistic Parsing (p)CYK, Earley Parsing Derivational Probability Lexicalization Classification Supertagging Machine Learning Dependent v. Independent variables Training v. Development Test v. Test sets Feature Vectors Metrics Accuracy Precision, Recall, F-Measure Gold Standards

Semantics Meaning Representations Semantic Roles, Subcategorization frames FOPC Pros Cons Temporal Representations Richenbach Aspect Beliefs, Desires, Intention Representation Syntax-driven semantics