Acquiring and Using World Knowledge using a Restricted Subset of English Peter Clark, Phil Harrison, Tom Jenkins, John Thompson, Rick Wojcik Boeing Phantom.

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

Ontologies: Dynamic Networks of Formally Represented Meaning Dieter Fensel: Ontologies: Dynamic Networks of Formally Represented Meaning, 2001 SW Portal.
Reading to Learn Q4 Review Peter Clark John Thompson Phil Harrison Bill Murray.
Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.
Psych 156A/ Ling 150: Acquisition of Language II Lecture 12 Poverty of the Stimulus I.
A Knowledge-Rich Approach to Understanding Text about Aircraft Systems Peter Clark Lisbeth Duncan Heather Holmback Tom Jenkins John Thompson Boeing Engineering.
CS440/ECE448: Artificial Intelligence
Research topics Semantic Web - Spring 2007 Computer Engineering Department Sharif University of Technology.
Ontologies and the Semantic Web by Ian Horrocks presented by Thomas Packer 1.
Semantics For the Semantic Web: The Implicit, the Formal and The Powerful Amit Sheth, Cartic Ramakrishnan, Christopher Thomas CS751 Spring 2005 Presenter:
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 2.
1 Information Retrieval and Extraction 資訊檢索與擷取 Chia-Hui Chang, Assistant Professor Dept. of Computer Science & Information Engineering National Central.
© Copyright 2011 John Wiley & Sons, Inc.
Agents that Reason Logically Logical agents have knowledge base, from which they draw conclusions TELL: provide new facts to agent ASK: decide on appropriate.
Lecture 1 Introduction: Linguistic Theory and Theories
Language Acquisition GST 400 Bethany Gilliam 04/10/06.
Statistical Natural Language Processing. What is NLP?  Natural Language Processing (NLP), or Computational Linguistics, is concerned with theoretical.
MACHINE TRANSLATION A precious key to communicate beyond linguistic barriers 1.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2005 Lecture 1 21 July 2005.
DCT 1123 PROBLEM SOLVING & ALGORITHMS INTRODUCTION TO PROGRAMMING.
Journaling in Math: Relevant? Useful? presented by Donna McLeish to Rockville Elementary School Teachers January 18, 2005.
Machine Reading as a Process of Partial Question-Answering Peter Clark and Phil Harrison Boeing Research & Technology June 2010.
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
Capturing and Answering Questions Posed to a Knowledge-Based System Peter Clark, John Thompson, William R Murray, Phil Harrison (Boeing) Jason Chaw, Bruce.
Author: James Allen, Nathanael Chambers, etc. By: Rex, Linger, Xiaoyi Nov. 23, 2009.
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
Author: William Tunstall-Pedoe Presenter: Bahareh Sarrafzadeh CS 886 Spring 2015.
Artificial intelligence project
Using Common Sense Reasoning to Create Intelligent Mobile Applications Software Agents Group MIT Media Lab.
Push Singh & Tim Chklovski. AI systems need data – lots of it! Natural language processing: Parsed & sense-tagged corpora, paraphrases, translations Commonsense.
Interpreting Dictionary Definitions Dan Tecuci May 2002.
The Reading to Learn Project Peter Clark Phil Harrison Tom Jenkins John Thompson Rick Wojcik (Boeing Phantom Works) David Israel (SRI)
LDK R Logics for Data and Knowledge Representation Modeling First version by Alessandro Agostini and Fausto Giunchiglia Second version by Fausto Giunchiglia.
AN IMPLEMENTATION OF A REGULAR EXPRESSION PARSER
Markov Logic and Deep Networks Pedro Domingos Dept. of Computer Science & Eng. University of Washington.
LOD for the Rest of Us Tim Finin, Anupam Joshi, Varish Mulwad and Lushan Han University of Maryland, Baltimore County 15 March 2012
Notes on Motion VI Free Fall A Special type of uniform acceleration.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Reading to Learn Q1 review (7/6/05) Peter ClarkMichael Glass Phil HarrisonTom Jenkins John ThompsonRick Wojcik Boeing Phantom Works.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
Artificial Intelligence: Natural Language
Boeing’s Language Understanding Engine (BLUE) and its Performance on the Shared Task Peter Clark, Phil Harrison, (Boeing Phantom Works)
SME2Logic Translation - an initial approach Peter Clark Boeing Company.
Of 33 lecture 1: introduction. of 33 the semantic web vision today’s web (1) web content – for human consumption (no structural information) people search.
What is Communicative Language Teaching??. Communicative Language: Blends listening, speaking, reading, and writing. Is the expression, interpretation,
Semantic web Bootstrapping & Annotation Hassan Sayyadi Semantic web research laboratory Computer department Sharif university of.
Attempto Controlled English Norbert Fuchs et al. Dept CS, Univ Zurich, Switzerland as (mis-)interpreted by Peter Clark.
The Unreasonable Effectiveness of Data
BLUE (Boeing Language Understanding Engine) - A Quick Tutorial on How it Works Working Note Peter Clark Phil Harrison (Boeing Phantom Works)
1 UNIT-3 KNOWLEDGE REPRESENTATION. 2 Agents that reason logically(Logical agents) A Knowledge based Agent The Wumpus world environment Representation,
GoRelations: an Intuitive Query System for DBPedia Lushan Han and Tim Finin 15 November 2011
Artificial Intelligence Knowledge Representation.
Writing in English Academic Writing.
Rule-based Reasoning in Semantic Text Analysis
Artificial Intelligence 4. Knowledge Representation
CS 4700: Foundations of Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence
Peter Clark Phil Harrison (Boeing Phantom Works)
Lecture 2 Introduction to Programming
Introduction to Algorithm – part 1
Algorithm and Ambiguity
Illustrations of different approaches Peter Clark and John Thompson
Algorithm and Ambiguity
Ontology-Based Approaches to Data Integration
The Winograd Schema Challenge Hector J. Levesque AAAI, 2011
Presentation transcript:

