Final Exam 438/538 Instructions –538 Answer all questions –438 You may omit one question –Answers email (one file only, no attachments) state name and.

Slides:



Advertisements
Similar presentations
Prolog programming....Dr.Yasser Nada. Chapter 8 Parsing in Prolog Taif University Fall 2010 Dr. Yasser Ahmed nada prolog programming....Dr.Yasser Nada.
Advertisements

Review of Homework 4 November 20, Exercise 1 (A) 1 pt Modify the DCG to accept the omission of the complementizer that for object relative clauses.
Natural Language Processing Lecture 2: Semantics.
07/05/2005CSA2050: DCG31 CSA2050 Introduction to Computational Linguistics Lecture DCG3 Handling Subcategorisation Handling Relative Clauses.
DEFINITE CLAUSE GRAMMARS Ivan Bratko University of Ljubljana Faculty of Computer and Information Sc.
Equation Race Set 2 Distributive Property Solve your equation then add together your individual answers to get the final answer.
LING 388: Language and Computers Sandiway Fong Lecture 9: 9/22.
LING 438/538 Computational Linguistics Sandiway Fong Lecture 7: 9/12.
LING 438/538 Computational Linguistics Sandiway Fong Lecture 9: 9/21.
Intro to NLP - J. Eisner1 Probabilistic CKY.
LING/C SC/PSYC 438/538 Computational Linguistics Sandiway Fong Lecture 7: 9/11.
Amirkabir University of Technology Computer Engineering Faculty AILAB Efficient Parsing Ahmad Abdollahzadeh Barfouroush Aban 1381 Natural Language Processing.
LING 388 Language and Computers Take-Home Final Examination 12/9/03 Sandiway FONG.
LING 388 Language and Computers Lecture 18 10/30/03 Sandiway FONG.
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.
LING/C SC/PSYC 438/538 Midterm 10/11. Instructions It is recommended that you attempt all questions –Submit your answers in one file by to
LING 364: Introduction to Formal Semantics Lecture 5 January 26th.
LING 388: Language and Computers Sandiway Fong Lecture 13: 10/10.
LING 388 Language and Computers Lecture 12 10/9/03 Sandiway FONG.
LING 388 Language and Computers Lecture 15 10/21/03 Sandiway FONG.
March 1, 2009 Dr. Muhammed Al-Mulhem 1 ICS 482 Natural Language Processing INTRODUCTION Muhammed Al-Mulhem March 1, 2009.
LING/C SC/PSYC 438/538 Lecture 19 Sandiway Fong 1.
ANTLR with ASTs. Abstract Syntax Trees ANTLR can be instructed to produce ASTs for the output of the parser ANTLR uses a prefix notation for representing.
LING 388: Language and Computers Sandiway Fong Lecture 17.
Body Parts Activity 1 Left click to go to the next slide. -OR- Click the arrow key >
LING 388: Language and Computers Sandiway Fong Lecture 27.
LING 388: Language and Computers Sandiway Fong Lecture 7.
Welcome to 2009 Summer Math Camp Day 4 Tuesday, July 16.
BODY ТЕЛО. head hair face neck shoulders nose ear eyes mouth cheek.
Getting Started with MATLAB 1. Fundamentals of MATLAB 2. Different Windows of MATLAB 1.
LING 388: Language and Computers Sandiway Fong Lecture 10.
Conversation Practice Teacher: Do you have long hairs? Students: Yes, I have long hairs. Teacher: Do you have big eyes? Students: Yes, I have big eyes.
LING 388: Language and Computers Sandiway Fong Lecture 27: 12/6.
Chapter 23: Probabilistic Language Models April 13, 2004.
CS : Speech, NLP and the Web/Topics in AI Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture-16: Probabilistic parsing; computing probability of.
The man bites the dog man bites the dog bites the dog the dog dog Parse Tree NP A N the man bites the dog V N NP S VP A 1. Sentence  noun-phrase verb-phrase.
CS 4705 Lecture 10 The Earley Algorithm. Review Top-Down vs. Bottom-Up Parsers –Both generate too many useless trees –Combine the two to avoid over-generation:
LING/C SC/PSYC 438/538 Lecture 20 Sandiway Fong 1.
Numbers Counting in Japanese from Pictures from: anguage/tasterpack. php anguage/tasterpack. php.
NLP. Introduction to NLP Time flies like an arrow –Many parses –Some (clearly) more likely than others –Need for a probabilistic ranking method.
Counting in Japanese from
Steps of Addition Move your mouse over each step to see the directions.
J L C JAPANESE Language (And Culture) Club. What is the Japanese Language (and Culture) Club? A club for people with an interest in: Japanese Language.
LING/C SC/PSYC 438/538 Lecture 19 Sandiway Fong 1.
Welcome to 2009 Summer Academy Day 1 Monday, July 13.
How much is it? いくらですか ikuradesuka. 1. Asking How Much Something Is How much? ikura desu ka How much is it? kore wa ikura desu ka How much is a T-shirt?
N-Gram Model Formulas Word sequences Chain rule of probability Bigram approximation N-gram approximation.
Dependency Parsing Niranjan Balasubramanian March 24 th 2016 Credits: Many slides from: Michael Collins, Mausam, Chris Manning, COLNG 2014 Dependency Parsing.
Program to multiply 2 numbers 500-Input x 291-Store acc. as x 500-Input y 292-Store acc. as y 193-Load y in to acc. (0 on 1 st parse) 391-Add x to acc.
Computer Science 516 A Little On Finite State Machines.
ACC 561 Week 6 Learning Team Reflection Check this A+ tutorial guideline at 561/ACC-561-Week-6-Final-Guide Incremental.
Natural Language Processing
LING/C SC/PSYC 438/538 Lecture 21 Sandiway Fong.
Neural Language Model CS246 Junghoo “John” Cho.
Welcome to 2009 Summer Math Camp Day 3 Tuesday, July 15
LING/C SC 581: Advanced Computational Linguistics
Parsing and More Parsing
Counting large numbers
4. Computational Problem Solving
LING/C SC/PSYC 438/538 Lecture 26 Sandiway Fong.
[insert Module title here]
Make Ten Example: Name: ______________________
CHAPTER 18 Circuits for Arithmetic Operations
Place Value Name: _____________________
日本語の数字 Japanese numbers
NUMBER PATTERN 100’s and 1,000’s.
Lecture 7: Definite Clause Grammars
Artificial Intelligence 2004 Speech & Natural Language Processing
Internal components of a computer.
CS249: Neural Language Model
Presentation transcript:

