Dialog Input Ranking in a Multi-Domain Environment Using Transferable Belief Model

Similar documents
Natural language processing implementation on Romanian ChatBot

arxiv: v1 [cs.dl] 22 Dec 2016

Management Science Letters

Fuzzy Reference Gain-Scheduling Approach as Intelligent Agents: FRGS Agent

'Norwegian University of Science and Technology, Department of Computer and Information Science

Application for Admission

Consortium: North Carolina Community Colleges

E-LEARNING USABILITY: A LEARNER-ADAPTED APPROACH BASED ON THE EVALUATION OF LEANER S PREFERENCES. Valentina Terzieva, Yuri Pavlov, Rumen Andreev

HANDBOOK. Career Center Handbook. Tools & Tips for Career Search Success CALIFORNIA STATE UNIVERSITY, SACR AMENTO

CONSTITUENT VOICE TECHNICAL NOTE 1 INTRODUCING Version 1.1, September 2014

part2 Participatory Processes

VISION, MISSION, VALUES, AND GOALS

2014 Gold Award Winner SpecialParent

On March 15, 2016, Governor Rick Snyder. Continuing Medical Education Becomes Mandatory in Michigan. in this issue... 3 Great Lakes Veterinary

also inside Continuing Education Alumni Authors College Events

DERMATOLOGY. Sponsored by the NYU Post-Graduate Medical School. 129 Years of Continuing Medical Education

Probabilistic Latent Semantic Analysis

Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for

A Comparison of Two Text Representations for Sentiment Analysis

Learning Methods in Multilingual Speech Recognition

Linking Task: Identifying authors and book titles in verbose queries

Switchboard Language Model Improvement with Conversational Data from Gigaword

Rule Learning With Negation: Issues Regarding Effectiveness

re An Interactive web based tool for sorting textbook images prior to adaptation to accessible format: Year 1 Final Report

Using dialogue context to improve parsing performance in dialogue systems

AUTOMATIC DETECTION OF PROLONGED FRICATIVE PHONEMES WITH THE HIDDEN MARKOV MODELS APPROACH 1. INTRODUCTION

Analysis of Emotion Recognition System through Speech Signal Using KNN & GMM Classifier

MULTILINGUAL INFORMATION ACCESS IN DIGITAL LIBRARY

Exposé for a Master s Thesis

Speech Emotion Recognition Using Support Vector Machine

A Case Study: News Classification Based on Term Frequency

Full text of O L O W Science As Inquiry conference. Science as Inquiry

Georgetown University at TREC 2017 Dynamic Domain Track

Predicting Student Attrition in MOOCs using Sentiment Analysis and Neural Networks

Predicting Students Performance with SimStudent: Learning Cognitive Skills from Observation

Class-Discriminative Weighted Distortion Measure for VQ-Based Speaker Identification

& Jenna Bush. New Children s Book Authors. Award Winner. Volume XIII, No. 9 New York City May 2008 THE EDUCATION U.S.

Rule discovery in Web-based educational systems using Grammar-Based Genetic Programming

Reducing Features to Improve Bug Prediction

OCR for Arabic using SIFT Descriptors With Online Failure Prediction

Rule Learning with Negation: Issues Regarding Effectiveness

4 th Grade Number and Operations in Base Ten. Set 3. Daily Practice Items And Answer Keys

Vocabulary Usage and Intelligibility in Learner Language

Objectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition

Detecting Wikipedia Vandalism using Machine Learning Notebook for PAN at CLEF 2011

Speech Recognition at ICSI: Broadcast News and beyond

SARDNET: A Self-Organizing Feature Map for Sequences

Memory-based grammatical error correction

New Features & Functionality in Q Release Version 3.2 June 2016

Assignment 1: Predicting Amazon Review Ratings

Laboratorio di Intelligenza Artificiale e Robotica

Language Independent Passage Retrieval for Question Answering

A student diagnosing and evaluation system for laboratory-based academic exercises

Product Feature-based Ratings foropinionsummarization of E-Commerce Feedback Comments