Acquiring and Using World Knowledge using a Restricted Subset of English Peter Clark, Phil Harrison, Tom Jenkins, John Thompson, Rick Wojcik Boeing Phantom Works, Seattle

Introduction Knowledge acquisition is still a major bottleneck –automated methods are good but still very restricted Our approach: –Knowledge entry using Controlled Language –Hits “sweet spot” between logic and full NLP –language interpreter generates logic output Outline: 1.Our Controlled Language Processing technology 2.Discussion on Natural Language as a basis for KR

Formal language Unrestricted natural language Controlled English “Consider the following possible situation in which a ball first…” too hard for the computer to understand “A ball falls from a cliff” “  x  y B(x)  R(x,y)  C(y)” too hard for the user The Language Spectrum

An object is thrown with a horizontal velocity of 20 m/s from a cliff that is 125 m above level ground. If air resistance is negligible, how long does it take the object to fall to the ground? CPL (Computer-Processable Language) Original text (incomprehensible to computer): An object is thrown from a cliff. The horizontal velocity of the object is 20 m/s. The top of the cliff is 125 m above level ground. The object falls 125 m to the ground. What is the duration of the fall? Rewritten in CPL (computer can understand): Short sentencesNo pronouns Simple sentence structures

Target Interpretation Sentences in first-order logic Capable of supporting machine inference “An object is thrown from a cliff” ObjectCliff Throw object origin isa(_Object1, object_n1) isa(_Cliff2, cliff_n1) isa(_Throw3, throw_v1) object(_Throw3, _Object1) origin(_Throw3, _Cliff2)

Target Interpretation Sentences in first-order logic Capable of supporting machine inference “a person is carrying an entity that is inside a room” PersonObject Carry agent object isa(_Person1, person_n1) isa(_Room2, room_n1) isa(_Entity3, entity_n1) isa(_Carry4, carry_v1) object(_Carry4, _Entity3) agent(_Carry4, _Person1) is-inside(_Entity4, _Room2) =====> is-inside(_Person1, _Room2) Room is-inside “the person is in the room.” IF THEN

