IP Library Granted Patent US 12,436,983
Granted Patent B2
US 12,436,983 · App. 18/074,138 · Granted Oct 7, 2025

Method for adaptive conversation state management with filtering operators applied dynamically as part of a conversational interface

Inventors: Sashikumar Venkataraman (Andover, MA); Ahmed Nizam Mohaideen Pathurudeen (Kovilpatti, IN); K China Srinivasulu Reddy (Marathalli, IN); Mangesh Dattatray Pujari (Navi Mumbai, IN); Soumyadip Majumder (West Bengal, IN); Rakesh Barve (Bangalore, IN); Murali Aravamudan (Andover, MA)
Assignee: Adeia Guides Inc.
G06F16/3349G06F16/24535G06F16/907G06F16/9535
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,436,983
App. No.
18/074,138
Granted
Oct 7, 2025
Kind
B2
Abstract

A system and method of processing a search request is provided. Identification of a desired content item is based on comparing a topic of the search request to previous user input. The method includes providing access to a set of content items with metadata that describes the corresponding content items and providing information about previous searches. The method further includes receiving a present input from the user and determining a relatedness measure between the information about the previous searches and an element of the present input. If the relatedness measure is high, the method also includes selecting a subset of content items based on comparing the present input and information about the previous searches with the metadata that describes the subset of content items. Otherwise, the method includes selecting a subset of content items based on comparing the present input with the metadata that describes the subset of content items.

Claims (52)

1. A computer-implemented method including a hardware processor for processing search requests, the computer-implemented method comprising:

receiving, in a conversation state space defined by a first filter, the first filter comprising a first term of a first attribute type, a first speech input;

identifying in the first speech input a second filter comprising a second term of a second attribute type;

generating a relationship graph that identifies relationships between a plurality of terms, including the first and second term, wherein the relationship graph is generated by the hardware processor retrieving and processing information from repositories to identify semantic associations between the plurality of terms;

selecting, based on the relationship graph, a first set of search results, wherein each search result of the first set of search results corresponds to a respective node of the relationship graph that is connected, by an edge having an edge type corresponding to the second attribute type, to a first node corresponding to the first term of the first attribute type and having a node type corresponding to the first attribute type;

generating for display the first set of search results;

receiving, in the conversation state space, a second speech input;

identifying in the second speech input a third filter comprising a third term of a third attribute type;

determining, based on the relationship graph, whether any of the first search results match the first filter, the second filter, and the third filter;

in response to determining that no search results match: (a) the first filter and the second filter for which the first set of search results is being generated for display, and (b) the third filter which was received in the conversation state space defined by first filter and the second filter:

automatically removing the second filter from the conversation state space and replacing it in the conversation state space with the third filter;

selecting a second set of search results based on the first filter and the third filter and not the second filter; and

generating for display the second set of search results.

2. The computer-implemented method of claim 1 , wherein determining, based on the relationship graph, whether any of the first search results match the first filter, the second filter, and the third filter comprises:

determining, for each search result of the first set of search results, whether a first node of the relationship graph corresponding to a respective search result is connected to a second node of the relationship graph having a node type corresponding to the third term by an edge having an edge type corresponding to the third attribute type.

3. The computer-implemented method of claim 1 , wherein selecting the second set of search results based on the first filter and the third filter comprises:

selecting, based on the relationship graph, the second set of search results, wherein each search result of the second set of search results corresponds to a respective node of the relationship graph that is connected, by an edge having an edge type corresponding to the third attribute type, to a second node corresponding to the first term of the first attribute type and having a node type corresponding to the first attribute type.

4. The computer-implemented method of claim 1 further comprising:

providing access to a relationship database containing relationship distances of search results; and

determining whether the first, second, and third filters in the conversation state space have a relatedness measure exceeding a threshold value, wherein the threshold value is based on one or more of the relationship distances.

5. The computer-implemented method of claim 4 , wherein the relationship database comprises the relationship graph with nodes and edges.

6. The computer-implemented method of claim 5 , wherein a relationship distance between two entities is measured in a smallest number of hops between two nodes corresponding to the two entities.

7. The computer-implemented method of claim 6 , further comprising:

determining a measure of relatedness between the first speech input from a user and the second speech input from the user based on the relationship distance between a first entity corresponding to the first speech input and a second entity corresponding to the second speech input.

8. The computer-implemented method of claim 4 , further comprising determining a number of relationships that search results associated with the first, second, and third filters in the conversation state space have in the relationship database, wherein the threshold value is determined based on the number of relationships.

9. A system including a hardware processor for processing search requests, the system comprising:

input circuitry; and

control circuitry configured to:

receive, using the input circuitry, in a conversation state space defined by a first filter, the first filter comprising a first term of a first attribute type, a first speech input;

identify in the first speech input a second filter comprising a second term of a second attribute type;

generate a relationship graph that identifies relationships between a plurality of terms, including the first and second term, wherein the relationship graph is generated by the hardware processor retrieving and processing information from repositories to identify semantic associations between the plurality of terms;

select, based on the relationship graph, a first set of search results, wherein each search result of the first set of search results corresponds to a respective node of the relationship graph that is connected, by an edge having an edge type corresponding to the second attribute type, to a first node corresponding to the first term of the first attribute type and having a node type corresponding to the first attribute type;

generate for display the first set of search results;

receiving, using the input circuitry, in the conversation state space, a second speech input;

identify in the second speech input a third filter comprising a third term of a third attribute type;

determine, based on the relationship graph, whether any of the first search results match the first filter, the second filter, and the third filter;

in response to determining that no search results match: (a) the first filter and the second filter for which the first set of search results is being generated for display, and (b) the third filter which was received in the conversation state space defined by first filter and the second filter:

automatically remove the second filter from the conversation state space and replace it in the conversation state space with the third filter;

select a second set of search results based on the first filter and the third filter, and not the second filter; and

generate for display the second set of search results.

10. The system of claim 9 , wherein the control circuitry configured to determine, based on the relationship graph, whether any of the first search results match the first filter, the second filter, and the third filter is further configured to:

determine, for each search result of the first set of search results, whether a first node of the relationship graph corresponding to a respective search result is connected to a second node of the relationship graph having a node type corresponding to the third term by an edge having an edge type corresponding to the third attribute type.

11. The system of claim 9 , wherein the control circuitry configured to select the second set of search results based on the first filter and the third filter comprises:

select, based on the relationship graph, the second set of search results, wherein each search result of the second set of search results corresponds to a respective node of the relationship graph that is connected, by an edge having an edge type corresponding to the third attribute type, to a second node corresponding to the first term of the first attribute type and having a node type corresponding to the first attribute type.

12. The system of claim 9 , wherein the control circuitry is further configured to:

provide access to a relationship database containing relationship distances of search results; and

determine whether the first, second, and third filters in the conversation state space have a relatedness measure exceeding a threshold value, wherein the threshold value is based on one or more of the relationship distances.

13. The system of claim 12 , wherein the relationship database comprises the relationship graph with nodes and edges, each node representing an entity and each edge representing a direct relationship between two entities.

14. The system of claim 13 , wherein a relationship distance between two entities is measured in a smallest number of hops between two nodes corresponding to the two entities.

15. The system of claim 14 , wherein the control circuitry is further configured to:

determine a measure of relatedness between the first speech input from a user and the second speech input from the user based on the relationship distance between a first entity corresponding to the first speech input and a second entity corresponding to the second speech input.