Parnell School Parnell, Auckland. Confirmed. Education Review Report

Test Effort Estimation Using Neural Network

Transfer of Training

Unit purpose and aim. Level: 3 Sub-level: Unit 315 Credit value: 6 Guided learning hours: 50

Acquiring Competence from Performance Data

arxiv: v1 [cs.cl] 2 Apr 2017

Characteristics of the Text Genre Realistic fi ction Text Structure

Variations of the Similarity Function of TextRank for Automated Summarization

Assessing System Agreement and Instance Difficulty in the Lexical Sample Tasks of SENSEVAL-2

USER ADAPTATION IN E-LEARNING ENVIRONMENTS

Laboratorio di Intelligenza Artificiale e Robotica

FUZZY EXPERT. Dr. Kasim M. Al-Aubidy. Philadelphia University. Computer Eng. Dept February 2002 University of Damascus-Syria

Bridging Lexical Gaps between Queries and Questions on Large Online Q&A Collections with Compact Translation Models

Cross-Lingual Text Categorization

*Lesson will begin on Friday; Stations will begin on the following Wednesday*

Word Segmentation of Off-line Handwritten Documents

10 Tips For Using Your Ipad as An AAC Device. A practical guide for parents and professionals

Automating Outcome Based Assessment

Running head: DELAY AND PROSPECTIVE MEMORY 1

Learning Methods for Fuzzy Systems

INPE São José dos Campos

Combining a Chinese Thesaurus with a Chinese Dictionary

POS tagging of Chinese Buddhist texts using Recurrent Neural Networks

Answer the following questions in complete sentences on a separate sheet of paper:

AUTOMATED TROUBLESHOOTING OF MOBILE NETWORKS USING BAYESIAN NETWORKS

SEMAFOR: Frame Argument Resolution with Log-Linear Models

Mining Topic-level Opinion Influence in Microblog

QuickStroke: An Incremental On-line Chinese Handwriting Recognition System

Grammar Lesson Plan: Yes/No Questions with No Overt Auxiliary Verbs

Distant Supervised Relation Extraction with Wikipedia and Freebase

On the Formation of Phoneme Categories in DNN Acoustic Models

What s in a Step? Toward General, Abstract Representations of Tutoring System Log Data

What is Initiative? R. Cohen, C. Allaby, C. Cumbaa, M. Fitzgerald, K. Ho, B. Hui, C. Latulipe, F. Lu, N. Moussa, D. Pooley, A. Qian and S.

AQUA: An Ontology-Driven Question Answering System

Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining

Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining

Cal s Dinner Card Deals

arxiv: v1 [cs.lg] 3 May 2013

Loughton School s curriculum evening. 28 th February 2017

SINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF)

Agent-Based Software Engineering

Experiments with SMS Translation and Stochastic Gradient Descent in Spanish Text Author Profiling

A Web Based Annotation Interface Based of Wheel of Emotions. Author: Philip Marsh. Project Supervisor: Irena Spasic. Project Moderator: Matthew Morgan

Genre classification on German novels

How to read a Paper ISMLL. Dr. Josif Grabocka, Carlotta Schatten

1. READING ENGAGEMENT 2. ORAL READING FLUENCY

Transcription:

Dialog Iput Rakig i a Multi-Domai Eviromet Usig Trasferable Belief Model Hog-I Ng Departmet of Computer Sciece School of Computig Natioal Uiversity of Sigapore ghi@comp.us.edu.sg Kim-Teg Lua Departmet of Computer Sciece School of Computig Natioal Uiversity of Sigapore luakt@comp.us.edu.sg Abstract This paper presets results of usig belief fuctios to rak the list of cadidate iformatio provided i a oisy dialogue iput. The iformatio uder cosideratio is the iteded to be performed ad the iformatio provided for the completio of the. As a example, we use the of iformatio access i a multi-domai dialogue system. Curretly, the system cotais kowledge of te differet domais. Cers cig i are greeted with a ope-eded How may I help you? prompt (Thomso ad Wisowaty, 1999; Chu-Carroll ad Carpeter, 1999; Gori et al., 1997). After receivig a reply from the cer, we extract word evideces from the recogized utteraces. By usig trasferable belief model (TBM), we i tur determie the that the cer iteds to perform as well as ay iformatio provided. 1 Itroductio Touch-toe meus are prevalet i c ceters for accessig persoal records ad pre-recorded iformatio. However, it ca sometimes be very frustratig whe we eed to liste to a log list of optios. Moreover, the iformatio that we are lookig for may ot seem to be relevat to ay of the give optios. Recetly, systems that ow people to access iformatio based o spoke iputs have bee built. They require a speech recogizer that is traied o a specific set of key words ad speech grammars to uderstad the spoke iputs. Cers are guided through a series of prompts. At each prompt, the cers are supposed to speak out their choices i a way that is easy for the systems to uderstad. However, ew cers may ot kow what should they say at differet prompts ad how should they say it. They might have spoke their choices too early, or the way they say it is ot ecoded i the systems grammar. Thus, we are motivated to work o the problem of accessig iformatio usig atury spoke dialogue. We ow cers to speak i a atural way. Our ultimate aim is to provide the cer with the exact piece of iformatio that s/he is lookig for through a series of dialogue iteractio. The work reported i this paper is our first attempt toward our ultimate aim, i.e., to determie what the cers wat ad fid out the iformatio the cers have provided that are useful for the. To achieve that, we use Smets (1988) TBM. TBM is the cocept used to justify the use of belief fuctios (BFs), Dempster s rule of coditioig ad Dempster s rule of combiatio to model someoe s belief (Smets, 1988). Sice early 19 s, BFs have geerated cosiderable iterest i the Artificial Itelligece commuity. I Smets (1999), Deœux (000) ad Zouhal ad Deœux (1998), BFs are used to provide soud ad elegat solutios to real life problems where some iformatio is missig. As i Bayesia model, give the available evideces, parts of the amout of belief are ocated to each object i our problem domai. However, some evideces might support somethig other

tha oly oe of the various domai objects. I this case, Priciple of Isufficiet Reaso (Smets, 1988) is ivoked to decide that the belief mass must be split equy amog the domai objects ivolved. TBM does ot evoke this priciple ad leaves the belief mass ocated to the disjuct of the domai objects ivolved. Examples of the use of BFs iclude discrimiat aalysis usig a learig set where classes are oly partiy kow; determie the umber of sources i a multi-sesor eviromet by studyig the iter-sesors cotradictio ad patter classificatio. As far as we kow, obody has used BFs to solve problems related to huma-computer coversatioal dialogue. However, we belief that BFs ca be applied o problems related to huma-computer coversatioal dialogue, where the recogized utteraces cotai isertio, deletio ad substitutio errors. Curretly, our multi-domai dialogue system cotais kowledge of te differet domais. They are phoe directory service (T ), trai schedule iquiry (T ), flight status iquiry (T ), travel bookig (T ), Bus Service iquiry (T ), fiacial plaig (T ), phoe bakig (T ), checkig of the employee s accout (T ), cocert ticket bookig (T ) ad course registratio (T ). Similar works have bee reported is the past. However, their mai aim is to do c routig istead of iformatio access. Their approaches iclude the use of a vector-based iformatio retrieval techique (Lee et al., 000; Chu-Carroll ad Carpeter, 1999) /bi/bash: lie 1: a: commad ot foud Our domais are more varied, which may results i more recogitio errors. I additio, we do ot have a traiig corpus. However, we have a kowledge base that provides partial iformatio based o word evideces. For examples, the occurrece of word evidece accout idicates that the user wats to access her/his employee s accout or bak accout, the occurrece of a perso ame idicates that the user is ot checkig for a flight status or bus service, the occurrece of word evidece time idicates that the user probably wats to check the trai schedules or flight status. Due to space limitatio, readers are advised to refer to Smets (1988; 1997; 1989) for more detailed discussios o BFs, combiatio of BFs, decisio makig usig BFs ad TBM. Rakig Iformatio from the Recogized Utterace of Natury Spoke Iput Our aim is to use TBM i dialogue maagemet. First, TBM is used to rak the iformatio idetified from the recogized iput. The, the rak list is used i clarificatio dialogues if ecessary. Otherwise, the best result is treated as the user iput. Our experimets are doe usig Sphix II speech recogitio system (Huag et al., 199). Usig a test corpus of 1977 words, we fid that the word recogitio accuracy is 54.5%. I our experimets, we use 139 atury spoke resposes to a ope-eded How may I help you prompt prompt. The cers are told i advace the list of s that the system ca perform. As otatios, let U deotes a recogized utterace, the legth of U i umber of words ad the word evideces from U..1 Idetifyig the Iteded Task I this experimet, we show whether TBM ca be used to idetify the cer s iteded s. First, we eed to idetify our problem domai or frame of discermet, (Smets, 1988). For idetificatio,! #" $%&'(*), i.e., the list of s preseted i Sectio 1. +-,/. 3, i.e., the basic belief mass (bbm) of give to where 5476#8 is calculated based o the occurrece frequecy of word evidece i the kowledge-bases of /9$:'(. Curretly the kowledge base ; of each! <$= '( cosists of (a) a specificatio; (b) iformatio s for / ; ad (c) iformatio for, i.e., the database records, facts ad rules, ad remote tables ad databases used i /. A specificatio specifies the goal of the ad the list of steps required to attai the goal. Each step is liked to either a basic operatio, for examples, fetch some records from a database ad ask the cer for iformatio, or a sub-. Iformatio s specify the highlevel formats of the iformatio used i >. They iclude database s, XML s of facts ad rules, ad format descriptios of some remote tables ad databases used i. We do idexig for each ;$%'( so that it is easy to calculate the bbm s +,/. 0? where @A ad 4B698. We the do the followig adjustmets to make sure that CEDGF DIH 8 +,/. 0KJ %L : if