Overview of Processing “An object is thrown from a cliff” Parser & LF Generator Word sense disambiguator Relational disambiguator Coreference identifier Structural reorganizer ObjectCliff Throw object origin (_Object13320 instance_of object_n1) (_Cliff13321 instance_of cliff_n1) (_Throw13319 instance_of throw_v1) (_Throw13319 object _Object13320) (_Throw13319 origin _Cliff13321) World Knowledge Linguistic Knowledge

Entering Quantified Expressions (Rules) Seven “rule templates” used: IF sentence THEN sentence ABOUT object: sentence object IS noun/verb phrase BEFORE sentence, sentence BEFORE sentence, it is not true that sentence AFTER sentence, sentence AFTER sentence, it is not true that sentence Processing: 1.Each sentence processed as a ground assertion 2.Quantifiers are added (Prolog-style) 3.“Action” templates become situation calculus rules

Original text An object is thrown from a cliff. The horizontal velocity of the object is 20 m/s. The top of the cliff is 125 m above level ground. CPL (Controlled english) LogicKB Overall Flow of Processing Paraphrase of system’s understanding An object is thrown from a cliff. The horizontal velocity of the object is 20 m/s. The top of the cliff is 125 m above level ground. Rewriting advice

Part II: Discussion Controlled Languages: Strengths and challenges

Strengths… CPL is easy to use, appears viable –built KB with over 1000 rules –KB is inference-capable easy to inspect and organize Makes knowledge entry accessible to many users – major achievement  x  y B(x)  R(x,y)  C(y)??? “A man is driving a truck towards the factory”

Challenges: 1. Reformulating in a Controlled Language is not trivial Task is not just grammatical reformulation Rather: – “natural” English leaves much knowledge implicit –CPL author must make that explicit “attack: intense adverse criticism” Original text: “IF a person attacks a 2 nd person THEN the first person criticizes the 2 nd person intensely.” CPL:

Challenges: 1. Reformulating in a Controlled Language is not trivial Task is not just grammatical reformulation Rather: – “natural” English leaves much knowledge implicit –CPL author must make that explicit “axis: the center around which something rotates” Original text: “IF an object is rotating THEN the object is turning around the object’s axis.” CPL:

2. Users may not be aware of system’s mistakes 1.User must be able to spot misinterpretations easily –System’s paraphrase must be unambiguous 2.User must know how to correct them “The man ate the sandwich on the plate” “The man ate on the plate. He ate the sandwich.” ??????

2. Users may not be aware of their mistakes User must be able to spot errors easily –System’s paraphrase must be unambiguous User must know how to correct them “The man ate the sandwich on the plate” “The man ate on the plate. He ate the sandwich.”“the man ate the sandwich that was on the plate”

3. Natural-Language-based knowledge representations have limited expressivity “Natural language is very expressive” …not to the computer! (Avoid “wishful semantics”) Expressiveness = –the amount the computer understands –the amount it is able to use to draw conclusions from Everything else is meaningless to the computer e.g., CPL can’t express: –constraints, defaults, some quantification patterns

4. Sometimes, linguistically motivated representations are poor Language-based KR: –Most concepts correspond to words –Structure of KB will mirror structure of language Is this bad? Sometimes… “… walked for 10 miles” “Traditional” KR distance(_Walk1, _Distance1) value(_Distance1, 10, mile) distance(_Walk1, _Mile1) count(_Mile1, 10) NL-based KR 

5. (Lack of) Canonicalization Many ways to say the same thing System needs to realize the equivalence BUT: often NL-based KRs will not  Solutions: Add equivalence rules. (But there are lots!!) –e.g., “Conducting a X of Y ↔ Xing a Y” Have the interpreter normalize the input. Restrict the input language. “conducting a test of an entity” “testing an entity”

Summary CPL = a restricted English language for knowledge –Hits “sweet spot” between logic and full NLP –Produces inference-capable representations –Is viable, used to build a large KB But: No “free lunch” –requires skill to use it effectively NL-based KRs are becoming more important! –Web: need semantically meaningful annotations –AI: need better knowledge acquisition tools Some exciting possibilities ahead (esp. at Boeing!)