CS325 Artificial Intelligence Natural Language Processing II (Ch. - PowerPoint PPT Presentation

CS325 Artificial Intelligence Natural Language Processing II (Ch. 23) Dr. Cengiz Günay, Emory Univ. Günay () Natural Language Processing II (Ch. 23) Spring 2013 1 / 18

So Probabilities Enough for Understanding Language? He came from out of nowhere. Günay () Natural Language Processing II (Ch. 23) Spring 2013 2 / 18

So Probabilities Enough for Understanding Language? He came from out of nowhere. From out of nowhere, he came. Günay () Natural Language Processing II (Ch. 23) Spring 2013 2 / 18

So Probabilities Enough for Understanding Language? He came from out of nowhere. From out of nowhere, he came. Same meaning but different ordering: non-Markovian. How do we understand that both sentences have similar meaning? Günay () Natural Language Processing II (Ch. 23) Spring 2013 2 / 18

So Probabilities Enough for Understanding Language? He came from out of nowhere. From out of nowhere, he came. Same meaning but different ordering: non-Markovian. How do we understand that both sentences have similar meaning? Look at sentence structure: “from out of nowhere” and “he came” Günay () Natural Language Processing II (Ch. 23) Spring 2013 2 / 18

So Probabilities Enough for Understanding Language? He came from out of nowhere. From out of nowhere, he came. Same meaning but different ordering: non-Markovian. How do we understand that both sentences have similar meaning? Look at sentence structure: “from out of nowhere” and “he came” Today: 1 Using sentence structure in NLP 2 Machine translation 3 Speech recognition (no time, see textbook) Günay () Natural Language Processing II (Ch. 23) Spring 2013 2 / 18

Entry/Exit Surveys Exit survey: Natural Language Processing I What is a good method for identifying foreign languages? How do we improve bag of words to learn word sequences? Entry survey: Natural Language Processing II (0.25 pts) Give some examples of why learning sentence structure may be useful. What was the most useful machine translation tool you ever used? Günay () Natural Language Processing II (Ch. 23) Spring 2013 3 / 18

Uses of Sentence Structure in NLP Can be useful for: Disambiguation of phrases Günay () Natural Language Processing II (Ch. 23) Spring 2013 4 / 18

Uses of Sentence Structure in NLP Can be useful for: Disambiguation of phrases Understanding meaning Günay () Natural Language Processing II (Ch. 23) Spring 2013 4 / 18

Uses of Sentence Structure in NLP Can be useful for: Disambiguation of phrases Understanding meaning Translation Günay () Natural Language Processing II (Ch. 23) Spring 2013 4 / 18

Disambiguation Strike a match. Günay () Natural Language Processing II (Ch. 23) Spring 2013 5 / 18

How Can We Use the Sentence Structure? Hint: Günay () Natural Language Processing II (Ch. 23) Spring 2013 6 / 18

How Can We Use the Sentence Structure? a Strike match Hint: Günay () Natural Language Processing II (Ch. 23) Spring 2013 6 / 18

How Can We Use the Sentence Structure? Verb Phrase Noun Phrase Verb Noun Noun a Strike match Hint: Günay () Natural Language Processing II (Ch. 23) Spring 2013 6 / 18

How Can We Use the Sentence Structure? Verb Phrase Noun Phrase Verb Noun Noun a Strike match Hint: Noun Noun Noun Noun Phrase Günay () Natural Language Processing II (Ch. 23) Spring 2013 6 / 18

Where Do the Trees Come From? Günay () Natural Language Processing II (Ch. 23) Spring 2013 7 / 18

Where Do the Trees Come From? From the forest? Günay () Natural Language Processing II (Ch. 23) Spring 2013 7 / 18

Multiple Possible Parsleys Parses, parsings, or parsleys (whatever) Günay () Natural Language Processing II (Ch. 23) Spring 2013 8 / 18

Multiple Possible Parsleys Parses, parsings, or parsleys (whatever) “strike a match” can be parsed as: 1 verb noun noun 2 noun noun noun 3 noun noun verb Günay () Natural Language Processing II (Ch. 23) Spring 2013 8 / 18

Multiple Possible Parsleys Parses, parsings, or parsleys (whatever) “strike a match” can be parsed as: 1 verb noun noun 2 noun noun noun 3 noun noun verb Problems? Günay () Natural Language Processing II (Ch. 23) Spring 2013 8 / 18

Multiple Possible Parsleys Parses, parsings, or parsleys (whatever) “strike a match” can be parsed as: 1 verb noun noun 2 noun noun noun 3 noun noun verb Problems? 1 Omitting a good parsley (false negative): #1 above Günay () Natural Language Processing II (Ch. 23) Spring 2013 8 / 18

Multiple Possible Parsleys Parses, parsings, or parsleys (whatever) “strike a match” can be parsed as: 1 verb noun noun 2 noun noun noun 3 noun noun verb Problems? 1 Omitting a good parsley (false negative): #1 above 2 Including a bad parsley (false positive): #2 or #3 above Günay () Natural Language Processing II (Ch. 23) Spring 2013 8 / 18

Multiple Possible Parsleys Parses, parsings, or parsleys (whatever) “strike a match” can be parsed as: 1 verb noun noun 2 noun noun noun 3 noun noun verb Problems? 1 Omitting a good parsley (false negative): #1 above 2 Including a bad parsley (false positive): #2 or #3 above Solutions? 1 Use probabilities 2 Use word associations 3 Unambiguous grammar Günay () Natural Language Processing II (Ch. 23) Spring 2013 8 / 18

Use Probabilities and Grammar Together context-free grammar: Words are expanded without context (e.g., S → VP | NP ). Used with programming languages. Günay () Natural Language Processing II (Ch. 23) Spring 2013 9 / 18

Use Probabilities and Grammar Together context-free grammar: Words are expanded without context (e.g., S → VP | NP ). Used with programming languages. “strike a match” The probabilistic grammar: S → VP ( 0 . 7 ) | NP ( 0 . 3 ) Günay () Natural Language Processing II (Ch. 23) Spring 2013 9 / 18

Use Probabilities and Grammar Together context-free grammar: Words are expanded without context (e.g., S → VP | NP ). Used with programming languages. “strike a match” The probabilistic grammar: S → VP ( 0 . 7 ) | NP ( 0 . 3 ) VP → V NP ( 0 . 6 ) | V ( 0 . 4 ) Günay () Natural Language Processing II (Ch. 23) Spring 2013 9 / 18

Use Probabilities and Grammar Together context-free grammar: Words are expanded without context (e.g., S → VP | NP ). Used with programming languages. “strike a match” The probabilistic grammar: S → VP ( 0 . 7 ) | NP ( 0 . 3 ) VP → V NP ( 0 . 6 ) | V ( 0 . 4 ) NP → N ( 0 . 6 ) | N N ( 0 . 3 ) | N N N ( 0 . 1 ) Günay () Natural Language Processing II (Ch. 23) Spring 2013 9 / 18

Use Probabilities and Grammar Together context-free grammar: Words are expanded without context (e.g., S → VP | NP ). Used with programming languages. “strike a match” The probabilistic grammar: S → VP ( 0 . 7 ) | NP ( 0 . 3 ) VP → V NP ( 0 . 6 ) | V ( 0 . 4 ) NP → N ( 0 . 6 ) | N N ( 0 . 3 ) | N N N ( 0 . 1 ) N → strike ( 0 . 4 ) | match ( 0 . 7 ) Günay () Natural Language Processing II (Ch. 23) Spring 2013 9 / 18

Use Probabilities and Grammar Together context-free grammar: Words are expanded without context (e.g., S → VP | NP ). Used with programming languages. “strike a match” The probabilistic grammar: S → VP ( 0 . 7 ) | NP ( 0 . 3 ) VP → V NP ( 0 . 6 ) | V ( 0 . 4 ) NP → N ( 0 . 6 ) | N N ( 0 . 3 ) | N N N ( 0 . 1 ) N → strike ( 0 . 4 ) | match ( 0 . 7 ) V → strike ( 0 . 6 ) | match ( 0 . 3 ) Günay () Natural Language Processing II (Ch. 23) Spring 2013 9 / 18

CS325 Artificial Intelligence Natural Language Processing II (Ch. - PowerPoint PPT Presentation

CS325 Artificial Intelligence Natural Language Processing II (Ch. 23) Dr. Cengiz Gnay, Emory Univ. Gnay () Natural Language Processing II (Ch. 23) Spring 2013 1 / 18 So Probabilities Enough for Understanding Language? He came from out of

CS325 Artificial Intelligence Natural Language Processing I (Ch. 22) Dr. Cengiz Gnay, Emory

Natural Language Processing Computational Linguistics Text processing Artificial Intelligence

Foundations of Artificial Intelligence 15. Natural Language Processing Understand, interpret,

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Introduction and

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Introduction and

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Common Lisp

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Common Lisp

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Hidden Markov

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Hidden Markov

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Wrap-Up and Exam

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Data Structures

Artificial Intelligence Games need opponents that are challenging, or allies that are helpful

Artificial Intelligence Opponents that are challenging, or allies that are helpful Unit

Embodied Machines Artificial vs. Embodied Intelligence Artificial Intelligence (AI)

CSE 473: Artificial Intelligence Advanced Applic's: Natural Language Processing Steve Tanimoto

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing More Common Lisp

Natural Language Processing Philipp Koehn 23 April 2020 Philipp Koehn Artificial Intelligence:

Natural Language Processing Philipp Koehn 27 April 2017 Philipp Koehn Artificial Intelligence:

Introduction to Artificial Intelligence Natural Language Processing Janyl Jumadinova November

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Common Lisp Core

CS 380: ARTIFICIAL INTELLIGENCE NATURAL LANGUAGE 12/04/2013 Santiago Ontan

Natural Language Processing Morphology Artificial Intelligence Lecture 7 Karim Bouzoubaa

Artificial Intelligence for Games IMGD 4000 Introduction to Artificial Intelligence (AI)

Introduction to Artificial Neural Networks Ahmed Guessoum Natural Language Processing and