+ 8 CEDIF DGH 8 +,. 0KJ, the the BF +,. is scaled to oe; otherwise, +,. 0 8 3 C DIF DGH 8 +,. 0KJ where 8. +,/. 0 8 is also ced the igorace value relative to (Smets, 1988). implies that it is harder to decide Larger +,. 8 which is the iteded of the cer by lookig at evidece. The BF s +,. are the combied usig Dempster s rule of combiatio, +,., 0KJ C D +,/. 0 +, 0 where J ad L$. +,/.,, is computed by combiig +,/., ad +,. Lastly,! <$ '( are raked i descedig order accordig to their pigistic probability measure "!$#&% 0 C(' H 8 ) '.- ', * +,3,54 '64 with the top of the rak * +0/1 beig the most probable target. Experimet results will be preseted i Sectio 3.1.. Idetifyig the Provided Iformatio I this experimet, we show whether TBM ca be used to idetify the iformatio provided by the cer i U. Here, the frame of discermet 0798;: cosists of the objects i the iformatio s for a specific. As i Sectio.1, we use the idices of ;9$ 4 '( to compute the bbm s of give to each object disjuct <>= 4 698.@?"A B. Lastly, we combie the BFs +,. ad compute the pigistic probability measures of each object < 4 07C8;:. Experimet results will be preseted i Sectio 3.. 3 Experimet Results 3.1 Idetifyig the Iteded Task 0 ifo + +ifo +ifo 1 3 4 5 6 7 8 9 Figure 1: Percetage of time the correct is icluded whe cosiderig the top raked s. Figure 1 shows the results of selectig top--s i the raked list of / <$ '(. The labels, ad ifo deote that oly kowledge i the specificatios, iformatio s ad basic iformatio respectively are icluded i the calculatio of bbm s. + deotes a combiatio of some ad deotes the combiatio of. The graphs show that we obtai the best rakig of cadidate s whe kowledge from specificatios ad iformatio s are used to calculate the BF s. This is ituitive because cers will ofte say her/his goal ad metio the ame of the piece of iformatio s/he s lookig for, e.g., I wat to buy a movie ticket please. 0 ifo + +ifo +ifo 1 3 4 5 6 7 8 9 Figure : Percetage of time the correct is icluded whe cosiderig the top raked s, takig similar words ito cosideratios. Next, we examie the result of takig similar words ito cosideratios. This is because cers may use words differet from those occurrig i our kowledge base. Thus, for each word evidece i D, we use WordNet (Fellbaum, 1997) to look for similar words FE $- G i our kowledge base. For each E $%G, we calculate the BF +,H. as discussed i Sectio.1. This time, we also multiply the bbm s i +,H. by the distace measure betwee E ad. The distace measures f i the rage [0:1]. These results are show i Figure. Agai, the results show that we obtai the best rakig of cadidate s whe kowledge from specificatios ad iformatio s are used to calculate the BF s. However, there is a decrease i correct rate whe oly the best (-6.5%) ad -best (-1.58%) s i the raked list are used to ow

0 ifo + +ifo +ifo 1 3 4 5 6 7 8 9 ifo + +ifo +ifo 1 3 4 5 6 7 8 9 Figure 3: Percetage of time the correct is icluded whe cosiderig the top raked s, takig similar words ad correlatio measures ito cosideratio. the cers to select. The correct rate is icreased oly whe more tha top-rakig s are used for cers selectio, i.e., 4.38%, 1.3%,.66% ad 1.3% whe = 3, 4, 5 ad 6 respectively. From the results, we foud that some words occur commoly across multiple domais. This pheomea is commo i problems related to atural laguage processig. To eviate the problem, we have used words that oly occur commoly i few domais. We use correlatio coefficiet (Ng et al., 1997) to measure the correlatios of words to domais. After that, we scale the correlatio measures to 1. I calculatig the bbm s, we multiply the origial bbm s with the correspodig correlatio measures. Figure 3 shows the results whe similar words ad correlatio measures are cosidered i the calculatio of BF s. This time, the results show that we obtai the best rakig of cadidate s whe kowledge from specificatios ad basic iformatio are used to calculate the BF s. I additio, there is a 67.31% improvemet whe the top i the raked list is take as the cer s iteded s. Whe top- s are used for cers selectio, the improvemets are.5%, 9.53% ad 16.76% for =, 3 ad 4 respectively. For the purpose of compariso, we show the results of idetificatio based o dialogue trascripts, similar words ad correlatio measures i Figure 4. The results show that with the use of oly basic iformatio i the calculatio of BF s, a result of 99.1% ca be achieved by select the top Figure 4: Percetage of time the correct is icluded whe cosiderig the top raked s usig dialogue trascripts, similar words ad correlatio measures. i the raked list. Thus, whe the word accuracy of the speech recogizer is high, basic iformatio is sufficiet to idetify the cers iteded s. Otherwise, kowledge from specificatios ad iformatio are required i target idetificatios. We have show that TBM ca be used for idetificatio i a oisy ad multi-domai eviromet. It would be iterestig to compare these results whe we have eough corpus to trai a vector-based idetifier. 3. Idetifyig the Provided Iformatio Figure 5 shows the percetage of time the correct iformatio is icluded i the top- selected iformatio after they have bee sorted accordig to their pigistic probability measures. SR-best-1 (SR-best-) idicates that the best (respectively, two best) speech recogitio results are used for iformatio idetificatio. The results show that there is a 14.5% (.54%) improvemet whe the best (respectively, two best) speech recogitio results are used for iformatio idetificatio. Trascript idicates that the dialogue trascripts are used for iformatio idetificatio. The results show that there is a average of 63.79% iformatio lost betwee trascript ad SR-best-. 4 Coclusio A ew atury spoke dialogue processig based o the TBM has bee preseted. This approach

0 0 SR-best-1 SR-best- trascript 1 3 4 5 6 7 8 Figure 5: Correct idetificatio rate usig the top iformatio i the rak. ca be viewed as lookig for evideces from oisy speech iputs to idetify the s that the cers wat to perform ad the iformatio that they have provided. Our experimets are tested o a multidomai eviromet. The speech recogizer that we use has a word accuracy of aroud 55%. The experimet results show that there is some iitial success i usig TBM to aid i ad iformatio idetificatio whe the recogized iput is oisy. I order to improve users satisfactio, we are lookig ito dialogue processig methods that are able to improve the results of ad iformatio idetificatio. I particular, istead of usig word evideces from the recogized iputs, we are lookig ito the use other evideces such as phoemes. We are also lookig ito dialogue strategies that are able to collaborate with the cers to correct the idetified iformatio. I particular, if the igorace value +E0 8 is high, our system should employ system iitiative strategies to disambiguate the idetified iformatio. If +E0 8 is high, which meas that the evideces do ot poit strogly to ay object i, the our system should employ system iitiative strategies to lear ew -related iformatio. If both +E0 8 ad +E0 8 are low, out system ca employ a mixed iitiative dialogue strategy. Ackowledgmets Our thaks go to the udergraduate studets who have cotributed their valuable time to help us i the recordigs without askig for ay rewards. Refereces Chu-Carroll, Jeiffer ad Bob Carpeter. 1999. Vectorbased atural laguage c routig. Computatioal Liguistics, 5(3):361 388. Deœux, Thierry. 000. A eural etwork classifier based o Dempster-Shafer theory. IEEE Trasactios o Systems, Ma, ad Cyberetics Part A: Systems ad Humas, ():131 1, March. Fellbaum, Christiae (Ed). 1997. WordNet: A Electroic Lexical Database. Imprit Cambridge, Mass: MIT Press. Gori, Alle L., Giuseppe Riccardi ad Jeremy H. Wright. 1997. How may I help you? Speech Commuicatio, 3:113 17. Huag, Xuedog, Fileo Alleva, Hsiao-Wue Ho, Mei- Yuh Hwag, Roald Rosefeld. 199. The SPHINX- II speech recogitio system: a overview. Computer Speech ad Laguage, 7():137 148. Lee, Chi-Hui, Bob Carpeter, Wu Chou, Jeifer Chu- Carroll, Wolfgag Reichl, Atoie Saad ad Qiru Zhou. 000. O atural laguage c routig. Speech Commuicatio, 31(4):9-, Aug. Ng, Hwee Tou, Goh Wei Boo ad Low Kok Leog. 1997. Feature selectio, perceptro learig, ad a usability case study for text categorizatio. I Proceedigs of the 0th Iteratioal ACM SIGIR Coferece o Research ad Developmet i Iformatio Retrieval, 67-73. Philadelphia, Pesylvaia, USA. Smets, Philippe. 1999. Practical uses of belief fuctios. Ucertaity i Artificial Itelligece: Proceedigs of the Fifteeth Coferece (UAI-1999), Morga Kaufma Publishers, Sa Fracisco, CA, 61 61. Smets, Philippe. 1989. Costructig the pigistic probability fuctio i a cotext of ucertaity. Ucertaity i Artificial Itelligece 5. Herio M., Shachter R. D., Kaal L. N. ad Lemmer J. F. (Eds). North Hollad, Amsterdam, 9. Smets, Philippe. 1988. Belief fuctios. No-stadard Logic for Automated Reasoig. P. Smets, A. Mamdai, D. Dubois, ad H. Prade (Eds). New York: Academic, 5 86. Smets, Philippe. 1997. The axiomatic justificatio of the trasferable belief model. Artificial Itelligece, 9:9 4. Thomso, David L. ad Jack J. Wisowaty. 1999. User cofusio i atural laguage services. I Proc. ESCA Workshop o Iteractive Dialogue i Multi-Modal Systems, Kloster Irsee, Germay, Jue, 189 196, keyote address. Zouhal, La Merieme ad Thierry Deœux. 1998. A evidece-theoretic k-nn rule with parameter optimizatio. IEEE Trasactios o Systems, Ma ad Cyberetics Part C, 8():63-71.