Final Exam 438/538 Instructions –538 Answer all questions –438 You may omit one question –Answers (one file only, no attachments) state name and 438 or 538 diagrams may be submitted on paper (name) if diagram submitted, indicate in the file

FST Give a deterministic (input character by input character) FST in Prolog that maps numbers 0, 1–9, 10–29 (presented as a sequence of digits followed by an end character $) into Japanese (romaji format) –Examples: input: [0,$] output: rei (1 = ichi, 2 = ni, 3 = san, 4 = yon, 5 = go, 6 = roku, 7 = nana, 8 = hachi, 9 = kyu) [1,0,$] ju [1,4,$] ju yon (14 = 10 followed by 4) works for 11–19 [2,0,$] ni ju [2,4,$] ni ju yon (24 = two followed by ten followed by 4) works for 21–29 –Give examples of runs

N-grams and Probability Compute the probability of the sentence –START Bristol-Myers and Sun Microsystems agreed to merge. –using the bigram approximation to the chain rule and ADD ONE smoothing –given bigram frequency data shown in file bigram.txt –assume 9482 different words –START = start of sentence Submit your answer –write out equations –solve for answer –NB. case sensitive (bigrams) Examples START<>Bristol<> Bristol<>Myers<>27 29 agreed<>to<>25 27 Key –W1<>W2<>N1 N2 –W1 = first word –W2 = second word –N1 = bigram frequency of W1 W2 –N2 = unigram frequency of W1

DCG Sentences with reflexives –John saw himself/*herself –Mary saw *himself/herself –Mary saw John’s picture of himself/*herself –John saw Mary’s picture of *himself/herself Give a DCG grammar that builds parse trees for these sentences –use extra arguments to encode relevant features

LR Parsing Build the dotted rule FSA associated with the grammar: –S → NP VP –NP → D N –NP → N –VP → V NP Show the steps, i.e. actions: (shift, reduce) and states visited, involved in parsing the sentence the man saw John assuming –D → the, N → man, N → John, V → saw

WordNet Use WordNet online to discover – –What do the following words share in common? nose, face, eye, mouth, chin –But do not share with: ear, lips, eyebrow –Explain your answer.