16. The system of claim 12 , wherein the control circuitry is further configured to determine a number of relationships that search results associated with the first, second, and third filters in the conversation state space have in the relationship database, wherein the threshold value is determined based on the number of relationships.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 24, 2024
From: VEVEO LLC
To: ROVI GUIDES, INC.
Reel/Frame 068682/0724 →
CHANGE OF NAME Recorded Sep 24, 2024
From: VEVEO, INC.
To: VEVEO LLC
Reel/Frame 069038/0030 →
CHANGE OF NAME Recorded Sep 24, 2024
From: ROVI GUIDES, INC.
To: ADEIA GUIDES INC.
Reel/Frame 069038/0067 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 14, 2023
From: VENKATARAMAN, SASHIKUMAR; PATHURUDEEN, AHMED NIZAM MOHAIDEEN; REDDY, K CHINA SRINIVASULU; PUJARI, MANGESH DATTATRAY; MAJUMDER, SOUMYADIP; BARVE, RAKESH; ARAVAMUDAN, MURALI
To: VEVEO INC.
Reel/Frame 063950/0348 →
SECURITY INTEREST Recorded May 3, 2023
From: ADEIA GUIDES INC.; ADEIA IMAGING LLC; ADEIA MEDIA HOLDINGS LLC; ADEIA MEDIA SOLUTIONS INC.; ADEIA SEMICONDUCTOR ADVANCED TECHNOLOGIES INC.; ADEIA SEMICONDUCTOR BONDING TECHNOLOGIES INC.; ADEIA SEMICONDUCTOR INC.; ADEIA SEMICONDUCTOR SOLUTIONS LLC; ADEIA SEMICONDUCTOR TECHNOLOGIES LLC; ADEIA SOLUTIONS LLC
To: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
Reel/Frame 063529/0272 →
Continuity (5)
Continuation 17172970 · Feb 10, 2021
Continuation 16015492 · Jun 22, 2018
Continuation 13801958 · Mar 13, 2013
Provisional Application 61712720 · Oct 11, 2012
Related Publication 20230161799A1 · May 25, 2023
References Cited (153)
US 6044347A · Abella et al. · 2000 [cited by applicant]
US 6125345A · Modi et al. · 2000 [cited by applicant]
US 6236968B1 · Kanevsky et al. · 2001 [cited by applicant]
US 6665659B1 · Logan · 2003 [cited by applicant]
US 6731307B1 · Strubbe et al. · 2004 [cited by applicant]
US 6885990B1 · Ohmori et al. · 2005 [cited by applicant]
US 7356772B2 · Brownholtz et al. · 2008 [cited by applicant]
US 7461061B2 · Aravamudan et al. · 2008 [cited by applicant]
US 7593932B2 · Lindh et al. · 2009 [cited by applicant]
US 7711570B2 · Galanes et al. · 2010 [cited by applicant]
US 7739280B2 · Aravamudan · 2010 [cited by examiner]
US 7774294B2 · Aravamudan et al. · 2010 [cited by applicant]
US 7835998B2 · Aravamudan · 2010 [cited by examiner]
US 7895218B2 · Venkataraman et al. · 2011 [cited by applicant]
US 7925974B1 · McConnell et al. · 2011 [cited by applicant]
US 7930168B2 · Weng et al. · 2011 [cited by applicant]
US 8073848B2 · Aravamudan · 2011 [cited by examiner]
US 8073860B2 · Venkataraman · 2011 [cited by examiner]
US 8078473B1 · Gazdzinski · 2011 [cited by applicant]
US 8078884B2 · Ramakrishnan · 2011 [cited by examiner]
US 8112454B2 · Aravamudan et al. · 2012 [cited by applicant]
US 8112529B2 · Van et al. · 2012 [cited by applicant]
US 8140327B2 · Kennewick et al. · 2012 [cited by applicant]
US 8145636B1 · Jeh et al. · 2012 [cited by applicant]
US 8160883B2 · Lecoeuche · 2012 [cited by applicant]
US 8171087B2 · Carrer et al. · 2012 [cited by applicant]
US 8172637B2 · Brown · 2012 [cited by applicant]
US 8204751B1 · Di et al. · 2012 [cited by applicant]
US 8219397B2 · Jaiswal et al. · 2012 [cited by applicant]
US 8229753B2 · Galanes et al. · 2012 [cited by applicant]
US 8577671B1 · Barve et al. · 2013 [cited by applicant]
US 8635240B2 · Venkataraman · 2014 [cited by examiner]
US 8886645B2 · Jones · 2014 [cited by examiner]
US 8943154B1 · Bodell et al. · 2015 [cited by applicant]
US 9262455B2 · Palay · 2016 [cited by applicant]
US 10284506B2 · Buchheit et al. · 2019 [cited by applicant]
US 20010021909A1 · Shimomura et al. · 2001 [cited by applicant]
US 20020058490A1 · Sorrells et al. · 2002 [cited by applicant]
US 20020152267A1 · Lennon · 2002 [cited by applicant]
US 20030088397A1 · Karas et al. · 2003 [cited by applicant]
US 20040015365A1 · Ohmori et al. · 2004 [cited by applicant]
US 20040025180A1 · Begeja et al. · 2004 [cited by applicant]
US 20050055210A1 · Venkataraman et al. · 2005 [cited by applicant]
US 20050125224A1 · Myers · 2005 [cited by examiner]
US 20060075044A1 · Fox et al. · 2006 [cited by applicant]
US 20060080107A1 · Hill · 2006 [cited by examiner]
US 20060259473A1 · Li et al. · 2006 [cited by applicant]
US 20070174407A1 · Chen et al. · 2007 [cited by applicant]
US 20070226295A1 · Haruna et al. · 2007 [cited by applicant]
US 20070266026A1 · Aravamudan · 2007 [cited by examiner]
US 20070276773A1 · Aravamudan · 2007 [cited by examiner]
US 20070276821A1 · Aravamudan et al. · 2007 [cited by applicant]
US 20080017452A1 · Chen · 2008 [cited by examiner]
US 20080046229A1 · Maskey et al. · 2008 [cited by applicant]
US 20080071452A1 · Tan et al. · 2008 [cited by applicant]
US 20080071542A1 · Yu · 2008 [cited by applicant]
US 20080104032A1 · Sarkar · 2008 [cited by applicant]
US 20080109741A1 · Messing et al. · 2008 [cited by applicant]
US 20080189269A1 · Olsen · 2008 [cited by examiner]
US 20080240379A1 · Maislos et al. · 2008 [cited by applicant]
US 20090106375A1 · Carmel et al. · 2009 [cited by applicant]
US 20090210411A1 · Murata et al. · 2009 [cited by applicant]
US 20090228439A1 · Manolescu et al. · 2009 [cited by applicant]
US 20090234814A1 · Boerries et al. · 2009 [cited by applicant]
US 20090248672A1 · Mcintire et al. · 2009 [cited by applicant]
US 20090306979A1 · Jaiswal et al. · 2009 [cited by applicant]
US 20090319270A1 · Gross · 2009 [cited by applicant]
US 20090319917A1 · Fuchs et al. · 2009 [cited by applicant]
US 20100002685A1 · Shaham et al. · 2010 [cited by applicant]
US 20100017205A1 · Visser et al. · 2010 [cited by applicant]
US 20100017366A1 · Robertson · 2010 [cited by examiner]
US 20100049684A1 · Adriaansen · 2010 [cited by examiner]
US 20100131870A1 · Park · 2010 [cited by applicant]
US 20100241625A1 · Aravamudan · 2010 [cited by examiner]
US 20110010316A1 · Hamilton et al. · 2011 [cited by applicant]
US 20110040554A1 · Audhkhasi et al. · 2011 [cited by applicant]
US 20110113039A1 · Venkataraman · 2011 [cited by examiner]
US 20110145847A1 · Barve et al. · 2011 [cited by applicant]
US 20110195696A1 · Fogel et al. · 2011 [cited by applicant]
US 20110212428A1 · Baker · 2011 [cited by applicant]
US 20120016678A1 · Gruber et al. · 2012 [cited by applicant]
US 20120022872A1 · Gruber et al. · 2012 [cited by applicant]
US 20120023175A1 · Deluca · 2012 [cited by applicant]
US 20120117516A1 · Guinness · 2012 [cited by applicant]
US 20120159379A1 · Negrillo et al. · 2012 [cited by applicant]
US 20130022275A1 · Inoue et al. · 2013 [cited by applicant]
US 20130041755A1 · Ivanov et al. · 2013 [cited by applicant]
US 20130282704A1 · Pantel · 2013 [cited by examiner]
US 20140025705A1 · Barve et al. · 2014 [cited by applicant]
US 20140247268A1 · Drucker et al. · 2014 [cited by applicant]
US 20170235848A1 · Van Dusen et al. · 2017 [cited by applicant]
US 20210200798A1 · Venkataraman et al. · 2021 [cited by applicant]
US 20230359656A1 · Venkataraman et al. · 2023 [cited by applicant]
EP 2907022 · 2015 [cited by examiner]
EP 2907022A2 · 2015 [cited by applicant]
JP 2011076364A · 2011 [cited by applicant]
JP 2011090546A · 2011 [cited by applicant]
JP 2011210043A · 2011 [cited by applicant]
WO 2006099105A2 · 2006 [cited by applicant]
WO 2013155619A1 · 2013 [cited by applicant]
WO WO2014059342 · 2014 [cited by examiner]
WO WO2014059342A2 · 2014 [cited by examiner]
WO 2014183035A1 · 2014 [cited by applicant]
Japanese Patent Application No. 201884095, Office Action dated Aug. 31, 2021, with-Pending-Claims (15 pages). [cited by applicant]
Sakaki, et al., “Construction of related terms thesauri from the web,” Journal of Natural Language Processing, 14(2):3-31 (2007). [cited by applicant]
“City browser: developing a conversational automotive HMI”, CHI 2009—Spotlight on Works in Progress—Session 2, Boston, MA, USA, Apr. 4-9, 2009. pp. 4291-4296 ISBN: 978-1-60558-247-4 10.1145/1520340.1520655.<http://c11.a… [cited by applicant]
“Dialogue Systems: Multi-Modal Conversational Interfaces for activity based dialogues”, (4 pages, retrieved Apr. 4, 2013) http://godel.stanford.edu/old/witas/ <https://webmail.veveo.net/exchweb/bin/redirasp?URL=http://g… [cited by applicant]
“International Search Report and Written Opinion”, issued by The U.S. Patent and Trademark Office as International Searching Authority for corresponding International Application No. PCT/US13/053457 mailed Feb. 20, 2014… [cited by applicant]
“International Searching Authority and Written Opinion”, issued by the U.S. Patent and Trademark Office as International Searching Authority for International Application No. PCT/US13/64644 mailed Apr. 22, 2014 (13 pgs.… [cited by applicant]
Acomb, K. , et al., “Technical Support Dialog Systems: Issues, Problems and Solutions, Bridging the Gap”, Academic and Industrial Research in Dialog Technologies Workshop Proceedings, pp. 25-31, NAACL-HLT, Rochester, NY… [cited by applicant]
Balchandran, R. , et al., “A Multi-modal Spoken Dialog System for Interactive TV”, ICMI'08; pp. 191-192 (Oct. 20-22, 2008). [cited by applicant]
Baldwin , et al., “Autonomous Self-Assessment of Autocorrections: Exploring Text Message Dialogues”, 2012 Conf. of the N. Amer. Chapter of Computational Linguistics: Human Language Technologies, pp. 710-719 (2012). [cited by applicant]
Bennacef , et al., “A Spoken Language System for Information Retrieval”, Proc. ICSLP 1994, 4 pages (Sep. 1994). [cited by applicant]
Bimbot , et al., “Variable-length Sequence Modeling: Multigrams”, IEEE Signal Proc. Letters, vol. 2, No. 6, Jun. 1995 (3 pgs.). [cited by applicant]
Bocchieri , et al., “Understanding Spontaneous Speech”, http:/wwwthepieraccinis.com/publications/1995/AIIA 95.pdf, Journal of the Italian Assoc of Artificial Intelligence, Sep. 1995 (5 pgs.). [cited by applicant]
Bonneau-Maynard , et al., “Dialog Strategies in a tourist information spoken dialog system”, SPECOM '98, Saint Petersburgh, pp. 115-118 (1998). [cited by applicant]
Carpenter , et al., “A Portable, Server-Side Dialog Framework for VoiceXML”, Proc of ICSLP2002, Denver (CO), Sep. 16-20, 2002 (5 pgs.). [cited by applicant]
Caskey , et al., “Interactive Grammar Inference with Finite State Transducers”, ASRU '03 Workshop on Automatic Speech Recognition and Understanding, St. Thomas, USVI, Nov. 30-Dec. 4, 2003 (IEEE) pp. 572-576. [cited by applicant]
Eckert , et al., “User Modeling for Spoken Dialogue System Evaluation”, <http://www.thepieraccinis.com/publications/1997/ASRU.sub.--97.sub.-u-ser.pdf> ASRU '97, 1997 (pp. 80-87). [cited by applicant]
Hakimov , et al., “Named entity recognition and disambiguation using linked data and graph-based centrality scoring” SWIM '12 Proceedings of the 4th International Workshop on Semantic Web Information Management Article … [cited by applicant]
Ibrahim, A. , et al., “Multimodal Dialogue Systems for Interactive TV Applications”, (6 pages, date not available) http://www.google.co.in/search?sugexp=chrome,mod=11&sourceid=chrome&ie=UTF-8&q=Multimodal+Dialogue+Syste… [cited by applicant]
Jack , et al., “Preferences and Whims: Personalised Information Retrieval on Structured Data and Knowledge Management”, http://www.mendeley,,com/profilestkris-jackipublications/Report>/, 2 pgs. [cited by applicant]
Jung , et al., “Using Utterance and Semantic Level Confidence for Interactive Spoken Dialog Clarification”, J. Comp. Sci. Eng., vol. 2(1): 1-25 (Mar. 2008). [cited by applicant]
Karanastasi , et al., “A Natural Language Model and a System for Managing TV-Anytime Information from Mobile Devices”, (12 pgs., date not available) http://pdfaminer.orq/000/518/459/a natural language model and a system… [cited by applicant]
Lee , et al., “Combining Acoustic and Language Information for Emotion Recognition”, Proc of ICSLP 2002, Denver (CO), Sep. 16-20, 2002. 5 pgs. [cited by applicant]
Lee , et al., “Subword-based large vocabulary speech recognition”, AT&T Tech. Journal, vol. 72, No. 5, Sep./Oct. 1993, pp. 25-36, Total 14 pgs. [cited by applicant]
Levin , et al., “A stochastic model of computer-human interaction for learning dialogue, strategies”, ESCA, EUROSPEECH 97, Rhodes, Greece, ISSN 1018-4074, Sep. 1997. 5 pgs. [cited by applicant]
Levin , et al., “Chronus, the next generation”, Proc. 1995 ARPA Spoken Language Systems Tech. Workshop, Austin, Texas, Jan. 22-25, 1995 (4 pgs.). [cited by applicant]
Levin , et al., “Concept-based spontaneous speech understanding system”, EUROSPEECH, 4th European Conference of Speech Communication and Technology. [cited by applicant]
Levin , et al., “Using Markov decision process for learning dialogue strategies”, Proc. ICASSP 98, Seattle, WA, May 1998 (p. 201-204). [cited by applicant]
Meng , et al., “The Use of Belief Networks for Mixed-Initiative Dialog Modeling”, IEEE Transactions on Speech and Audio Processing, vol. 11, No. 6, pp. 757-773, Nov. 2003. [cited by applicant]
Paek, T. , et al., “Automating spoken dialogue management design using machine learning: An industry perspective”, Speech Communication, vol. 50, 2008, pp. 716-729. [cited by applicant]
Pieraccini , et al., “A Learning Approach to Natural Language Understanding, Speech Recognition and Coding”, Springer-Verlag, Bubion (Granada), Spain, 1993 (21 pgs.). [cited by applicant]
Pieraccini , et al., “A Multimodal Conversational Interface for a Concept Vehicle”, <http://www.thepieraccinis.com/publications/2003/Eurospeech.sub.--03.pdf>, Eurospeech2003., Geneva (Switzerland), Sep. 2003 (4 pgs.). [cited by applicant]
Pieraccini , et al., “A spontaneous-speech understanding system for database query applications”, ESCA Workshop on Spoken Dialogue Systems—Theories & Applications, Vigso, Denmark, Jun. 1995 (4 pgs.). [cited by applicant]
Pieraccini , et al., “Algorithms for speech data reduction & recognition”, Esprit 85 Status Report of Continuing Work, Proc. of 2nd Esprit Technical Week, Brussels, Sep. 1985 (14 pages). [cited by applicant]
Pieraccini , et al., “AMICA: the AT&T Mixed Initiative Conversational Architecture”, Proc. of EUROSPEECH 97, Rhodes, Greece, Sep. 1997 (5 pgs.). [cited by applicant]
Pieraccini , et al., “Are We There Yet? Research in Commercial Spoken Dialog Systems, in Text, Speech and Dialogue”, 12th International Conference, TSD 2009, Pilsen, Czech Republic, Sep. 2009, Vaclav Matousek and Pavel … [cited by applicant]
Pieraccini , et al., “Automatic learning in spoken language understanding”, <http://www.thepieraccinis.com/publications/1992/ICSLP.sub.--92.pdf&gt->, Proc. 1992 International Conference on Spoken Language Processing (IC… [cited by applicant]
Pieraccini , et al., “ETUDE, a Recursive Dialog Manager with Embedded User Interface Pattern”, Proc. of ASRU01—IEEE Workshop, Madonna di Campiglio, Italy, Dec. 2001 as printed in IEEE, 2002, pp. 244-247. [cited by applicant]
Pieraccini , et al., “Learning how to understand language”, <http://www.thepieraccinis.com/publications/1993/Eurospeech.s- ub.--93.sub.-Keynote.pdf>, Proc. EUROSPEECH '93, Berlin, Germany, Sep. 1993, pp. 1407-1412. [cited by applicant]
Pieraccini , et al., “Multimodal Conversational Systems for Automobiles”, Communications of the ACM, Jan. 2004, vol. 47, No. 1, pp. 47-49. [cited by applicant]
Pieraccini , et al., “Multi-modal Spoken Dialog with Wireless Devices”, Proc. of ISCA Tutorial and Research Workshop—Multi-modal Dialog in Mobile Environments—Jun. 17-19, 2002—Kloster Irsee, Germany as printed in Text, … [cited by applicant]
Pieraccini , et al., “Spoken Language Communication with Machines: the Long and Winding Road from Research to Business, in M. Ali and F. Esposito (Eds)”, IEA/AIE 2005,LNAI 3533, pp. 6-15, 2005, Springer-Verlag. [cited by applicant]
Pieraccini , et al., “Spoken Language Dialog: Architectures and Algorithms”, Proc. of XXllemes Journees d'Etude sur la Parole, Martigny (Switzerland), Jun. 1998, 21 pgs. [cited by applicant]
Pieraccini , et al., “Stochastic representation of semantic structure for speech understanding”, Speech Comm., vol. 11 (1992) pp. 283-288. [cited by applicant]
Pieraccini, R. , “The Industry of Spoken-Dialog Systems and the Third Generation of Interactive Applications, in Speech Technology: Theory and Applications, F. Chen and K.Jokinen, editors,”, Springer, 2010, pp. 61-77. [cited by applicant]
Pieraccini , et al., “Where do we go from here? Research and Commercial Spoken Dialog Systems, Recent Trends in Discourse and Dialog”, Lisbon, Portugal, Sep. 2-3, 2005. pp. 1-10 as printed in Springer Sci. and Bus. Medi… [cited by applicant]
Riccardi , et al., “Non deterministic stochastic language models for speech recognition”, ICASSP '95, Detroit, 1995, pp. 237-240. [cited by applicant]
Rooney, B. , “AI System Automates Consumer Gripes, Jun. 20, 2012; (2 pgs.); <http://blogs.wsj.com/tech-europe/2012/06/20/ai-system-automates-consu- mer-complaints/>”, Jun. 20, 2012; (2 pgs.); <http://blogs.wsj.com/tech-… [cited by applicant]
Roush, W. , “Meet Siri's Little Sister, Lola. She's Training for a Bank Job”, (Jun. 27, 2012) (4 pages) http://www.xconomy.com/san-francisco/2012/06/27/meet-siris-little-sister-lola-shes-training-for-a-bank-job/?single_… [cited by applicant]
Rudnicky, A. , et al., “An Agenda-Based Dialog Management Architecture for Spoken Language Systems”, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 (4 pages, date not available). [cited by applicant]
Smart, J. , “The Conversational Interface: Our Next Great Leap Forward (aka Conversational User Interface, Linguistic UI, Natural UI, Spoken Dialog System, etc.)”, (18 pages, Retrieved Apr. 4, 2013) http://www.accelerat… [cited by applicant]