What is NLG? NLG "is the process of deliberately constructing a natural language text in order to meet specified communicative goals". [McDonald 1992]

Slides:



Advertisements
Similar presentations
Chapter 5: Tree Constructions
Advertisements

REVIEW : Planning To make your thinking more concrete, use a real problem to ground your discussion. –Develop a plan for a person who is getting out of.
A System to Generate Test Data and Symbolically Execute Programs Lori A. Clarke September 1976.
December 2003CSA3050: Natural Language Generation 1 What is Natural Language Generation? When is NLG an Appropriate Technology? NLG System Architectures.
COMPUTER PROGRAMMING I Understand Problem Solving Tools to Design Programming Solutions.
Junction Trees And Belief Propagation. Junction Trees: Motivation What if we want to compute all marginals, not just one? Doing variable elimination for.
Software Design Deriving a solution which satisfies software requirements.
Natural Language Generation: Discourse Planning
Chapter 20: Natural Language Generation Presented by: Anastasia Gorbunova LING538: Computational Linguistics, Fall 2006 Speech and Language Processing.
Robot Navigation based on the Mapping of Coarse Qualitative Route Descriptions to Route Graphs Motivation Outline Global World Knowledge Local Path Planning.
APT0203Lecture 41 Proposed Architecture GIS Map Query Path Planner Sentence Plan Message Based Plan Path Based Plan Text PlannerSentence Planner Text Realisation.
A Pipelined Architecture Document Planning Microplanning Surface Realisation Document Plan Text Specification.
Winter 2007SEG2101 Chapter 41 Chapter 4 SDL – Structure and Behavior.
Computer Software & Software Development H&K Chapter 1 Instructor – Gokcen Cilingir Cpt S 121 (June 20, 2011) Washington State University.
Detailed Design Kenneth M. Anderson Lecture 21
Automated rule Generation Maryam Mustafa Sarah Karim
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 15 Instructor: Paul Beame.
© 2005 by Prentice Hall Chapter 9 Structuring System Requirements: Logic Modeling Modern Systems Analysis and Design Fourth Edition.
Chapter 2: Algorithm Discovery and Design
Chapter 2: Algorithm Discovery and Design
Authentic Task Design in English for Tourism---Asking for and Giving Directions Shu-Yin Cheng 鄭舒尹 Workshop on ESP Professional Development,
Generating Directions1 Lecture 2 Map Data Path Based Plan.
An Information Theory based Modeling of DSMLs Zekai Demirezen 1, Barrett Bryant 1, Murat M. Tanik 2 1 Department of Computer and Information Sciences,
Chapter 9 Database Planning, Design, and Administration Sungchul Hong.
Implementation Yaodong Bi. Introduction to Implementation Purposes of Implementation – Plan the system integrations required in each iteration – Distribute.
Knowledge-rich approaches for text summarization Minna Vasankari
Invitation to Computer Science, Java Version, Second Edition.
Introduction to problem solving. Introductory Discussion? What problems are you faced with daily? Do you think a computer can be designed to solve those.
PROGRAMMING. Objectives Define the term program List and explain the steps involved in developing a program.
Object Management Group (OMG) Specifies open standards for every aspect of distributed computing Multiplatform Model Driven Architecture (MDA)
CMSC 1041 Algorithms III Problem Solving and Pseudocode.
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
9-1 © Prentice Hall, 2007 Chapter 9: Analysis Classes Object-Oriented Systems Analysis and Design Joey F. George, Dinesh Batra, Joseph S. Valacich, Jeffrey.
Discovering object interaction. Use case realisation The USE CASE diagram presents an outside view of the system. The functionality of the use case is.
1 Text Reference: Warford. 2 Computer Architecture: The design of those aspects of a computer which are visible to the programmer. Architecture Organization.
System Testing Beyond unit testing. 2 System Testing Of the three levels of testing, system level testing is closest to everyday experience We evaluate.
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Computer Programming I Summer 2011
L10 – Map labeling algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems L10- Map labeling algorithms by: Sadegh Jamali (source: Lecture.
The Interpreter Pattern (Behavioral) ©SoftMoore ConsultingSlide 1.
Ferdowsi University of Mashhad 1 Automatic Semantic Web Service Composition based on owl-s Research Proposal presented by : Toktam ghafarian.
© 2005 by Prentice Hall Chapter 9 Structuring System Requirements: Logic Modeling Modern Systems Analysis and Design Fourth Edition Jeffrey A. Hoffer Joey.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
How Computers Solve Problems Computers also use Algorithms to solve problems, and change data into information Computers can only perform one simple step.
FLOW CHARTS IN PROCESS DESCRIPTION FRANK CHINGARANDE.
CMSC 104, Version 8/061L05Algorithms2.ppt Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode Control Structures Reading Section 3.1.
Understand Problem Solving Tools to Design Programming Solutions
Software Testing.
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Understand Problem Solving Tools to Design Programming Solutions
Introduction to Computer Programming
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
UMBC CMSC 104 – Section 01, Fall 2016
STATE SPACE REPRESENTATION
Chapter 10: Process Implementation with Executable Models
Chapter 9 Structuring System Requirements: Logic Modeling
2008/09/22: Lecture 5 CMSC 104, Section 0101 John Y. Park
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
STATE SPACE REPRESENTATION
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Chapter 6 Network Flow Models.
Generating Directions
Chapter 9 Structuring System Requirements: Logic Modeling
National Geographic Reach for Reading
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode
Presentation transcript:

What is NLG? NLG "is the process of deliberately constructing a natural language text in order to meet specified communicative goals". [McDonald 1992] Input: some underlying non-linguistic representation of information. Output: NL text, (speech/gesture/image).

Why Use NLG? There is content to be conveyed to user. Content is represented in a way that is incomprehensible when directly presented to end user. Content to be conveyed can be effectively understood in the form of an NL message. Too much variability between initial representation of content and corresponding NL message for "mail-merge" style solution.

Key Paper Robert Dale, Sabine Geldof and Jean- Philippe Prost, 2002, Generating more natural route descriptions, ANLP2002 (see pdf available on website). Contrasts route descriptions generated by mapblast (see

Mail-Merge Style Route Description

Natural Route Description Leave the house and drive towards the Midway shops, at the end of the street turn right and then left at the roundabout. Drive along North road and take the third right turn, just after the 1st hump in the road. Go to the end of that road and then go straight ahead at the roundabout, there's a church on your left.

Differences 1.Humans often omit steps that automated systems include. 2.Humans typically include landmarks to identify turning points; automated systems describe points using distances/times from other points. 3.Humans typically produce complex clause structures. Automated systems produce a series of one-shot sentences.

Humans often omit steps... Continue over roundabout exiting on 398 Continue on 398 and go 1.1 miles Continue on roundabout exiting on 398 Continue on 398 and go 1.7 miles Continue over roundabout exiting on Strada Cantonale, 398

Proposed Architecture GIS Map Query Path Planner Sentence Plan Message Based Plan Path Based Plan Text PlannerSentence Planner Text Realisation

Path Planner Input: –query: description of start and end nodes. –map data Output: –path-based plan, i.e. sequence of arcs that join start node to end node. Algorithm: –search for spanning path –arc aggregation: a single output arc may correspond to several steps on the map.

Text Planner Input –sequence of paths on map Output –a message-based plan, ie a structure of messages from the underlying data source A message is "a piece of domain-specific semantic content that can be realised linguistically". corresponding to the largest linguistic fragments we need to generate the variety of texts that interest us. Different types of message.

Message Types Dale et-al. distinguishes between Points: –buildings, landmarks, objects Directions: –instructions to change direction Paths –continuous movements.

Messages are Formal Objects which can be linguistically realised { type: point nodeID: n21330 pointtype: start name: "Liverpool Street" poi: [n100, n102] }

Realised Message-Based Plan 1.Start at Liverpool Street. 2.Follow Liverpool Street for 86 meters. 3.You are at George Street. 4.Turn right. 5.Follow George Street for 230 meters. 6.You are at Bathurst Street. 7.Turn left. 8.Follow Bathurst Street for 8 meters. 9.You have arrived at your destination. 1.Point 2.Path 3.Point 4.Direction 5.Path 6.Point 7.Direction 8.Path 9.Point

Sentence Planner Input –Message-based plan steps, e.g. Start at Liverpool Street. Follow Liverpool Street for 86 meters. Output –Sentence based plan steps e.g. Start at Liverpool Street and follow it for 86 meters. Strategies –aggregation –referring expression generation

Aggregation Strategies in Sentence Planning Aggregation: building clauses which communicate several pieces of information at once. Path+Point: fold description of a point into the description of a path in order to identify end- point of path. carry on straight until you reach the square Point+Direction: Combine turn direction with specification of location where instruction is to be executed. when you reach the church turn left

Referring Expression Generation Develop strategies for different types of object, e.g. When referring to junction points: –use a landmark that is near the junction –use the type of the intersection –use the name of the intersecting street

Linguistic Realisation All strategic decisions mentioned so far are carried out with respect to data objects, not actual pieces of text. Last phase will be "realising" data object as an actual series of sentences.