Paraphrasing of user requests and results by automated digital assistant

Abstract
Methods, systems, and computer readable storage medium related to operating an intelligent digital assistant are disclosed. A user request is received, the user request including at least a speech input received from a user. In response to the user request, (1) an echo of the speech input based on a textual interpretation of the speech input, and (2) a paraphrase of the user request based at least in part on a respective semantic interpretation of the speech input are presented to the user.
Description

This application is further related to (1) U.S. application Ser. No. 11/518,292, filed Sep. 8, 2006, entitled “Method and Apparatus for Building an Intelligent Automated Assistant” (2) U.S. Provisional Application Ser. No. 61/186,414 filed Jun. 12, 2009, entitled “System and Method for Semantic Auto-Completion;” (3) U.S. application Ser. No. 13/725,481, filed Dec. 21, 2012, entitled “Personalized Vocabulary for Digital Assistant,”; (4) U.S. application Ser. No. 13/725,512, filed Dec. 21, 2012, entitled “Active Input Elicitation by Intelligent Automated Assistant,”; (5) U.S. application Ser. No. 13/725,550, filed Dec. 21, 2012, entitled “Determining User Intent Based on Ontologies of Domains,”; (6) U.S. application Ser. No. 13/725,616, filed Dec. 21, 2012, entitled “Service Orchestration for Intelligent Automated Assistant,”; (7) U.S. application Ser. No. 13/725,656, filed Dec. 21, 2012, entitled “Prioritizing Selection Criteria by Automated Assistant,”; (8) U.S. application Ser. No. 13/725,713, filed Dec. 21, 2012, entitled “Disambiguation Based on Active Input Elicitation by Intelligent Automated Assistant,”; (9) U.S. application Ser. No. 13/784,707, filed Mar. 4, 2013, entitled “Maintaining Context Information Between User Interactions with a Voice Assistant,”; (10) U.S. application Ser. No. 13/725,742, filed Dec. 21, 2012, entitled “Intent Deduction Based on Previous User Interactions with a Voice Assistant,”; and (11) U.S. application Ser. No. 13/725,761, filed Dec. 21, 2012, entitled “Using Event Alert Text as Input to an Automated Assistant,”, all of which are incorporated herein by reference in their entirety.


FIELD OF THE INVENTION

The present invention relates to intelligent systems, and more specifically for classes of applications for intelligent automated assistants.


BACKGROUND OF THE INVENTION

Today's electronic devices are able to access a large, growing, and diverse quantity of functions, services, and information, both via the Internet and from other sources. Functionality for such devices is increasing rapidly, as many consumer devices, smartphones, tablet computers, and the like, are able to run software applications to perform various tasks and provide different types of information. Often, each application, function, website, or feature has its own user interface and its own operational paradigms, many of which can be burdensome to learn or overwhelming for users. In addition, many users may have difficulty even discovering what functionality and/or information is available on their electronic devices or on various websites; thus, such users may become frustrated or overwhelmed, or may simply be unable to use the resources available to them in an effective manner.


In particular, novice users, or individuals who are impaired or disabled in some manner, and/or are elderly, busy, distracted, and/or operating a vehicle may have difficulty interfacing with their electronic devices effectively, and/or engaging online services effectively. Such users are particularly likely to have difficulty with the large number of diverse and inconsistent functions, applications, and websites that may be available for their use.


Accordingly, existing systems are often difficult to use and to navigate, and often present users with inconsistent and overwhelming interfaces that often prevent the users from making effective use of the technology.


SUMMARY

According to various embodiments of the present invention, an intelligent automated assistant is implemented on an electronic device, to facilitate user interaction with a device, and to help the user more effectively engage with local and/or remote services. In various embodiments, the intelligent automated assistant engages with the user in an integrated, conversational manner using natural language dialog, and invokes external services when appropriate to obtain information or perform various actions.


According to various embodiments of the present invention, the intelligent automated assistant integrates a variety of capabilities provided by different software components (e.g., for supporting natural language recognition and dialog, multimodal input, personal information management, task flow management, orchestrating distributed services, and the like). Furthermore, to offer intelligent interfaces and useful functionality to users, the intelligent automated assistant of the present invention may, in at least some embodiments, coordinate these components and services. The conversation interface, and the ability to obtain information and perform follow-on task, are implemented, in at least some embodiments, by coordinating various components such as language components, dialog components, task management components, information management components and/or a plurality of external services.


According to various embodiments of the present invention, intelligent automated assistant systems may be configured, designed, and/or operable to provide various different types of operations, functionalities, and/or features, and/or to combine a plurality of features, operations, and applications of an electronic device on which it is installed. In some embodiments, the intelligent automated assistant systems of the present invention can perform any or all of: actively eliciting input from a user, interpreting user intent, disambiguating among competing interpretations, requesting and receiving clarifying information as needed, and performing (or initiating) actions based on the discerned intent. Actions can be performed, for example, by activating and/or interfacing with any applications or services that may be available on an electronic device, as well as services that are available over an electronic network such as the Internet. In various embodiments, such activation of external services can be performed via APIs or by any other suitable mechanism. In this manner, the intelligent automated assistant systems of various embodiments of the present invention can unify, simplify, and improve the user's experience with respect to many different applications and functions of an electronic device, and with respect to services that may be available over the Internet. The user can thereby be relieved of the burden of learning what functionality may be available on the device and on web-connected services, how to interface with such services to get what he or she wants, and how to interpret the output received from such services; rather, the assistant of the present invention can act as a go-between between the user and such diverse services.


In addition, in various embodiments, the assistant of the present invention provides a conversational interface that the user may find more intuitive and less burdensome than conventional graphical user interfaces. The user can engage in a form of conversational dialog with the assistant using any of a number of available input and output mechanisms, such as for example speech, graphical user interfaces (buttons and links), text entry, and the like. The system can be implemented using any of a number of different platforms, such as device APIs, the web, email, and the like, or any combination thereof. Requests for additional input can be presented to the user in the context of such a conversation. Short and long term memory can be engaged so that user input can be interpreted in proper context given previous events and communications within a given session, as well as historical and profile information about the user.


In addition, in various embodiments, context information derived from user interaction with a feature, operation, or application on a device can be used to streamline the operation of other features, operations, or applications on the device or on other devices. For example, the intelligent automated assistant can use the context of a phone call (such as the person called) to streamline the initiation of a text message (for example to determine that the text message should be sent to the same person, without the user having to explicitly specify the recipient of the text message). The intelligent automated assistant of the present invention can thereby interpret instructions such as “send him a text message”, wherein the “him” is interpreted according to context information derived from a current phone call, and/or from any feature, operation, or application on the device. In various embodiments, the intelligent automated assistant takes into account various types of available context data to determine which address book contact to use, which contact data to use, which telephone number to use for the contact, and the like, so that the user need not re-specify such information manually.


In various embodiments, the assistant can also take into account external events and respond accordingly, for example, to initiate action, initiate communication with the user, provide alerts, and/or modify previously initiated action in view of the external events. If input is required from the user, a conversational interface can again be used.


In one embodiment, the system is based on sets of interrelated domains and tasks, and employs additional functionally powered by external services with which the system can interact. In various embodiments, these external services include web-enabled services, as well as functionality related to the hardware device itself. For example, in an embodiment where the intelligent automated assistant is implemented on a smartphone, personal digital assistant, tablet computer, or other device, the assistant can control many operations and functions of the device, such as to dial a telephone number, send a text message, set reminders, add events to a calendar, and the like.


In various embodiments, the system of the present invention can be implemented to provide assistance in any of a number of different domains. Examples include:

    • Local Services (including location- and time-specific services such as restaurants, movies, automated teller machines (ATMs), events, and places to meet);
    • Personal and Social Memory Services (including action items, notes, calendar events, shared links, and the like);
    • E-commerce (including online purchases of items such as books, DVDs, music, and the like);
    • Travel Services (including flights, hotels, attractions, and the like).


One skilled in the art will recognize that the above list of domains is merely exemplary. In addition, the system of the present invention can be implemented in any combination of domains.


In various embodiments, the intelligent automated assistant systems disclosed herein may be configured or designed to include functionality for automating the application of data and services available over the Internet to discover, find, choose among, purchase, reserve, or order products and services. In addition to automating the process of using these data and services, at least one intelligent automated assistant system embodiment disclosed herein may also enable the combined use of several sources of data and services at once. For example, it may combine information about products from several review sites, check prices and availability from multiple distributors, and check their locations and time constraints, and help a user find a personalized solution to their problem. Additionally, at least one intelligent automated assistant system embodiment disclosed herein may be configured or designed to include functionality for automating the use of data and services available over the Internet to discover, investigate, select among, reserve, and otherwise learn about things to do (including but not limited to movies, events, performances, exhibits, shows and attractions); places to go (including but not limited to travel destinations, hotels and other places to stay, landmarks and other sites of interest, etc.); places to eat or drink (such as restaurants and bars), times and places to meet others, and any other source of entertainment or social interaction which may be found on the Internet. Additionally, at least one intelligent automated assistant system embodiment disclosed herein may be configured or designed to include functionality for enabling the operation of applications and services via natural language dialog that may be otherwise provided by dedicated applications with graphical user interfaces including search (including location-based search); navigation (maps and directions); database lookup (such as finding businesses or people by name or other properties); getting weather conditions and forecasts, checking the price of market items or status of financial transactions; monitoring traffic or the status of flights; accessing and updating calendars and schedules; managing reminders, alerts, tasks and projects; communicating over email or other messaging platforms; and operating devices locally or remotely (e.g., dialing telephones, controlling light and temperature, controlling home security devices, playing music or video, etc.). Further, at least one intelligent automated assistant system embodiment disclosed herein may be configured or designed to include functionality for identifying, generating, and/or providing personalized recommendations for activities, products, services, source of entertainment, time management, or any other kind of recommendation service that benefits from an interactive dialog in natural language and automated access to data and services.


In various embodiments, the intelligent automated assistant of the present invention can control many features and operations of an electronic device. For example, the intelligent automated assistant can call services that interface with functionality and applications on a device via APIs or by other means, to perform functions and operations that might otherwise be initiated using a conventional user interface on the device. Such functions and operations may include, for example, setting an alarm, making a telephone call, sending a text message or email message, adding a calendar event, and the like. Such functions and operations may be performed as add-on functions in the context of a conversational dialog between a user and the assistant. Such functions and operations can be specified by the user in the context of such a dialog, or they may be automatically performed based on the context of the dialog. One skilled in the art will recognize that the assistant can thereby be used as a control mechanism for initiating and controlling various operations on the electronic device, which may be used as an alternative to conventional mechanisms such as buttons or graphical user interfaces.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings illustrate several embodiments of the invention and, together with the description, serve to explain the principles of the invention according to the embodiments. One skilled in the art will recognize that the particular embodiments illustrated in the drawings are merely exemplary, and are not intended to limit the scope of the present invention.



FIG. 1 is a block diagram depicting an example of one embodiment of an intelligent automated assistant system.



FIG. 2 illustrates an example of an interaction between a user and an intelligent automated assistant according to at least one embodiment.



FIG. 3 is a block diagram depicting a computing device suitable for implementing at least a portion of an intelligent automated assistant according to at least one embodiment.



FIG. 4 is a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a standalone computing system, according to at least one embodiment.



FIG. 5 is a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a distributed computing network, according to at least one embodiment.



FIG. 6 is a block diagram depicting a system architecture illustrating several different types of clients and modes of operation.



FIG. 7 is a block diagram depicting a client and a server, which communicate with each other to implement the present invention according to one embodiment.



FIG. 8 is a block diagram depicting a fragment of an active ontology according to one embodiment.



FIG. 9 is a block diagram depicting an example of an alternative embodiment of an intelligent automated assistant system.



FIG. 10 is a flow diagram depicting a method of operation for active input elicitation component(s) according to one embodiment.



FIG. 11 is a flow diagram depicting a method for active typed-input elicitation according to one embodiment.



FIGS. 12 to 21 are screen shots illustrating some portions of some of the procedures for active typed-input elicitation according to one embodiment.



FIG. 22 is a flow diagram depicting a method for active input elicitation for voice or speech input according to one embodiment.



FIG. 23 is a flow diagram depicting a method for active input elicitation for GUI-based input according to one embodiment.



FIG. 24 is a flow diagram depicting a method for active input elicitation at the level of a dialog flow according to one embodiment.



FIG. 25 is a flow diagram depicting a method for active monitoring for relevant events according to one embodiment.



FIG. 26 is a flow diagram depicting a method for multimodal active input elicitation according to one embodiment.



FIG. 27 is a set of screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by domain models component(s) and services orchestration according to one embodiment.



FIG. 28 is a flow diagram depicting an example of a method for natural language processing according to one embodiment.



FIG. 29 is a screen shot illustrating natural language processing according to one embodiment.



FIGS. 30 and 31 are screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by dialog flow processor component(s) according to one embodiment.



FIG. 32 is a flow diagram depicting a method of operation for dialog flow processor component(s) according to one embodiment.



FIG. 33 is a flow diagram depicting an automatic call and response procedure, according to one embodiment.



FIG. 34 is a flow diagram depicting an example of task flow for a constrained selection task according to one embodiment.



FIGS. 35 and 36 are screen shots illustrating an example of the operation of constrained selection task according to one embodiment.



FIG. 37 is a flow diagram depicting an example of a procedure for executing a service orchestration procedure according to one embodiment.



FIG. 38 is a flow diagram depicting an example of a service invocation procedure according to one embodiment.



FIG. 39 is a flow diagram depicting an example of a multiphase output procedure according to one embodiment.



FIGS. 40 and 41 are screen shots depicting examples of output processing according to one embodiment.



FIG. 42 is a flow diagram depicting an example of multimodal output processing according to one embodiment.



FIGS. 43A and 43B are screen shots depicting an example of the use of short term personal memory component(s) to maintain dialog context while changing location, according to one embodiment.



FIGS. 44A through 44C are screen shots depicting an example of the use of long term personal memory component(s), according to one embodiment.



FIG. 45 depicts an example of an abstract model for a constrained selection task.



FIG. 46 depicts an example of a dialog flow model to help guide the user through a search process.



FIG. 47 is a flow diagram depicting a method of constrained selection according to one embodiment.



FIG. 48 is a table depicting an example of constrained selection domains according to various embodiments.





DETAILED DESCRIPTION OF THE EMBODIMENTS

Various techniques will now be described in detail with reference to a few example embodiments thereof as illustrated in the accompanying drawings. In the following description, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects and/or features described or reference herein. It will be apparent, however, to one skilled in the art, that one or more aspects and/or features described or reference herein may be practiced without some or all of these specific details. In other instances, well known process steps and/or structures have not been described in detail in order to not obscure some of the aspects and/or features described or reference herein.


One or more different inventions may be described in the present application. Further, for one or more of the invention(s) described herein, numerous embodiments may be described in this patent application, and are presented for illustrative purposes only. The described embodiments are not intended to be limiting in any sense. One or more of the invention(s) may be widely applicable to numerous embodiments, as is readily apparent from the disclosure. These embodiments are described in sufficient detail to enable those skilled in the art to practice one or more of the invention(s), and it is to be understood that other embodiments may be utilized and that structural, logical, software, electrical and other changes may be made without departing from the scope of the one or more of the invention(s). Accordingly, those skilled in the art will recognize that the one or more of the invention(s) may be practiced with various modifications and alterations. Particular features of one or more of the invention(s) may be described with reference to one or more particular embodiments or figures that form a part of the present disclosure, and in which are shown, by way of illustration, specific embodiments of one or more of the invention(s). It should be understood, however, that such features are not limited to usage in the one or more particular embodiments or figures with reference to which they are described. The present disclosure is neither a literal description of all embodiments of one or more of the invention(s) nor a listing of features of one or more of the invention(s) that must be present in all embodiments.


Headings of sections provided in this patent application and the title of this patent application are for convenience only, and are not to be taken as limiting the disclosure in any way.


Devices that are in communication with each other need not be in continuous communication with each other, unless expressly specified otherwise. In addition, devices that are in communication with each other may communicate directly or indirectly through one or more intermediaries.


A description of an embodiment with several components in communication with each other does not imply that all such components are required. To the contrary, a variety of optional components are described to illustrate the wide variety of possible embodiments of one or more of the invention(s).


Further, although process steps, method steps, algorithms or the like may be described in a sequential order, such processes, methods and algorithms may be configured to work in alternate orders. In other words, any sequence or order of steps that may be described in this patent application does not, in and of itself, indicate a requirement that the steps be performed in that order. The steps of described processes may be performed in any order practical. Further, some steps may be performed simultaneously despite being described or implied as occurring non-simultaneously (e.g., because one step is described after the other step). Moreover, the illustration of a process by its depiction in a drawing does not imply that the illustrated process is exclusive of other variations and modifications thereto, does not imply that the illustrated process or any of its steps are necessary to one or more of the invention(s), and does not imply that the illustrated process is preferred.


When a single device or article is described, it will be readily apparent that more than one device/article (whether or not they cooperate) may be used in place of a single device/article. Similarly, where more than one device or article is described (whether or not they cooperate), it will be readily apparent that a single device/article may be used in place of the more than one device or article.


The functionality and/or the features of a device may be alternatively embodied by one or more other devices that are not explicitly described as having such functionality/features. Thus, other embodiments of one or more of the invention(s) need not include the device itself.


Techniques and mechanisms described or reference herein will sometimes be described in singular form for clarity. However, it should be noted that particular embodiments include multiple iterations of a technique or multiple instantiations of a mechanism unless noted otherwise.


Although described within the context of intelligent automated assistant technology, it may be understood that the various aspects and techniques described herein (such as those associated with active ontologies, for example) may also be deployed and/or applied in other fields of technology involving human and/or computerized interaction with software.


Other aspects relating to intelligent automated assistant technology (e.g., which may be utilized by, provided by, and/or implemented at one or more intelligent automated assistant system embodiments described herein) are disclosed in one or more of the following references:

  • U.S. Provisional Patent Application Ser. No. 61/295,774 for “Intelligent Automated Assistant”, filed Jan. 18, 2010, the disclosure of which is incorporated herein by reference;
  • U.S. patent application Ser. No. 11/518,292 for “Method And Apparatus for Building an Intelligent Automated Assistant”, filed Sep. 8, 2006, the disclosure of which is incorporated herein by reference; and
  • U.S. Provisional Patent Application Ser. No. 61/186,414 for “System and Method for Semantic Auto-Completion”, filed Jun. 12, 2009, the disclosure of which is incorporated herein by reference.


    Hardware Architecture


Generally, the intelligent automated assistant techniques disclosed herein may be implemented on hardware or a combination of software and hardware. For example, they may be implemented in an operating system kernel, in a separate user process, in a library package bound into network applications, on a specially constructed machine, or on a network interface card. In a specific embodiment, the techniques disclosed herein may be implemented in software such as an operating system or in an application running on an operating system.


Software/hardware hybrid implementation(s) of at least some of the intelligent automated assistant embodiment(s) disclosed herein may be implemented on a programmable machine selectively activated or reconfigured by a computer program stored in memory. Such network devices may have multiple network interfaces which may be configured or designed to utilize different types of network communication protocols. A general architecture for some of these machines may appear from the descriptions disclosed herein. According to specific embodiments, at least some of the features and/or functionalities of the various intelligent automated assistant embodiments disclosed herein may be implemented on one or more general-purpose network host machines such as an end-user computer system, computer, network server or server system, mobile computing device (e.g., personal digital assistant, mobile phone, smartphone, laptop, tablet computer, or the like), consumer electronic device, music player, or any other suitable electronic device, router, switch, or the like, or any combination thereof. In at least some embodiments, at least some of the features and/or functionalities of the various intelligent automated assistant embodiments disclosed herein may be implemented in one or more virtualized computing environments (e.g., network computing clouds, or the like).


Referring now to FIG. 3, there is shown a block diagram depicting a computing device 60 suitable for implementing at least a portion of the intelligent automated assistant features and/or functionalities disclosed herein. Computing device 60 may be, for example, an end-user computer system, network server or server system, mobile computing device (e.g., personal digital assistant, mobile phone, smartphone, laptop, tablet computer, or the like), consumer electronic device, music player, or any other suitable electronic device, or any combination or portion thereof. Computing device 60 may be adapted to communicate with other computing devices, such as clients and/or servers, over a communications network such as the Internet, using known protocols for such communication, whether wireless or wired.


In one embodiment, computing device 60 includes central processing unit (CPU) 62, interfaces 68, and a bus 67 (such as a peripheral component interconnect (PCI) bus). When acting under the control of appropriate software or firmware, CPU 62 may be responsible for implementing specific functions associated with the functions of a specifically configured computing device or machine. For example, in at least one embodiment, a user's personal digital assistant (PDA) may be configured or designed to function as an intelligent automated assistant system utilizing CPU 62, memory 61, 65, and interface(s) 68. In at least one embodiment, the CPU 62 may be caused to perform one or more of the different types of intelligent automated assistant functions and/or operations under the control of software modules/components, which for example, may include an operating system and any appropriate applications software, drivers, and the like.


CPU 62 may include one or more processor(s) 63 such as, for example, a processor from the Motorola or Intel family of microprocessors or the MIPS family of microprocessors. In some embodiments, processor(s) 63 may include specially designed hardware (e.g., application-specific integrated circuits (ASICs), electrically erasable programmable read-only memories (EEPROMs), field-programmable gate arrays (FPGAs), and the like) for controlling the operations of computing device 60. In a specific embodiment, a memory 61 (such as non-volatile random access memory (RAM) and/or read-only memory (ROM)) also forms part of CPU 62. However, there are many different ways in which memory may be coupled to the system. Memory block 61 may be used for a variety of purposes such as, for example, caching and/or storing data, programming instructions, and the like.


As used herein, the term “processor” is not limited merely to those integrated circuits referred to in the art as a processor, but broadly refers to a microcontroller, a microcomputer, a programmable logic controller, an application-specific integrated circuit, and any other programmable circuit.


In one embodiment, interfaces 68 are provided as interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over a computing network and sometimes support other peripherals used with computing device 60. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various types of interfaces may be provided such as, for example, universal serial bus (USB), Serial, Ethernet, Firewire, PCI, parallel, radio frequency (RF), Bluetooth™, near-field communications (e.g., using near-field magnetics), 802.11 (WiFi), frame relay, TCP/IP, ISDN, fast Ethernet interfaces, Gigabit Ethernet interfaces, asynchronous transfer mode (ATM) interfaces, high-speed serial interface (HSSI) interfaces, Point of Sale (POS) interfaces, fiber data distributed interfaces (FDDIs), and the like. Generally, such interfaces 68 may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile and/or non-volatile memory (e.g., RAM).


Although the system shown in FIG. 3 illustrates one specific architecture for a computing device 60 for implementing the techniques of the invention described herein, it is by no means the only device architecture on which at least a portion of the features and techniques described herein may be implemented. For example, architectures having one or any number of processors 63 can be used, and such processors 63 can be present in a single device or distributed among any number of devices. In one embodiment, a single processor 63 handles communications as well as routing computations. In various embodiments, different types of intelligent automated assistant features and/or functionalities may be implemented in an intelligent automated assistant system which includes a client device (such as a personal digital assistant or smartphone running client software) and server system(s) (such as a server system described in more detail below).


Regardless of network device configuration, the system of the present invention may employ one or more memories or memory modules (such as, for example, memory block 65) configured to store data, program instructions for the general-purpose network operations and/or other information relating to the functionality of the intelligent automated assistant techniques described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store data structures, keyword taxonomy information, advertisement information, user click and impression information, and/or other specific non-program information described herein.


Because such information and program instructions may be employed to implement the systems/methods described herein, at least some network device embodiments may include nontransitory machine-readable storage media, which, for example, may be configured or designed to store program instructions, state information, and the like for performing various operations described herein. Examples of such nontransitory machine-readable storage media include, but are not limited to, magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media such as floptical disks, and hardware devices that are specially configured to store and perform program instructions, such as read-only memory devices (ROM), flash memory, memristor memory, random access memory (RAM), and the like. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter.


In one embodiment, the system of the present invention is implemented on a standalone computing system. Referring now to FIG. 4, there is shown a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a standalone computing system, according to at least one embodiment. Computing device 60 includes processor(s) 63 which run software for implementing intelligent automated assistant 1002. Input device 1206 can be of any type suitable for receiving user input, including for example a keyboard, touchscreen, microphone (for example, for voice input), mouse, touchpad, trackball, five-way switch, joystick, and/or any combination thereof. Output device 1207 can be a screen, speaker, printer, and/or any combination thereof. Memory 1210 can be random-access memory having a structure and architecture as are known in the art, for use by processor(s) 63 in the course of running software. Storage device 1208 can be any magnetic, optical, and/or electrical storage device for storage of data in digital form; examples include flash memory, magnetic hard drive, CD-ROM, and/or the like.


In another embodiment, the system of the present invention is implemented on a distributed computing network, such as one having any number of clients and/or servers. Referring now to FIG. 5, there is shown a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a distributed computing network, according to at least one embodiment.


In the arrangement shown in FIG. 5, any number of clients 1304 are provided; each client 1304 may run software for implementing client-side portions of the present invention. In addition, any number of servers 1340 can be provided for handling requests received from clients 1304. Clients 1304 and servers 1340 can communicate with one another via electronic network 1361, such as the Internet. Network 1361 may be implemented using any known network protocols, including for example wired and/or wireless protocols.


In addition, in one embodiment, servers 1340 can call external services 1360 when needed to obtain additional information or refer to store data concerning previous interactions with particular users. Communications with external services 1360 can take place, for example, via network 1361. In various embodiments, external services 1360 include web-enabled services and/or functionality related to or installed on the hardware device itself. For example, in an embodiment where assistant 1002 is implemented on a smartphone or other electronic device, assistant 1002 can obtain information stored in a calendar application (“app”), contacts, and/or other sources.


In various embodiments, assistant 1002 can control many features and operations of an electronic device on which it is installed. For example, assistant 1002 can call external services 1360 that interface with functionality and applications on a device via APIs or by other means, to perform functions and operations that might otherwise be initiated using a conventional user interface on the device. Such functions and operations may include, for example, setting an alarm, making a telephone call, sending a text message or email message, adding a calendar event, and the like. Such functions and operations may be performed as add-on functions in the context of a conversational dialog between a user and assistant 1002. Such functions and operations can be specified by the user in the context of such a dialog, or they may be automatically performed based on the context of the dialog. One skilled in the art will recognize that assistant 1002 can thereby be used as a control mechanism for initiating and controlling various operations on the electronic device, which may be used as an alternative to conventional mechanisms such as buttons or graphical user interfaces.


For example, the user may provide input to assistant 1002 such as “I need to wake tomorrow at 8 am”. Once assistant 1002 has determined the user's intent, using the techniques described herein, assistant 1002 can call external services 1360 to interface with an alarm clock function or application on the device. Assistant 1002 sets the alarm on behalf of the user. In this manner, the user can use assistant 1002 as a replacement for conventional mechanisms for setting the alarm or performing other functions on the device. If the user's requests are ambiguous or need further clarification, assistant 1002 can use the various techniques described herein, including active elicitation, paraphrasing, suggestions, and the like, to obtain the needed information so that the correct servers 1340 are called and the intended action taken. In one embodiment, assistant 1002 may prompt the user for confirmation before calling a servers 1340 to perform a function. In one embodiment, a user can selectively disable assistant's 1002 ability to call particular servers 1340, or can disable all such service-calling if desired.


The system of the present invention can be implemented with many different types of clients 1304 and modes of operation. Referring now to FIG. 6, there is shown a block diagram depicting a system architecture illustrating several different types of clients 1304 and modes of operation. One skilled in the art will recognize that the various types of clients 1304 and modes of operation shown in FIG. 6 are merely exemplary, and that the system of the present invention can be implemented using clients 1304 and/or modes of operation other than those depicted. Additionally, the system can include any or all of such clients 1304 and/or modes of operation, alone or in any combination. Depicted examples include:

    • Computer devices with input/output devices and/or sensors 1402. A client component may be deployed on any such computer device 1402. At least one embodiment may be implemented using a web browser 1304A or other software application for enabling communication with servers 1340 via network 1361. Input and output channels may of any type, including for example visual and/or auditory channels. For example, in one embodiment, the system of the invention can be implemented using voice-based communication methods, allowing for an embodiment of the assistant for the blind whose equivalent of a web browser is driven by speech and uses speech for output.
    • Mobile Devices with I/O and sensors 1406, for which the client may be implemented as an application on the mobile device 1304B. This includes, but is not limited to, mobile phones, smartphones, personal digital assistants, tablet devices, networked game consoles, and the like.
    • Consumer Appliances with I/O and sensors 1410, for which the client may be implemented as an embedded application on the appliance 1304C.
    • Automobiles and other vehicles with dashboard interfaces and sensors 1414, for which the client may be implemented as an embedded system application 1304D. This includes, but is not limited to, car navigation systems, voice control systems, in-car entertainment systems, and the like.
    • Networked computing devices such as routers 1418 or any other device that resides on or interfaces with a network, for which the client may be implemented as a device-resident application 1304E.
    • Email clients 1424, for which an embodiment of the assistant is connected via an Email Modality Server 1426. Email Modality server 1426 acts as a communication bridge, for example taking input from the user as email messages sent to the assistant and sending output from the assistant to the user as replies.
    • Instant messaging clients 1428, for which an embodiment of the assistant is connected via a Messaging Modality Server 1430. Messaging Modality server 1430 acts as a communication bridge, taking input from the user as messages sent to the assistant and sending output from the assistant to the user as messages in reply.
    • Voice telephones 1432, for which an embodiment of the assistant is connected via a Voice over Internet Protocol (VoIP) Modality Server 1434. VoIP Modality server 1434 acts as a communication bridge, taking input from the user as voice spoken to the assistant and sending output from the assistant to the user, for example as synthesized speech, in reply.


For messaging platforms including but not limited to email, instant messaging, discussion forums, group chat sessions, live help or customer support sessions and the like, assistant 1002 may act as a participant in the conversations. Assistant 1002 may monitor the conversation and reply to individuals or the group using one or more the techniques and methods described herein for one-to-one interactions.


In various embodiments, functionality for implementing the techniques of the present invention can be distributed among any number of client and/or server components. For example, various software modules can be implemented for performing various functions in connection with the present invention, and such modules can be variously implemented to run on server and/or client components. Referring now to FIG. 7, there is shown an example of a client 1304 and a server 1340, which communicate with each other to implement the present invention according to one embodiment. FIG. 7 depicts one possible arrangement by which software modules can be distributed among client 1304 and server 1340. One skilled in the art will recognize that the depicted arrangement is merely exemplary, and that such modules can be distributed in many different ways. In addition, any number of clients 1304 and/or servers 1340 can be provided, and the modules can be distributed among these clients 1304 and/or servers 1340 in any of a number of different ways.


In the example of FIG. 7, input elicitation functionality and output processing functionality are distributed among client 1304 and server 1340, with client part of input elicitation 1094a and client part of output processing 1092a located at client 1304, and server part of input elicitation 1094b and server part of output processing 1092b located at server 1340. The following components are located at server 1340:

    • complete vocabulary 1058b;
    • complete library of language pattern recognizers 1060b;
    • master version of short term personal memory 1052b;
    • master version of long term personal memory 1054b.


In one embodiment, client 1304 maintains subsets and/or portions of these components locally, to improve responsiveness and reduce dependence on network communications. Such subsets and/or portions can be maintained and updated according to well known cache management techniques. Such subsets and/or portions include, for example:

    • subset of vocabulary 1058a;
    • subset of library of language pattern recognizers 1060a;
    • cache of short term personal memory 1052a;
    • cache of long term personal memory 1054a.


Additional components may be implemented as part of server 1340, including for example:

    • language interpreter 1070;
    • dialog flow processor 1080;
    • output processor 1090;
    • domain entity databases 1072;
    • task flow models 1086;
    • services orchestration 1082;
    • service capability models 1088.


Each of these components will be described in more detail below. Server 1340 obtains additional information by interfacing with external services 1360 when needed.


Conceptual Architecture


Referring now to FIG. 1, there is shown a simplified block diagram of a specific example embodiment of an intelligent automated assistant 1002. As described in greater detail herein, different embodiments of intelligent automated assistant systems may be configured, designed, and/or operable to provide various different types of operations, functionalities, and/or features generally relating to intelligent automated assistant technology. Further, as described in greater detail herein, many of the various operations, functionalities, and/or features of the intelligent automated assistant system(s) disclosed herein may provide may enable or provide different types of advantages and/or benefits to different entities interacting with the intelligent automated assistant system(s). The embodiment shown in FIG. 1 may be implemented using any of the hardware architectures described above, or using a different type of hardware architecture.


For example, according to different embodiments, at least some intelligent automated assistant system(s) may be configured, designed, and/or operable to provide various different types of operations, functionalities, and/or features, such as, for example, one or more of the following (or combinations thereof):

    • automate the application of data and services available over the Internet to discover, find, choose among, purchase, reserve, or order products and services. In addition to automating the process of using these data and services, intelligent automated assistant 1002 may also enable the combined use of several sources of data and services at once. For example, it may combine information about products from several review sites, check prices and availability from multiple distributors, and check their locations and time constraints, and help a user find a personalized solution to their problem.
    • automate the use of data and services available over the Internet to discover, investigate, select among, reserve, and otherwise learn about things to do (including but not limited to movies, events, performances, exhibits, shows and attractions); places to go (including but not limited to travel destinations, hotels and other places to stay, landmarks and other sites of interest, and the like); places to eat or drink (such as restaurants and bars), times and places to meet others, and any other source of entertainment or social interaction which may be found on the Internet.
    • enable the operation of applications and services via natural language dialog that are otherwise provided by dedicated applications with graphical user interfaces including search (including location-based search); navigation (maps and directions); database lookup (such as finding businesses or people by name or other properties); getting weather conditions and forecasts, checking the price of market items or status of financial transactions; monitoring traffic or the status of flights; accessing and updating calendars and schedules; managing reminders, alerts, tasks and projects; communicating over email or other messaging platforms; and operating devices locally or remotely (e.g., dialing telephones, controlling light and temperature, controlling home security devices, playing music or video, and the like). In one embodiment, assistant 1002 can be used to initiate, operate, and control many functions and apps available on the device.
    • offer personal recommendations for activities, products, services, source of entertainment, time management, or any other kind of recommendation service that benefits from an interactive dialog in natural language and automated access to data and services.


According to different embodiments, at least a portion of the various types of functions, operations, actions, and/or other features provided by intelligent automated assistant 1002 may be implemented at one or more client systems(s), at one or more server systems (s), and/or combinations thereof.


According to different embodiments, at least a portion of the various types of functions, operations, actions, and/or other features provided by assistant 1002 may implement by at least one embodiment of an automated call and response procedure, such as that illustrated and described, for example, with respect to FIG. 33.


Additionally, various embodiments of assistant 1002 described herein may include or provide a number of different advantages and/or benefits over currently existing intelligent automated assistant technology such as, for example, one or more of the following (or combinations thereof):

    • The integration of speech-to-text and natural language understanding technology that is constrained by a set of explicit models of domains, tasks, services, and dialogs. Unlike assistant technology that attempts to implement a general-purpose artificial intelligence system, the embodiments described herein may apply the multiple sources of constraints to reduce the number of solutions to a more tractable size. This results in fewer ambiguous interpretations of language, fewer relevant domains or tasks, and fewer ways to operationalize the intent in services. The focus on specific domains, tasks, and dialogs also makes it feasible to achieve coverage over domains and tasks with human-managed vocabulary and mappings from intent to services parameters.
    • The ability to solve user problems by invoking services on their behalf over the Internet, using APIs. Unlike search engines which only return links and content, some embodiments of automated assistants 1002 described herein may automate research and problem-solving activities. The ability to invoke multiple services for a given request also provides broader functionality to the user than is achieved by visiting a single site, for instance to produce a product or service or find something to do.
    • The application of personal information and personal interaction history in the interpretation and execution of user requests. Unlike conventional search engines or question answering services, the embodiments described herein use information from personal interaction history (e.g., dialog history, previous selections from results, and the like), personal physical context (e.g., user's location and time), and personal information gathered in the context of interaction (e.g., name, email addresses, physical addresses, phone numbers, account numbers, preferences, and the like). Using these sources of information enables, for example,
      • better interpretation of user input (e.g., using personal history and physical context when interpreting language);
      • more personalized results (e.g., that bias toward preferences or recent selections);
      • improved efficiency for the user (e.g., by automating steps involving the signing up to services or filling out forms).
    • The use of dialog history in interpreting the natural language of user inputs.


Because the embodiments may keep personal history and apply natural language understanding on user inputs, they may also use dialog context such as current location, time, domain, task step, and task parameters to interpret the new inputs. Conventional search engines and command processors interpret at least one query independent of a dialog history. The ability to use dialog history may make a more natural interaction possible, one which resembles normal human conversation.

    • Active input elicitation, in which assistant 1002 actively guides and constrains the input from the user, based on the same models and information used to interpret their input. For example, assistant 1002 may apply dialog models to suggest next steps in a dialog with the user in which they are refining a request; offer completions to partially typed input based on domain and context specific possibilities; or use semantic interpretation to select from among ambiguous interpretations of speech as text or text as intent.
    • The explicit modeling and dynamic management of services, with dynamic and robust services orchestration. The architecture of embodiments described enables assistant 1002 to interface with many external services, dynamically determine which services may provide information for a specific user request, map parameters of the user request to different service APIs, call multiple services at once, integrate results from multiple services, fail over gracefully on failed services, and/or efficiently maintain the implementation of services as their APIs and capabilities evolve.
    • The use of active ontologies as a method and apparatus for building assistants 1002, which simplifies the software engineering and data maintenance of automated assistant systems. Active ontologies are an integration of data modeling and execution environments for assistants. They provide a framework to tie together the various sources of models and data (domain concepts, task flows, vocabulary, language pattern recognizers, dialog context, user personal information, and mappings from domain and task requests to external services. Active ontologies and the other architectural innovations described herein make it practical to build deep functionality within domains, unifying multiple sources of information and services, and to do this across a set of domains.


In at least one embodiment, intelligent automated assistant 1002 may be operable to utilize and/or generate various different types of data and/or other types of information when performing specific tasks and/or operations. This may include, for example, input data/information and/or output data/information. For example, in at least one embodiment, intelligent automated assistant 1002 may be operable to access, process, and/or otherwise utilize information from one or more different types of sources, such as, for example, one or more local and/or remote memories, devices and/or systems. Additionally, in at least one embodiment, intelligent automated assistant 1002 may be operable to generate one or more different types of output data/information, which, for example, may be stored in memory of one or more local and/or remote devices and/or systems.


Examples of different types of input data/information which may be accessed and/or utilized by intelligent automated assistant 1002 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Voice input: from mobile devices such as mobile telephones and tablets, computers with microphones, Bluetooth headsets, automobile voice control systems, over the telephone system, recordings on answering services, audio voicemail on integrated messaging services, consumer applications with voice input such as clock radios, telephone station, home entertainment control systems, and game consoles.
    • Text input from keyboards on computers or mobile devices, keypads on remote controls or other consumer electronics devices, email messages sent to the assistant, instant messages or similar short messages sent to the assistant, text received from players in multiuser game environments, and text streamed in message feeds.
    • Location information coming from sensors or location-based systems. Examples include Global Positioning System (GPS) and Assisted GPS (A-GPS) on mobile phones. In one embodiment, location information is combined with explicit user input. In one embodiment, the system of the present invention is able to detect when a user is at home, based on known address information and current location determination. In this manner, certain inferences may be made about the type of information the user might be interested in when at home as opposed to outside the home, as well as the type of services and actions that should be invoked on behalf of the user depending on whether or not he or she is at home.
    • Time information from clocks on client devices. This may include, for example, time from telephones or other client devices indicating the local time and time zone. In addition, time may be used in the context of user requests, such as for instance, to interpret phrases such as “in an hour” and “tonight”.
    • Compass, accelerometer, gyroscope, and/or travel velocity data, as well as other sensor data from mobile or handheld devices or embedded systems such as automobile control systems. This may also include device positioning data from remote controls to appliances and game consoles.
    • Clicking and menu selection and other events from a graphical user interface (GUI) on any device having a GUI. Further examples include touches to a touch screen.
    • Events from sensors and other data-driven triggers, such as alarm clocks, calendar alerts, price change triggers, location triggers, push notification onto a device from servers, and the like.


The input to the embodiments described herein also includes the context of the user interaction history, including dialog and request history.


Examples of different types of output data/information which may be generated by intelligent automated assistant 1002 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Text output sent directly to an output device and/or to the user interface of a device
    • Text and graphics sent to a user over email
    • Text and graphics send to a user over a messaging service
    • Speech output, may include one or more of the following (or combinations thereof):
      • Synthesized speech
      • Sampled speech
      • Recorded messages
    • Graphical layout of information with photos, rich text, videos, sounds, and hyperlinks. For instance, the content rendered in a web browser.
    • Actuator output to control physical actions on a device, such as causing it to turn on or off, make a sound, change color, vibrate, control a light, or the like.
    • Invoking other applications on a device, such as calling a mapping application, voice dialing a telephone, sending an email or instant message, playing media, making entries in calendars, task managers, and note applications, and other applications.
    • Actuator output to control physical actions to devices attached or controlled by a device, such as operating a remote camera, controlling a wheelchair, playing music on remote speakers, playing videos on remote displays, and the like.


It may be appreciated that the intelligent automated assistant 1002 of FIG. 1 is but one example from a wide range of intelligent automated assistant system embodiments which may be implemented. Other embodiments of the intelligent automated assistant system (not shown) may include additional, fewer and/or different components/features than those illustrated, for example, in the example intelligent automated assistant system embodiment of FIG. 1.


User Interaction


Referring now to FIG. 2, there is shown an example of an interaction between a user and at least one embodiment of an intelligent automated assistant 1002. The example of FIG. 2 assumes that a user is speaking to intelligent automated assistant 1002 using input device 1206, which may be a speech input mechanism, and the output is graphical layout to output device 1207, which may be a scrollable screen. Conversation screen 101A features a conversational user interface showing what the user said 101B (“I'd like a romantic place for Italian food near my office”) and assistant's 1002 response, which is a summary of its findings 101C (“OK, I found these Italian restaurants which reviews say are romantic close to your work:”) and a set of results 101D (the first three of a list of restaurants are shown). In this example, the user clicks on the first result in the list, and the result automatically opens up to reveal more information about the restaurant, shown in information screen 101E. Information screen 101E and conversation screen 101A may appear on the same output device, such as a touchscreen or other display device; the examples depicted in FIG. 2 are two different output states for the same output device.


In one embodiment, information screen 101E shows information gathered and combined from a variety of services, including for example, any or all of the following:

    • Addresses and geolocations of businesses;
    • Distance from user's current location;
    • Reviews from a plurality of sources;


In one embodiment, information screen 101E also includes some examples of services that assistant 1002 might offer on behalf of the user, including:

    • Dial a telephone to call the business (“call”);
    • Remember this restaurant for future reference (“save”);
    • Send an email to someone with the directions and information about this restaurant (“share”);
    • Show the location of and directions to this restaurant on a map (“map it”);
    • Save personal notes about this restaurant (“my notes”).


As shown in the example of FIG. 2, in one embodiment, assistant 1002 includes intelligence beyond simple database applications, such as, for example,

    • Processing a statement of intent in a natural language 101B, not just keywords;
    • Inferring semantic intent from that language input, such as interpreting “place for Italian food” as “Italian restaurants”;
    • Operationalizing semantic intent into a strategy for using online services and executing that strategy on behalf of the user (e.g., operationalizing the desire for a romantic place into the strategy of checking online review sites for reviews that describe a place as “romantic”).


      Intelligent Automated Assistant Components


According to various embodiments, intelligent automated assistant 1002 may include a plurality of different types of components, devices, modules, processes, systems, and the like, which, for example, may be implemented and/or instantiated via the use of hardware and/or combinations of hardware and software. For example, as illustrated in the example embodiment of FIG. 1, assistant 1002 may include one or more of the following types of systems, components, devices, processes, and the like (or combinations thereof):

    • One or more active ontologies 1050;
    • Active input elicitation component(s) 1094 (may include client part 1094a and server part 1094b (see FIG. 7));
    • Short term personal memory component(s) 1052 (may include master version 1052b and cache 1052a (see FIG. 7));
    • Long-term personal memory component(s) 1054 (may include master version 1052b and cache 1052a (see FIG. 7));
    • Domain models component(s) 1056;
    • Vocabulary component(s) 1058 (may include complete vocabulary 1058b and subset 1058a (see FIG. 7));
    • Language pattern recognizer(s) component(s) 1060 (may include full library 1060b and subset 1560a (see FIG. 7));
    • Language interpreter component(s) 1070;
    • Domain entity database(s) 1072;
    • Dialog flow processor component(s) 1080;
    • Services orchestration component(s) 1082;
    • Services component(s) 1084;
    • Task flow models component(s) 1086;
    • Dialog flow models component(s) 1087;
    • Service models component(s) 1088;
    • Output processor component(s) 1090.


As described in connection with FIG. 7, in certain client/server-based embodiments, some or all of these components may be distributed between client 1304 and server 1340.


For purposes of illustration, at least a portion of the different types of components of a specific example embodiment of intelligent automated assistant 1002 will now be described in greater detail with reference to the example intelligent automated assistant 1002 embodiment of FIG. 1.


Active Ontologies 1050


Active ontologies 1050 serve as a unifying infrastructure that integrates models, components, and/or data from other parts of embodiments of intelligent automated assistants 1002. In the field of computer and information science, ontologies provide structures for data and knowledge representation such as classes/types, relations, attributes/properties and their instantiation in instances. Ontologies are used, for example, to build models of data and knowledge. In some embodiments of the intelligent automated assistant 1002, ontologies are part of the modeling framework in which to build models such as domain models.


Within the context of the present invention, an “active ontology” 1050 may also serve as an execution environment, in which distinct processing elements are arranged in an ontology-like manner (e.g., having distinct attributes and relations with other processing elements). These processing elements carry out at least some of the tasks of intelligent automated assistant 1002. Any number of active ontologies 1050 can be provided.


In at least one embodiment, active ontologies 1050 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Act as a modeling and development environment, integrating models and data from various model and data components, including but not limited to
      • Domain models 1056
      • Vocabulary 1058
      • Domain entity databases 1072
      • Task flow models 1086
      • Dialog flow models 1087
      • Service capability models 1088
    • Act as a data-modeling environment on which ontology-based editing tools may operate to develop new models, data structures, database schemata, and representations.
    • Act as a live execution environment, instantiating values for elements of domain 1056, task 1086, and/or dialog models 1087, language pattern recognizers, and/or vocabulary 1058, and user-specific information such as that found in short term personal memory 1052, long term personal memory 1054, and/or the results of service orchestration 1082. For example, some nodes of an active ontology may correspond to domain concepts such as restaurant and its property restaurant name. During live execution, these active ontology nodes may be instantiated with the identity of a particular restaurant entity and its name, and how its name corresponds to words in a natural language input utterance. Thus, in this embodiment, the active ontology is serving as both a modeling environment specifying the concept that restaurants are entities with identities that have names, and for storing dynamic bindings of those modeling nodes with data from entity databases and parses of natural language.
    • Enable the communication and coordination among components and processing elements of an intelligent automated assistant, such as, for example, one or more of the following (or combinations thereof):
      • Active input elicitation component(s) 1094
      • Language interpreter component(s) 1070
      • Dialog flow processor component(s) 1080
      • Services orchestration component(s) 1082
      • Services component(s) 1084


In one embodiment, at least a portion of the functions, operations, actions, and/or other features of active ontologies 1050 described herein may be implemented, at least in part, using various methods and apparatuses described in U.S. patent application Ser. No. 11/518,292 for “Method and Apparatus for Building an Intelligent Automated Assistant”, filed Sep. 8, 2006.


In at least one embodiment, a given instance of active ontology 1050 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by active ontologies 1050 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Static data that is available from one or more components of intelligent automated assistant 1002;
    • Data that is dynamically instantiated per user session, for example, but not limited to, maintaining the state of the user-specific inputs and outputs exchanged among components of intelligent automated assistant 1002, the contents of short term personal memory, the inferences made from previous states of the user session, and the like.


In this manner, active ontologies 1050 are used to unify elements of various components in intelligent automated assistant 1002. An active ontology 1050 allows an author, designer, or system builder to integrate components so that the elements of one component are identified with elements of other components. The author, designer, or system builder can thus combine and integrate the components more easily.


Referring now to FIG. 8, there is shown an example of a fragment of an active ontology 1050 according to one embodiment. This example is intended to help illustrate some of the various types of functions, operations, actions, and/or other features that may be provided by active ontologies 1050.


Active ontology 1050 in FIG. 8 includes representations of a restaurant and meal event. In this example, a restaurant is a concept 1610 with properties such as its name 1612, cuisines served 1615, and its location 1613, which in turn might be modeled as a structured node with properties for street address 1614. The concept of a meal event might be modeled as a node 1616 including a dining party 1617 (which has a size 1619) and time period 1618.

    • Active ontologies may include and/or make reference to domain models 1056. For example, FIG. 8 depicts a dining out domain model 1622 linked to restaurant concept 1610 and meal event concept 1616. In this instance, active ontology 1050 includes dining out domain model 1622; specifically, at least two nodes of active ontology 1050, namely restaurant 1610 and meal event 1616, are also included in and/or referenced by dining out domain model 1622. This domain model represents, among other things, the idea that dining out involves meal event that occur at restaurants. The active ontology nodes restaurant 1610 and meal event 1616 are also included and/or referenced by other components of the intelligent automated assistant, a shown by dotted lines in FIG. 8.
    • Active ontologies may include and/or make reference to task flow models 1086. For example, FIG. 8 depicts an event planning task flow model 1630, which models the planning of events independent of domains, applied to a domain-specific kind of event: meal event 1616. Here, active ontology 1050 includes general event planning task flow model 1630, which comprises nodes representing events and other concepts involved in planning them. Active ontology 1050 also includes the node meal event 1616, which is a particular kind of event. In this example, meal event 1616 is included or made reference to by both domain model 1622 and task flow model 1630, and both of these models are included in and/or referenced by active ontology 1050. Again, meal event 1616 is an example of how active ontologies can unify elements of various components included and/or referenced by other components of the intelligent automated assistant, a shown by dotted lines in FIG. 8.
    • Active ontologies may include and/or make reference to dialog flow models 1087. For example, FIG. 8 depicts a dialog flow model 1642 for getting the values of constraints required for a transaction instantiated on the constraint party size as represented in concept 1619. Again, active ontology 1050 provides a framework for relating and unifying various components such as dialog flow models 1087. In this case, dialog flow model 1642 has a general concept of a constraint that is instantiated in this particular example to the active ontology node party size 1619. This particular dialog flow model 1642 operates at the abstraction of constraints, independent of domain. Active ontology 1050 represents party size property 1619 of party node 1617, which is related to meal event node 1616. In such an embodiment, intelligent automated assistant 1002 uses active ontology 1050 to unify the concept of constraint in dialog flow model 1642 with the property of party size 1619 as part of a cluster of nodes representing meal event concept 1616, which is part of the domain model 1622 for dining out.
    • Active ontologies may include and/or make reference to service models 1088. For example, FIG. 8 depicts a model of a restaurant reservation service 1672 associated with the dialog flow step for getting values required for that service to perform a transaction. In this instance, service model 1672 for a restaurant reservation service specifies that a reservation requires a value for party size 1619 (the number of people sitting at a table to reserve). The concept party size 1619, which is part of active ontology 1050, also is linked or related to a general dialog flow model 1642 for asking the user about the constraints for a transaction; in this instance, the party size is a required constraint for dialog flow model 1642.
    • Active ontologies may include and/or make reference to domain entity databases 1072. For example, FIG. 8 depicts a domain entity database of restaurants 1652 associated with restaurant node 1610 in active ontology 1050. Active ontology 1050 represents the general concept of restaurant 1610, as may be used by the various components of intelligent automated assistant 1002, and it is instantiated by data about specific restaurants in restaurant database 1652.
    • Active ontologies may include and/or make reference to vocabulary databases 1058. For example, FIG. 8 depicts a vocabulary database of cuisines 1662, such as Italian, French, and the like, and the words associated with each cuisine such as “French”, “continental”, “provincial”, and the like. Active ontology 1050 includes restaurant node 1610, which is related to cuisines served node 1615, which is associated with the representation of cuisines in cuisines database 1662. A specific entry in database 1662 for a cuisine, such as “French”, is thus related through active ontology 1050 as an instance of the concept of cuisines served 1615.
    • Active ontologies may include and/or make reference to any database that can be mapped to concepts or other representations in ontology 1050. Domain entity databases 1072 and vocabulary databases 1058 are merely two examples of how active ontology 1050 may integrate databases with each other and with other components of automated assistant 1002. Active ontologies allow the author, designer, or system builder to specify a nontrivial mapping between representations in the database and representations in ontology 1050. For example, the database schema for restaurants database 1652 may represent a restaurant as a table of strings and numbers, or as a projection from a larger database of business, or any other representation suitable for database 1652. In this example active ontology 1050, restaurant 1610 is a concept node with properties and relations, organized differently from the database tables. In this example, nodes of ontology 1050 are associated with elements of database schemata. The integration of database and ontology 1050 provides a unified representation for interpreting and acting on specific data entries in databases in terms of the larger sets of models and data in active ontology 1050. For instance, the word “French” may be an entry in cuisines database 1662. Because, in this example, database 1662 is integrated in active ontology 1050, that same word “French” also has an interpretation as a possible cuisine served at a restaurant, which is involved in planning meal events, and this cuisine serves as a constraint to use when using restaurants reservation services, and so forth. Active ontologies can thus integrate databases into the modeling and execution environment to inter-operate with other components of automated assistant 1002.


As described above, active ontology 1050 allows the author, designer, or system builder to integrate components; thus, in the example of FIG. 8, the elements of a component such as constraint in dialog flow model 1642 can be identified with elements of other components such as required parameter of restaurant reservation service 1672.


Active ontologies 1050 may be embodied as, for example, configurations of models, databases, and components in which the relationships among models, databases, and components are any of:

    • containership and/or inclusion;
    • relationship with links and/or pointers;
    • interface over APIs, both internal to a program and between programs.


For example, referring now to FIG. 9, there is shown an example of an alternative embodiment of intelligent automated assistant 1002, wherein domain models 1056, vocabulary 1058, language pattern recognizers 1060, short term personal memory 1052, and long term personal memory 1054 components are organized under a common container associated with active ontology 1050, and other components such as active input elicitation component(s) 1094, language interpreter 1070 and dialog flow processor 1080 are associated with active ontology 1050 via API relationships.


Active Input Elicitation Component(s) 1094


In at least one embodiment, active input elicitation component(s) 1094 (which, as described above, may be implemented in a stand-alone configuration or in a configuration including both server and client components) may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Elicit, facilitate and/or process input from the user or the user's environment, and/or information about their need(s) or request(s). For example, if the user is looking to find a restaurant, the input elicitation module may get information about the user's constraints or preferences for location, time, cuisine, price, and so forth.
    • Facilitate different kinds of input from various sources, such as for example, one or more of the following (or combinations thereof):
      • input from keyboards or any other input device that generates text
      • input from keyboards in user interfaces that offer dynamic suggested completions of partial input
      • input from voice or speech input systems
      • input from Graphical User Interfaces (GUIs) in which users click, select, or otherwise directly manipulate graphical objects to indicate choices
      • input from other applications that generate text and send it to the automated assistant, including email, text messaging, or other text communication platforms


By performing active input elicitation, assistant 1002 is able to disambiguate intent at an early phase of input processing. For example, in an embodiment where input is provided by speech, the waveform might be sent to a server 1340 where words are extracted, and semantic interpretation performed. The results of such semantic interpretation can then be used to drive active input elicitation, which may offer the user alternative candidate words to choose among based on their degree of semantic fit as well as phonetic match.


In at least one embodiment, active input elicitation component(s) 1094 actively, automatically, and dynamically guide the user toward inputs that may be acted upon by one or more of the services offered by embodiments of assistant 1002. Referring now to FIG. 10, there is shown a flow diagram depicting a method of operation for active input elicitation component(s) 1094 according to one embodiment.


The procedure begins 20. In step 21, assistant 1002 may offer interfaces on one or more input channels. For example, a user interface may offer the user options to speak or type or tap at any stage of a conversational interaction. In step 22, the user selects an input channel by initiating input on one modality, such as pressing a button to start recording speech or to bring up an interface for typing.


In at least one embodiment, assistant 1002 offers default suggestions for the selected modality 23. That is, it offers options 24 that are relevant in the current context prior to the user entering any input on that modality. For example, in a text input modality, assistant 1002 might offer a list of common words that would begin textual requests or commands such as, for example, one or more of the following (or combinations thereof): imperative verbs (e.g., find, buy, reserve, get, call, check, schedule, and the like), nouns (e.g., restaurants, movies, events, businesses, and the like), or menu-like options naming domains of discourse (e.g., weather, sports, news, and the like)


If the user selects one of the default options in 25, and a preference to autosubmit 30 is set, the procedure may return immediately. This is similar to the operation of a conventional menu selection.


However, the initial option may be taken as a partial input, or the user may have started to enter a partial input 26. At any point of input, in at least one embodiment, the user may choose to indicate that the partial input is complete 27, which causes the procedure to return.


In 28, the latest input, whether selected or entered, is added to the cumulative input.


In 29, the system suggestions next possible inputs that are relevant given the current input and other sources of constraints on what constitutes relevant and/or meaningful input.


In at least one embodiment, the sources of constraints on user input (for example, which are used in steps 23 and 29) are one or more of the various models and data sources that may be included in assistant 1002, which may include, but are not limited to, one or more of the following (or combinations thereof):

    • Vocabulary 1058. For example, words or phrases that match the current input may be suggested. In at least one embodiment, vocabulary may be associated with any or one or more nodes of active ontologies, domain models, task models, dialog models, and/or service models.
    • Domain models 1056, which may constrain the inputs that may instantiate or otherwise be consistent with the domain model. For example, in at least one embodiment, domain models 1056 may be used to suggest concepts, relations, properties, and/or instances that would be consistent with the current input.
    • Language pattern recognizers 1060, which may be used to recognize idioms, phrases, grammatical constructs, or other patterns in the current input and be used to suggest completions that fill out the pattern.
    • Domain entity databases 1072, which may be used to suggest possible entities in the domain that match the input (e.g., business names, movie names, event names, and the like).
    • Short term personal memory 1052, which may be used to match any prior input or portion of prior input, and/or any other property or fact about the history of interaction with a user. For example, partial input may be matched against cities that the user has encountered in a session, whether hypothetically (e.g., mentioned in queries) and/or physically (e.g., as determined from location sensors).
    • In at least one embodiment, semantic paraphrases of recent inputs, request, or results may be matched against the current input. For example, if the user had previously request “live music” and obtained concert listing, and then typed “music” in an active input elicitation environment, suggestions may include “live music” and/or “concerts”.
    • Long term personal memory 1054, which may be used to suggest matching items from long term memory. Such matching items may include, for example, one or more or any combination of: domain entities that are saved (e.g., “favorite” restaurants, movies, theaters, venues, and the like), to-do items, list items, calendar entries, people names in contacts/address books, street or city names mentioned in contact/address books, and the like.
    • Task flow models 1086, which may be used to suggest inputs based on the next possible steps of in a task flow.
    • Dialog flow models 1087, which may be used to suggest inputs based on the next possible steps of in a dialog flow.
    • Service capability models 1088, which may be used to suggest possible services to employ, by name, category, capability, or any other property in the model. For example, a user may type part of the name of a preferred review site, and assistant 1002 may suggest a complete command for querying that review site for review.


In at least one embodiment, active input elicitation component(s) 1094 present to the user a conversational interface, for example, an interface in which the user and assistant communicate by making utterances back and forth in a conversational manner. Active input elicitation component(s) 1094 may be operable to perform and/or implement various types of conversational interfaces.


In at least one embodiment, active input elicitation component(s) 1094 may be operable to perform and/or implement various types of conversational interfaces in which assistant 1002 uses plies of the conversation to prompt for information from the user according to dialog models. Dialog models may represent a procedure for executing a dialog, such as, for example, a series of steps required to elicit the information needed to perform a service.


In at least one embodiment, active input elicitation component(s) 1094 offer constraints and guidance to the user in real time, while the user is in the midst of typing, speaking, or otherwise creating input. For example, active elicitation may guide the user to type text inputs that are recognizable by an embodiment of assistant 1002 and/or that may be serviced by one or more services offered by embodiments of assistant 1002. This is an advantage over passively waiting for unconstrained input from a user because it enables the user's efforts to be focused on inputs that may or might be useful, and/or it enables embodiments of assistant 1002 to apply its interpretations of the input in real time as the user is inputting it.


At least a portion of the functions, operations, actions, and/or other features of active input elicitation described herein may be implemented, at least in part, using various methods and apparatuses described in U.S. patent application Ser. No. 11/518,292 for “Method and Apparatus for Building an Intelligent Automated Assistant”, filed Sep. 8, 2006.


According to specific embodiments, multiple instances or threads of active input elicitation component(s) 1094 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


According to different embodiments, one or more different threads or instances of active input elicitation component(s) 1094 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of active input elicitation component(s) 1094. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of active input elicitation component(s) 1094 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Start of user session. For example, when the user session starts up an application that is an embodiment of assistant 1002, the interface may offer the opportunity for the user to initiate input, for example, by pressing a button to initiate a speech input system or clicking on a text field to initiate a text input session.
    • User input detected.
    • When assistant 1002 explicitly prompts the user for input, as when it requests a response to a question or offers a menu of next steps from which to choose.
    • When assistant 1002 is helping the user perform a transaction and is gathering data for that transaction, e.g., filling in a form.


In at least one embodiment, a given instance of active input elicitation component(s) 1094 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by active input elicitation component(s) 1094 may include, but are not limited to, one or more of the following (or combinations thereof):

    • database of possible words to use in a textual input;
    • grammar of possible phrases to use in a textual input utterance;
    • database of possible interpretations of speech input;
    • database of previous inputs from a user or from other users;
    • data from any of the various models and data sources that may be part of embodiments of assistant 1002, which may include, but are not limited to, one or more of the following (or combinations thereof):
      • Domain models 1056;
      • Vocabulary 1058;
      • Language pattern recognizers 1060;
      • Domain entity databases 1072;
      • Short term personal memory 1052;
      • Long term personal memory 1054;
      • Task flow models 1086;
      • Dialog flow models 1087;
      • Service capability models 1088.


According to different embodiments, active input elicitation component(s) 1094 may apply active elicitation procedures to, for example, one or more of the following (or combinations thereof):

    • typed input;
    • speech input;
    • input from graphical user interfaces (GUIs), including gestures;
    • input from suggestions offered in a dialog; and
    • events from the computational and/or sensed environments.


      Active Typed Input Elicitation


Referring now to FIG. 11, there is shown a flow diagram depicting a method for active typed input elicitation according to one embodiment.


The method begins 110. Assistant 1002 receives 111 partial text input, for example via input device 1206. Partial text input may include, for example, the characters that have been typed so far in a text input field. At any time, a user may indicate that the typed input is complete 112, as, for example, by pressing an Enter key. If not complete, a suggestion generator generates 114 candidate suggestions 116. These suggestions may be syntactic, semantic, and/or other kinds of suggestion based any of the sources of information or constraints described herein. If the suggestion is selected 118, the input is transformed 117 to include the selected suggestion.


In at least one embodiment, the suggestions may include extensions to the current input. For example, a suggestion for “rest” may be “restaurants”.


In at least one embodiment, the suggestions may include replacements of parts of the current input. For example, a suggestion for “rest” may be “places to eat”.


In at least one embodiment, the suggestions may include replacing and rephrasing of parts of the current input. For example, if the current input is “find restaurants of style” a suggestion may be “italian” and when the suggestion is chosen, the entire input may be rewritten as “find Italian restaurants”.


In at least one embodiment, the resulting input that is returned is annotated 119, so that information about which choices were made in 118 is preserved along with the textual input. This enables, for example, the semantic concepts or entities underlying a string to be associated with the string when it is returned, which improves accuracy of subsequent language interpretation.


Referring now to FIGS. 12 to 21, there are shown screen shots illustrating some portions of some of the procedures for active typed-input elicitation according to one embodiment. The screen shots depict an example of an embodiment of assistant 1002 as implemented on a smartphone such as the iPhone available from Apple Inc. of Cupertino, Calif. Input is provided to such device via a touchscreen, including on-screen keyboard functionality. One skilled in the art will recognize that the screen shots depict an embodiment that is merely exemplary, and that the techniques of the present invention can be implemented on other devices and using other layouts and arrangements.


In FIG. 12, screen 1201 includes a top-level set of suggestions 1202 shown when no input has been provided in field 1203. This corresponds to no-input step 23 of FIG. 10 applied to step 114 of FIG. 11 where there is no input.


In FIG. 13, screen 1301 depicts an example of the use of vocabulary to offer suggested completions 1303 of partial user input 1305 entered in field 1203 using on-screen keyboard 1304. These suggested completions 1303 may be part of the function of active input elicitation 1094. The user has entered partial user input 1305 including the string “comm”. Vocabulary component 1058 has provided a mapping of this string into three different kinds of instances, which are listed as suggested completions 1303: the phrase “community & local events” is a category of the events domain; “chambers of commerce” is a category of the local business search domain, and “Jewish Community Center” is the name of an instance of local businesses. Vocabulary component 1058 may provide the data lookup and management of name spaces like these. The user can tap Go button 1306 to indicate that he or she has finished entering input; this causes assistant 1002 to proceed with the completed text string as a unit of user input.


In FIG. 14, screen 1401 depicts an example in which suggested semantic completions 1303 for a partial string “wh” 1305 include entire phrases with typed parameters. These kinds of suggestions may be enabled by the use of one or more of the various models and sources of input constraints described herein. For example, in one embodiment shown in FIG. 14, “what is happening in city” is an active elicitation of the location parameter of the Local Events domain; “where is business name” is an active elicitation of the Business Name constraint of the Local Business Search domain; “what is showing at the venue name” is an active elicitation of the Venue Name constraint of the Local Events domain; and “what is playing at the movie theater” is an active elicitation of the Movie Theater Name constraint of the Local Events domain. These examples illustrate that the suggested completions are generated by models rather than simply drawn from a database of previously entered queries.


In FIG. 15, screen 1501 depicts a continuation of the same example, after the user has entered additional text 1305 in field 1203. Suggested completions 1303 are updated to match the additional text 1305. In this example, data from a domain entity database 1072 were used: venues whose name starts with “f”. Note that this is a significantly smaller and more semantically relevant set of suggestions than all words that begin with “f”. Again, the suggestions are generated by applying a model, in this case the domain model that represents Local Events as happening at Venues, which are Businesses with Names. The suggestions actively elicit inputs that would make potentially meaningful entries when using a Local Events service.


In FIG. 16, screen 1601 depicts a continuation of the same example, after the user has selected one of suggested completions 1303. Active elicitation continues by prompting the user to further specify the type of information desired, here by presenting a number of specifiers 1602 from which the user can select. In this example, these specifiers are generated by the domain, task flow, and dialog flow models. The Domain is Local Events, which includes Categories of events that happen on Dates in Locations and have Event Names and Feature Performers. In this embodiment, the fact that these five options are offered to the user is generated from the Dialog Flow model that indicates that users should be asked for Constraints that they have not yet entered and from the Service Model that indicates that these five Constraints are parameters to Local Event services available to the assistant. Even the choice of preferred phrases to use as specifiers, such as “by category” and “featured”, are generated from the Domain Vocabulary databases.


In FIG. 17, screen 1701 depicts a continuation of the same example, after the user has selected one of specifiers 1602.


In FIG. 18, screen 1801 depicts a continuation of the same example, wherein the selected specifier 1602 has been added to field 1203, and additional specifiers 1602 are presented. The user can select one of specifiers 1602 and/or provide additional text input via keyboard 1304.


In FIG. 19, screen 1901 depicts a continuation of the same example, wherein the selected specifier 1602 has been added to field 1203, and yet more specifiers 1602 are presented. In this example, previously entered constraints are not actively elicited redundantly.


In FIG. 20, screen 2001 depicts a continuation of the same example, wherein the user has tapped the Go button 1306. The user's input is shown in box 2002, and a message is shown in box 2003, providing feedback to the user as to the query being performed in response to the user's input.


In FIG. 21, screen 2101 depicts a continuation of the same example, wherein results have been found. Message is shown in box 2102. Results 2103, including input elements allowing the user to view further details, save the identified event, buy tickets, add notes, or the like.


In one screen 2101, and other displayed screens, are scrollable, allowing the user to scroll upwards to see screen 2001 or other previously presented screens, and to make changes to the query if desired.


Active Speech Input Elicitation


Referring now to FIG. 22, there is shown a flow diagram depicting a method for active input elicitation for voice or speech input according to one embodiment.


The method begins 221. Assistant 1002 receives voice or speech input 121 in the form of an auditory signal. A speech-to-text service 122 or processor generates a set of candidate text interpretations 124 of the auditory signal. In one embodiment, speech-to-text service 122 is implemented using, for example, Nuance Recognizer, available from Nuance Communications, Inc. of Burlington, Mass.


In one embodiment, assistant 1002 employs statistical language models to generate candidate text interpretations 124 of speech input 121.


In addition, in one embodiment, the statistical language models are tuned to look for words, names, and phrases that occur in the various models of assistant 1002 shown in FIG. 8. For example, in at least one embodiment the statistical language models are given words, names, and phrases from some or all of: domain models 1056 (e.g., words and phrases relating to restaurant and meal events), task flow models 1086 (e.g., words and phrases relating to planning an event), dialog flow models 1087 (e.g., words and phrases related to the constraints that are needed to gather the inputs for a restaurant reservation), domain entity databases 1072 (e.g., names of restaurants), vocabulary databases 1058 (e.g., names of cuisines), service models 1088 (e.g., names of service provides such as OpenTable), and/or any words, names, or phrases associated with any node of active ontology 1050.


In one embodiment, the statistical language models are also tuned to look for words, names, and phrases from long-term personal memory 1054. For example, statistical language models can be given text from to-do items, list items, personal notes, calendar entries, people names in contacts/address books, email addresses, street or city names mentioned in contact/address books, and the like.


A ranking component analyzes the candidate interpretations 124 and ranks 126 them according to how well they fit syntactic and/or semantic models of intelligent automated assistant 1002. Any sources of constraints on user input may be used. For example, in one embodiment, assistant 1002 may rank the output of the speech-to-text interpreter according to how well the interpretations parse in a syntactic and/or semantic sense, a domain model, task flow model, and/or dialog model, and/or the like: it evaluates how well various combinations of words in the text interpretations 124 would fit the concepts, relations, entities, and properties of active ontology 1050 and its associated models. For example, if speech-to-text service 122 generates the two candidate interpretations “italian food for lunch” and “italian shoes for lunch”, the ranking by semantic relevance 126 might rank “italian food for lunch” higher if it better matches the nodes assistant's 1002 active ontology 1050 (e.g., the words “italian”, “food” and “lunch” all match nodes in ontology 1050 and they are all connected by relationships in ontology 1050, whereas the word “shoes” does not match ontology 1050 or matches a node that is not part of the dining out domain network).


In various embodiments, algorithms or procedures used by assistant 1002 for interpretation of text inputs, including any embodiment of the natural language processing procedure shown in FIG. 28, can be used to rank and score candidate text interpretations 124 generated by speech-to-text service 122.


In one embodiment, if ranking component 126 determines 128 that the highest-ranking speech interpretation from interpretations 124 ranks above a specified threshold, the highest-ranking interpretation may be automatically selected 130. If no interpretation ranks above a specified threshold, possible candidate interpretations of speech 134 are presented 132 to the user. The user can then select 136 among the displayed choices.


In various embodiments, user selection 136 among the displayed choices can be achieved by any mode of input, including for example any of the modes of multimodal input described in connection with FIG. 26. Such input modes include, without limitation, actively elicited typed input 2610, actively elicited speech input 2620, actively presented GUI for input 2640, and/or the like. In one embodiment, the user can select among candidate interpretations 134, for example by tapping or speaking. In the case of speaking, the possible interpretation of the new speech input is highly constrained by the small set of choices offered 134. For example, if offered “Did you mean italian food or italian shoes?” the user can just say “food” and the assistant can match this to the phrase “italian food” and not get it confused with other global interpretations of the input.


Whether input is automatically selected 130 or selected 136 by the user, the resulting input 138 is returned. In at least one embodiment, the returned input is annotated 138, so that information about which choices were made in step 136 is preserved along with the textual input. This enables, for example, the semantic concepts or entities underlying a string to be associated with the string when it is returned, which improves accuracy of subsequent language interpretation. For example, if “Italian food” was offered as one of the candidate interpretations 134 based on a semantic interpretation of Cuisine=ItalianFood, then the machine-readable semantic interpretation can be sent along with the user's selection of the string “Italian food” as annotated text input 138.


In at least one embodiment, candidate text interpretations 124 are generated based on speech interpretations received as output of speech-to-text service 122.


In at least one embodiment, candidate text interpretations 124 are generated by paraphrasing speech interpretations in terms of their semantic meaning. In some embodiments, there can be multiple paraphrases of the same speech interpretation, offering different word sense or homonym alternatives. For example, if speech-to-text service 122 indicates “place for meet”, the candidate interpretations presented to the user could be paraphrased as “place to meet (local businesses)” and “place for meat (restaurants)”.


In at least one embodiment, candidate text interpretations 124 include offers to correct substrings.


In at least one embodiment, candidate text interpretations 124 include offers to correct substrings of candidate interpretations using syntactic and semantic analysis as described herein.


In at least one embodiment, when the user selects a candidate interpretation, it is returned.


In at least one embodiment, the user is offered an interface to edit the interpretation before it is returned.


In at least one embodiment, the user is offered an interface to continue with more voice input before input is returned. This enables one to incrementally build up an input utterance, getting syntactic and semantic corrections, suggestions, and guidance at one iteration.


In at least one embodiment, the user is offered an interface to proceed directly from 136 to step 111 of a method of active typed input elicitation (described above in connection with FIG. 11). This enables one to interleave typed and spoken input, getting syntactic and semantic corrections, suggestions, and guidance at one step.


In at least one embodiment, the user is offered an interface to proceed directly from step 111 of an embodiment of active typed input elicitation to an embodiment of active speech input elicitation. This enables one to interleave typed and spoken input, getting syntactic and semantic corrections, suggestions, and guidance at one step.


Active GUI-Based Input Elicitation


Referring now to FIG. 23, there is shown a flow diagram depicting a method for active input elicitation for GUI-based input according to one embodiment.


The method begins 140. Assistant 1002 presents 141 graphical user interface (GUI) on output device 1207, which may include, for example, links and buttons. The user interacts 142 with at least one GUI element. Data 144 is received, and converted 146 to a uniform format. The converted data is then returned.


In at least one embodiment, some of the elements of the GUI are generated dynamically from the models of the active ontology, rather than written into a computer program. For example, assistant 1002 can offer a set of constraints to guide a restaurant reservation service as regions for tapping on a screen, with each region representing the name of the constraint and/or a value. For instance, the screen could have rows of a dynamically generated GUI layout with regions for the constraints Cuisine, Location, and Price Range. If the models of the active ontology change, the GUI screen would automatically change without reprogramming.


Active Dialog Suggestion Input Elicitation



FIG. 24 is a flow diagram depicting a method for active input elicitation at the level of a dialog flow according to one embodiment.


The method begins 150. Assistant 1002 suggests 151 possible responses 152. The user selects 154 a suggested response. The received input is converted 154 to a uniform format. The converted data is then returned.


In at least one embodiment, the suggestions offered in step 151 are offered as follow-up steps in a dialog and/or task flow.


In at least one embodiment, the suggestions offer options to refine a query, for example using parameters from a domain and/or task model. For example, one may be offered to change the assumed location or time of a request.


In at least one embodiment, the suggestions offer options to choose among ambiguous alternative interpretations given by a language interpretation procedure or component.


In at least one embodiment, the suggestions offer options to choose among ambiguous alternative interpretations given by a language interpretation procedure or component.


In at least one embodiment, the suggestions offer options to choose among next steps in a workflow associated dialog flow model 1087. For example, dialog flow model 1087 may suggest that after gathering the constrained for one domain (e.g., restaurant dining), assistant 1002 should suggest other related domains (e.g., a movie nearby).


Active Monitoring for Relevant Events


In at least one embodiment, asynchronous events may be treated as inputs in an analogous manner to the other modalities of active elicited input. Thus, such events may be provided as inputs to assistant 1002. Once interpreted, such events can be treated in a manner similar to any other input.


For example, a flight status change may initiate an alert notification to be sent to a user. If a flight is indicated as being late, assistant 1002 may continue the dialog by presenting alternative flights, making other suggestions, and the like, based on the detected event.


Such events can be of any type. For example, assistant 1002 might detect that the user just got home, or is lost (off a specified route), or that a stock price hit a threshold value, or that a television show the user is interested in is starting, or that a musician of interest is touring in the area. In any of these situations, assistant 1002 can proceed with a dialog in substantially the same manner as if the user had him- or herself initiated the inquiry. In one embodiment, events can even be based on data provided from other devices, for example to tell the user when a coworker has returned from lunch (the coworker's device can signal such an event to the user's device, at which time assistant 1002 installed on the user's device responds accordingly).


In one embodiment, the events can be notifications or alerts from a calendar, clock, reminder, or to-do application. For example, an alert from a calendar application about a dinner date can initiate a dialog with assistant 1002 about the dining event. The dialog can proceed as if the user had just spoken or typed the information about the upcoming dinner event, such as “dinner for 2 in San Francisco”.


In one embodiment, the context of possible event trigger 162 (FIG. 25) can include information about people, places, times, and other data. These data can be used as part of the input to assistant 1002 to use in various steps of processing.


In one embodiment, these data from the context of event trigger 162 can be used to disambiguate speech or text inputs from the user. For example, if a calendar event alert includes the name of a person invited to the event, that information can help disambiguate input which might match several people with the same or similar name.


Referring now to FIG. 25, there is shown a flow diagram depicting a method for active monitoring for relevant events according to one embodiment. In this example, event trigger events are sets of input 162. Assistant 1002 monitors 161 for such events. Detected events may be filtered and sorted 164 for semantic relevance using models, data and information available from other components in intelligent automated assistant 1002. For example, an event that reports a change in flight status may be given higher relevance if the short-term or long-term memory records for a user indicate that the user is on that flight and/or have made inquiries about it to assistant 1002. This sorting and filtering may then present only the top events for review by the user, who may then choose to pick one or more and act on them.


Event data is converted 166 to a uniform input format, and returned.


In at least one embodiment, assistant 1002 may proactively offer services associated with events that were suggested for user attention. For example, if a flight status alert indicates a flight may be missed, assistant 1002 may suggest to the user a task flow for re-planning the itinerary or booking a hotel.


Input Elicitation Component(s) Example:


The following example is intended to help illustrate some of the various types of functions, operations, actions, and/or other features which may be provided by active input elicitation component(s) 1094.


Example: Command Completion (What can the User Say to Assistant 1002?)


The user is facing a text input box with the general instruction to enter “what do you want to do?” Depending on the context and the user input, any of several system responses are provided. Examples are shown below












Case: Null input









User Input
System Response
Comment





With an empty
Find restaurants, hotels,
Black text would


field and no
movies, . . .
be inserted into


dialog context,
Book a table, a room, a seat, . . .
the input field.


type a question
Order food, flowers, . . .
Italicized text


or space charac-
Buy a ticket, a book, a DVD, . . .
would be the


ter, or enter
Schedule a meeting, an event, . . .
follow-up sugges-


nothing for some
Remember to a thing to do . . .
tions once the


period of time.
Explain results
text was inserted.


|



















Case: First word input









User Input
System Response
Comment





With empty dialog
Find restaurants,
Black text would be


context If the user
hotels, movies, . . .
inserted into the input


types the first letter of

field. Italicized text


any command, it is

would be the follow-up


suggested. For

suggestions once the


example

text was inserted.


F |



















Case: Key word input









User Input
System Response
Comment





With empty dialog

Remember to a thing

Black text would be


context If the user
to do . . .
inserted into the input


types the first two
Find restaurants by
field. Italicized text


letters of any
location, cuisine,
would be the follow-up


keyword, it is

suggestions once the


suggested as well as

text was inserted.


command. For




example




Re|



















Case: Prompting for arguments









User Input
System Response
Comment





The user has entered
restaurants by location,
Offer not only the


or selected a
cuisine, . . .
selection class but


“command” verb and
hotels by location,
advertise the constraint


nothing else. For
availability, . . .
options. Note that


example,
movies by location,
name of place is a just


Find_|
genre, . . .
a prompt, and would



name of place
not insert text.



















Case: Suggesting criteria









User Input
System Response
Comment





The user has already
in city, zip code
Black text would be


entered enough to
near home, office,
inserted into the input


establish a task and
place name
field. Italicized text


domain, and now is
named restaurant
would be the follow-up


prompted for
name
suggestions once the


constraints in order.

text was inserted.


Find restaurants_|



















Case: Adding criteria









User Input
System Response
Comment





The user has said “in”
city, zip code
Until they enter the


and now is prompted
Palo Alto, CA
next word, the


for locations
Menlo Park, CA
suggestions are a


Find restaurants in_|

prompt for what kind


The user has said
my home
of thing to type. The


“near” and now is
my work
Places are cities from


prompted for
Palo Alto, CA
personal memory.


locations
Menlo Park, CA
The Places are one or


Find restaurants

more places from


near_|

personal memory.



















Case: Adding location or other constraints









User Input
System Response
Comment





Find restaurants in
serving food type or cuisine
Prompt for


Palo Alto_|
with availability tonight, tomorrow,
other



. . .
constraints



described as romantic, good service
The 7:00 and


Find restaurants in
tonight
9:00 are our


Palo Alto with
tomorrow
suggestions


availability_|
at 7pm
based on



at 9m
current time



other time or date



















Case: Starting from constraint, unknown task or domain









User Input
System Response
Comment





romantic _|
restaurants by location,
Constraint value from



cuisine, . . .
ontology tells you



hotels by location,
which selection



availability, . . .
classes to use.



movies by location, genre, . . .



comedy_|
movies by location, genre, . . .
“comedy” is a



events by location, . . .
constraint value for



clubs by location
genre in movies, a




genre in events, and




“comedy clubs” is a




local directory




business category










Example: Name Completion


Here, the user has typed some text without accepting any of the commands, or he or she is just extending a command with an entity name. The system may attempt to complete the names, depending on context. It also disambiguates the domain.












Case: words without context









User Input
System Response
Comment





il for
Il Fornaio (restaurant)
May require entity name lookup.



Ill Forgotten Gains
Notice multi-word completion.



(movie)
Show domain as a suggestion.


tom cruise
movies



romantic
movies
May require entity name lookup.



restaurants
Based on ontology only



















Case: name with context









User Input
System Response
Comment





Find restaurants
Il Fornaio
May require entity name lookup.


il for
(restaurant)
Uses selection class and location




context from current and past




queries to constrain completion.




Show domain as a suggestion.


tom cruise
movies
May require entity name lookup.


Find movies rom
romantic
Based on ontology only



Roman Holiday




(movie)



g-rated
movies










Example:


Choosing Values from a Set

Here, the user is responding to a system request to enter a value for a specific parameter, such as location, time, cuisine, or genre. The user may either select from a list or enter a value. As she types, matching items from the list are shown as options. Examples are shown below.












Case: valueclass selection











User Input
System Response
Comment






Restaurants
burgers
User may type anything



serving
Ice cream
else and doesn't have




Hot dogs
to pick from the menu



Restaurants
Hamburgers




serving h
Hot dogs





Hot sauce




Movies
today




playing
tonight





Friday night










Example:


Reusing Previous Commands

Previous queries are also options to complete on in an autocomplete interface. They may be just matched as strings (when the input field is empty and there are no known constraints) or they may be suggested as relevant when in certain situations.












Case: completion on previous queries









User Input
System Response
Comment





Ital

Italian restaurants (normal

Using string matching



completion)
to retrieve previous



Films starring Italian actors
queries



(recent query)



Lunch
lunch places in marin (recent query)




buy the book naked lunch










Example: Retrieving Personal Memory Items


Assistant 1002 may remember certain events and/or entities in personal memory associated with the user. Autocomplete can be performed based on such remembered items. Examples appear below.












Case: completion on events and entities in personal memory









User Input
System Response
Comment











Mary
lunch with Mary on Saturday (from My



Events)


Lunch
film called “Something about Mary



lunch with Mary on Saturday (from My



Events)


Hob
buy the book naked lunch (from My Todos)



Hobee's Restaurant in Palo Alto (from My



Restaurants)










Multimodal Active Input Elicitation


In at least one embodiment, active input elicitation component(s) 1094 may process input from a plurality of input modalities. At least one modality might be implemented with an active input elicitation procedure that takes advantages of the particular kinds of inputs and methods for selecting from suggested options. A described herein, they may be embodiments of procedures for active input elicitation for text input, speech input, GUI-based input, input in the context of a dialog, and/or input resulting from event triggers.


In at least one embodiment, for a single instance of intelligent automated assistant 1002, there may be support for one or more (or any combination of) typed input, speech input, GUI input, dialog input, and/or event input.


Referring now to FIG. 26, there is shown a flow diagram depicting a method for multimodal active input elicitation according to one embodiment. The method begins 100. Inputs may be received concurrently from one or more or any combination of the input modalities, in any sequence. Thus, the method includes actively eliciting typed input 2610, speech input 2620, GUI-based input 2640, input in the context of a dialog 2650, and/or input resulting from event triggers 2660. Any or all of these input sources are unified into unified input format 2690 and returned. Unified input format 2690 enables the other components of intelligent automated assistant 1002 to be designed and to operate independently of the particular modality of the input.


Offering active guidance for multiple modalities and levels enables constraint and guidance on the input beyond those available to isolated modalities. For example, the kinds of suggestions offered to choose among speech, text, and dialog steps are independent, so their combination is a significant improvement over adding active elicitation techniques to individual modalities or levels.


Combining multiple sources of constraints as described herein (syntactic/linguistic, vocabulary, entity databases, domain models, task models, service models, and the like) and multiple places where these constraints may be actively applied (speech, text, GUI, dialog, and asynchronous events) provides a new level of functionality for human-machine interaction.


Domain Models Component(s) 1056


Domain models 1056 component(s) include representations of the concepts, entities, relations, properties, and instances of a domain. For example, dining out domain model 1622 might include the concept of a restaurant as a business with a name and an address and phone number, the concept of a meal event with a party size and date and time associated with the restaurant.


In at least one embodiment, domain models component(s) 1056 of assistant 1002 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Domain model component(s) 1056 may be used by automated assistant 1002 for several processes, including: eliciting input 100, interpreting natural language 200, dispatching to services 400, and generating output 600.
    • Domain model component(s) 1056 may provide lists of words that might match a domain concept or entity, such as names of restaurants, which may be used for active elicitation of input 100 and natural language processing 200.
    • Domain model component(s) 1056 may classify candidate words in processes, for instance, to determine that a word is the name of a restaurant.
    • Domain model component(s) 1056 may show the relationship between partial information for interpreting natural language, for example that cuisine may be associated with business entities (e.g., “local Mexican food” may be interpreted as “find restaurants with style=Mexican”, and this inference is possible because of the information in domain model 1056).
    • Domain model component(s) 1056 may organize information about services used in service orchestration 1082, for example, that a particular web service may provide reviews of restaurants.
    • Domain model component(s) 1056 may provide the information for generating natural language paraphrases and other output formatting, for example, by providing canonical ways of describing concepts, relations, properties and instances.


According to specific embodiments, multiple instances or threads of the domain models component(s) 1056 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of domain models component(s) 1056 may be performed, implemented and/or initiated by one or more of the following types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof):

    • Domain models component(s) 1056 may be implemented as data structures that represent concepts, relations, properties, and instances. These data structures may be stored in memory, files, or databases.
    • Access to domain model component(s) 1056 may be implemented through direct APIs, network APIs, database query interfaces, and/or the like.
    • Creation and maintenance of domain models component(s) 1056 may be achieved, for example, via direct editing of files, database transactions, and/or through the use of domain model editing tools.
    • Domain models component(s) 1056 may be implemented as part of or in association with active ontologies 1050, which combine models with instantiations of the models for servers and users.


According to various embodiments, one or more different threads or instances of domain models component(s) 1056 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of domain models component(s) 1056. For example, trigger initiation and/or implementation of one or more different threads or instances of domain models component(s) 1056 may be triggered when domain model information is required, including during input elicitation, input interpretation, task and domain identification, natural language processing, service orchestration, and/or formatting output for users.


In at least one embodiment, a given instance of domain models component(s) 1056 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. For example, data from domain model component(s) 1056 may be associated with other model modeling components including vocabulary 1058, language pattern recognizers 1060, dialog flow models 1087, task flow models 1086, service capability models 1088, domain entity databases 1072, and the like. For example, businesses in domain entity databases 1072 that are classified as restaurants might be known by type identifiers which are maintained in the dining out domain model components.


Domain Models Component(s) Example:


Referring now to FIG. 27, there is shown a set of screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by domain models component(s) 1056 according to one embodiment.


In at least one embodiment, domain models component(s) 1056 are the unifying data representation that enables the presentation of information shown in screens 103A and 103B about a restaurant, which combines data from several distinct data sources and services and which includes, for example: name, address, business categories, phone number, identifier for saving to long term personal memory, identifier for sharing over email, reviews from multiple sources, map coordinates, personal notes, and the like.


Language Interpreter Component(s) 1070


In at least one embodiment, language interpreter component(s) 1070 of assistant 1002 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Analyze user input and identify a set of parse results.
      • User input can include any information from the user and his/her device context that can contribute to understanding the user's intent, which can include, for example one or more of the following (or combinations thereof): sequences of words, the identity of gestures or GUI elements involved in eliciting the input, current context of the dialog, current device application and its current data objects, and/or any other personal dynamic data obtained about the user such as location, time, and the like. For example, in one embodiment, user input is in the form of the uniform annotated input format 2690 resulting from active input elicitation 1094.
      • Parse results are associations of data in the user input with concepts, relationships, properties, instances, and/or other nodes and/or data structures in models, databases, and/or other representations of user intent and/context. Parse result associations can be complex mappings from sets and sequences of words, signals, and other elements of user input to one or more associated concepts, relations, properties, instances, other nodes, and/or data structures described herein.
    • Analyze user input and identify a set of syntactic parse results, which are parse results that associate data in the user input with structures that represent syntactic parts of speech, clauses and phrases including multiword names, sentence structure, and/or other grammatical graph structures. Syntactic parse results are described in element 212 of natural language processing procedure described in connection with FIG. 28.
    • Analyze user input and identify a set of semantic parse results, which are parse results that associate data in the user input with structures that represent concepts, relationships, properties, entities, quantities, propositions, and/or other representations of meaning and user intent. In one embodiment, these representations of meaning and intent are represented by sets of and/or elements of and/or instances of models or databases and/or nodes in ontologies, as described in element 220 of natural language processing procedure described in connection with FIG. 28.
    • Disambiguate among alternative syntactic or semantic parse results as described in element 230 of natural language processing procedure described in connection with FIG. 28.
    • Determine whether a partially typed input is syntactically and/or semantically meaningful in an autocomplete procedure such as one described in connection with FIG. 11.
    • Help generate suggested completions 114 in an autocomplete procedure such as one described in connection with FIG. 11.
    • Determine whether interpretations of spoken input are syntactically and/or semantically meaningful in a speech input procedure such as one described in connection with FIG. 22.


According to specific embodiments, multiple instances or threads of language interpreter component(s) 1070 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


According to different embodiments, one or more different threads or instances of language interpreter component(s) 1070 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of language interpreter component(s) 1070. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of language interpreter component(s) 1070 may include, but are not limited to, one or more of the following (or combinations thereof):

    • while eliciting input, including but not limited to
      • Suggesting possible completions of typed input 114 (FIG. 11);
      • Ranking interpretations of speech 126 (FIG. 22);
      • When offering ambiguities as suggested responses in dialog 152 (FIG. 24);
    • when the result of eliciting input is available, including when input is elicited by any mode of active multimodal input elicitation 100.


In at least one embodiment, a given instance of language interpreter component(s) 1070 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of such database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by the Language Interpreter component(s) may include, but are not limited to, one or more of the following (or combinations thereof):

    • Domain models 1056;
    • Vocabulary 1058;
    • Domain entity databases 1072;
    • Short term personal memory 1052;
    • Long term personal memory 1054;
    • Task flow models 1086;
    • Dialog flow models 1087;
    • Service capability models 1088.


Referring now also to FIG. 29, there is shown a screen shot illustrating natural language processing according to one embodiment. The user has entered (via voice or text) language input 2902 consisting of the phrase “who is playing this weekend at the fillmore”. This phrase is echoed back to the user on screen 2901. Language interpreter component(s) 1070 component process input 2902 and generates a parse result. The parse result associates that input with a request to show the local events that are scheduled for any of the upcoming weekend days at any event venue whose name matches “fillmore”. A paraphrase of the parse results is shown as 2903 on screen 2901.


Referring now also to FIG. 28, there is shown a flow diagram depicting an example of a method for natural language processing according to one embodiment.


The method begins 200. Language input 202 is received, such as the string “who is playing this weekend at the fillmore” in the example of FIG. 29. In one embodiment, the input is augmented by current context information, such as the current user location and local time. In word/phrase matching 210, language interpreter component(s) 1070 find associations between user input and concepts. In this example, associations are found between the string “playing” and the concept of listings at event venues; the string “this weekend” (along with the current local time of the user) and an instantiation of an approximate time period that represents the upcoming weekend; and the string “fillmore” with the name of a venue. Word/phrase matching 210 may use data from, for example, language pattern recognizers 1060, vocabulary database 1058, active ontology 1050, short term personal memory 1052, and long term personal memory 1054.


Language interpreter component(s) 1070 generate candidate syntactic parses 212 which include the chosen parse result but may also include other parse results. For example, other parse results may include those wherein “playing” is associated with other domains such as games or with a category of event such as sporting events.


Short- and/or long-term memory 1052, 1054 can also be used by language interpreter component(s) 1070 in generating candidate syntactic parses 212. Thus, input that was provided previously in the same session, and/or known information about the user, can be used, to improve performance, reduce ambiguity, and reinforce the conversational nature of the interaction. Data from active ontology 1050, domain models 1056, and task flow models 1086 can also be used, to implement evidential reasoning in determining valid candidate syntactic parses 212.


In semantic matching 220, language interpreter component(s) 1070 consider combinations of possible parse results according to how well they fit semantic models such as domain models and databases. In this case, the parse includes the associations (1) “playing” (a word in the user input) as “Local Event At Venue” (part of a domain model 1056 represented by a cluster of nodes in active ontology 1050) and (2) “fillmore” (another word in the input) as a match to an entity name in a domain entity database 1072 for Local Event Venues, which is represented by a domain model element and active ontology node (Venue Name).


Semantic matching 220 may use data from, for example, active ontology 1050, short term personal memory 1052, and long term personal memory 1054. For example, semantic matching 220 may use data from previous references to venues or local events in the dialog (from short term personal memory 1052) or personal favorite venues (from long term personal memory 1054).


A set of candidate, or potential, semantic parse results is generated 222.


In disambiguation step 230, language interpreter component(s) 1070 weigh the evidential strength of candidate semantic parse results 222. In this example, the combination of the parse of “playing” as “Local Event At Venue” and the match of “fillmore” as a Venue Name is a stronger match to a domain model than alternative combinations where, for instance, “playing” is associated with a domain model for sports but there is no association in the sports domain for “fillmore”.


Disambiguation 230 may use data from, for example, the structure of active ontology 1050. In at least one embodiment, the connections between nodes in an active ontology provide evidential support for disambiguating among candidate semantic parse results 222. For example, in one embodiment, if three active ontology nodes are semantically matched and are all connected in active ontology 1050, this indicates higher evidential strength of the semantic parse than if these matching nodes were not connected or connected by longer paths of connections in active ontology 1050. For example, in one embodiment of semantic matching 220, the parse that matches both Local Event At Venue and Venue Name is given increased evidential support because the combined representations of these aspects of the user intent are connected by links and/or relations in active ontology 1050: in this instance, the Local Event node is connected to the Venue node which is connected to the Venue Name node which is connected to the entity name in the database of venue names.


In at least one embodiment, the connections between nodes in an active ontology that provide evidential support for disambiguating among candidate semantic parse results 222 are directed arcs, forming an inference lattice, in which matching nodes provide evidence for nodes to which they are connected by directed arcs.


In 232, language interpreter component(s) 1070 sort and select 232 the top semantic parses as the representation of user intent 290.


Domain Entity Database(s) 1072


In at least one embodiment, domain entity database(s) 1072 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Store data about domain entities. Domain entities are things in the world or computing environment that may be modeled in domain models. Examples may include, but are not limited to, one or more of the following (or combinations thereof):
      • Businesses of any kind;
      • Movies, videos, songs and/or other musical products, and/or any other named entertainment products;
      • Products of any kind;
      • Events;
      • Calendar entries;
      • Cities, states, countries, neighborhoods, and/or other geographic, geopolitical, and/or geospatial points or regions;
      • Named places such as landmarks, airports, and the like;
    • Provide database services on these databases, including but not limited to simple and complex queries, transactions, triggered events, and the like.


According to specific embodiments, multiple instances or threads of domain entity database(s) 1072 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of domain entity database(s) 1072 may be performed, implemented and/or initiated by database software and/or hardware residing on client(s) 1304 and/or on server(s) 1340.


One example of a domain entity database 1072 that can be used in connection with the present invention according to one embodiment is a database of one or more businesses storing, for example, their names and locations. The database might be used, for example, to look up words contained in an input request for matching businesses and/or to look up the location of a business whose name is known. One skilled in the art will recognize that many other arrangements and implementations are possible.


Vocabulary Component(s) 1058


In at least one embodiment, vocabulary component(s) 1058 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Provide databases associating words and strings with concepts, properties, relations, or instances of domain models or task models;
    • Vocabulary from vocabulary components may be used by automated assistant 1002 for several processes, including for example: eliciting input, interpreting natural language, and generating output.


According to specific embodiments, multiple instances or threads of vocabulary component(s) 1058 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of vocabulary component(s) 1058 may be implemented as data structures that associate strings with the names of concepts, relations, properties, and instances. These data structures may be stored in memory, files, or databases. Access to vocabulary component(s) 1058 may be implemented through direct APIs, network APIs, and/or database query interfaces. Creation and maintenance of vocabulary component(s) 1058 may be achieved via direct editing of files, database transactions, or through the use of domain model editing tools. Vocabulary component(s) 1058 may be implemented as part of or in association with active ontologies 1050. One skilled in the art will recognize that many other arrangements and implementations are possible.


According to different embodiments, one or more different threads or instances of vocabulary component(s) 1058 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of vocabulary component(s) 1058. In one embodiment, vocabulary component(s) 1058 are accessed whenever vocabulary information is required, including, for example, during input elicitation, input interpretation, and formatting output for users. One skilled in the art will recognize that other conditions or events may trigger initiation and/or implementation of one or more different threads or instances of vocabulary component(s) 1058.


In at least one embodiment, a given instance of vocabulary component(s) 1058 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. In one embodiment, vocabulary component(s) 1058 may access data from external databases, for instance, from a data warehouse or dictionary.


Language Pattern Recognizer Component(s) 1060


In at least one embodiment, language pattern recognizer component(s) 1060 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, looking for patterns in language or speech input that indicate grammatical, idiomatic, and/or other composites of input tokens. These patterns correspond to, for example, one or more of the following (or combinations thereof): words, names, phrases, data, parameters, commands, and/or signals of speech acts.


According to specific embodiments, multiple instances or threads of pattern recognizer component(s) 1060 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of language pattern recognizer component(s) 1060 may be performed, implemented and/or initiated by one or more files, databases, and/or programs containing expressions in a pattern matching language. In at least one embodiment, language pattern recognizer component(s) 1060 are represented declaratively, rather than as program code; this enables them to be created and maintained by editors and other tools other than programming tools. Examples of declarative representations may include, but are not limited to, one or more of the following (or combinations thereof): regular expressions, pattern matching rules, natural language grammars, parsers based on state machines and/or other parsing models.


One skilled in the art will recognize that other types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof) can be used for implementing language pattern recognizer component(s) 1060.


According to different embodiments, one or more different threads or instances of language pattern recognizer component(s) 1060 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of language pattern recognizer component(s) 1060. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of language pattern recognizer component(s) 1060 may include, but are not limited to, one or more of the following (or combinations thereof):

    • during active elicitation of input, in which the structure of the language pattern recognizers may constrain and guide the input from the user;
    • during natural language processing, in which the language pattern recognizers help interpret input as language;
    • during the identification of tasks and dialogs, in which the language pattern recognizers may help identify tasks, dialogs, and/or steps therein.


In at least one embodiment, a given instance of language pattern recognizer component(s) 1060 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by language pattern recognizer component(s) 1060 may include, but are not limited to, data from any of the models various models and data sources that may be part of embodiments of assistant 1002, which may include, but are not limited to, one or more of the following (or combinations thereof):

    • Domain models 1056;
    • Vocabulary 1058;
    • Domain entity databases 1072;
    • Short term personal memory 1052;
    • Long term personal memory 1054;
    • Task flow models 1086;
    • Dialog flow models 1087;
    • Service capability models 1088.


In one embodiment, access of data from other parts of embodiments of assistant 1002 may be coordinated by active ontologies 1050.


Referring again to FIG. 14, there is shown an example of some of the various types of functions, operations, actions, and/or other features which may be provided by language pattern recognizer component(s) 1060. FIG. 14 illustrates language patterns that language pattern recognizer component(s) 1060 may recognize. For example, the idiom “what is happening” (in a city) may be associated with the task of event planning and the domain of local events.


Dialog Flow Processor Component(s) 1080


In at least one embodiment, dialog flow processor component(s) 1080 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Given a representation of the user intent 290 from language interpretation 200, identify the task a user wants performed and/or a problem the user wants solved. For example, a task might be to find a restaurant.
    • For a given problem or task, given a representation of user intent 290, identify parameters to the task or problem. For example, the user might be looking for a recommended restaurant that serves Italian food near the user's home. The constraints that a restaurant be recommended, serving Italian food, and near home are parameters to the task of finding a restaurant.
    • Given the task interpretation and current dialog with the user, such as that which may be represented in personal short term personal memory 1052, select an appropriate dialog flow model and determine a step in the flow model corresponding to the current state.


According to specific embodiments, multiple instances or threads of dialog flow processor component(s) 1080 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


In at least one embodiment, a given instance of dialog flow processor component(s) 1080 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by dialog flow processor component(s) 1080 may include, but are not limited to, one or more of the following (or combinations thereof):

    • task flow models 1086;
    • domain models 1056;
    • dialog flow models 1087.


Referring now to FIGS. 30 and 31, there are shown screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by dialog flow processor component(s) according to one embodiment.


As shown in screen 3001, user requests a dinner reservation by providing speech or text input 3002 “book me a table for dinner”. Assistant 1002 generates a prompt 3003 asking the user to specify time and party size.


Once these parameters have been provided, screen 3101 is shown. Assistant 1002 outputs a dialog box 3102 indicating that results are being presented, and a prompt 3103 asking the user to click a time. Listings 3104 are also displayed.


In one embodiment, such a dialog is implemented as follows. Dialog flow processor component(s) 1080 are given a representation of user intent from language interpreter component 1070 and determine that the appropriate response is to ask the user for information required to perform the next step in a task flow. In this case, the domain is restaurants, the task is getting a reservation, and the dialog step is to ask the user for information required to accomplish the next step in the task flow. This dialog step is exemplified by prompt 3003 of screen 3001.


Referring now also to FIG. 32, there is shown a flow diagram depicting a method of operation for dialog flow processor component(s) 1080 according to one embodiment. The flow diagram of FIG. 32 is described in connection with the example shown in FIGS. 30 and 31.


The method begins 300. Representation of user intent 290 is received. As described in connection with FIG. 28, in one embodiment, representation of user intent 290 is a set of semantic parses. For the example shown in FIGS. 30 and 31, the domain is restaurants, the verb is “book” associated with restaurant reservations, and the time parameter is the evening of the current day.


In 310, dialog flow processor component(s) 1080 determine whether this interpretation of user intent is supported strongly enough to proceed, and/or if it is better supported than alternative ambiguous parses. In the current example, the interpretation is strongly supported, with no competing ambiguous parses. If, on the other hand, there are competing ambiguities or sufficient uncertainty, then step 322 is performed, to set the dialog flow step so that the execution phase causes the dialog to output a prompt for more information from the user.


In 312, the dialog flow processor component(s) 1080 determine the preferred interpretation of the semantic parse with other information to determine the task to perform and its parameters. Information may be obtained, for example, from domain models 1056, task flow models 1086, and/or dialog flow models 1087, or any combination thereof. In the current example, the task is identified as getting a reservation, which involves both finding a place that is reservable and available, and effecting a transaction to reserve a table. Task parameters are the time constraint along with others that are inferred in step 312.


In 320, the task flow model is consulted to determine an appropriate next step. Information may be obtained, for example, from domain models 1056, task flow models 1086, and/or dialog flow models 1087, or any combination thereof. In the example, it is determined that in this task flow the next step is to elicit missing parameters to an availability search for restaurants, resulting in prompt 3003 illustrated in FIG. 30, requesting party size and time for a reservation.


As described above, FIG. 31 depicts screen 3101 is shown including dialog element 3102 that is presented after the user answers the request for the party size and reservation time. In one embodiment, screen 3101 is presented as the result of another iteration through an automated call and response procedure, as described in connection with FIG. 33, which leads to another call to the dialog and flow procedure depicted in FIG. 32. In this instantiation of the dialog and flow procedure, after receiving the user preferences, dialog flow processor component(s) 1080 determines a different task flow step in step 320 to do an availability search. When request 390 is constructed, it includes the task parameters sufficient for dialog flow processor component(s) 1080 and services orchestration component(s) 1082 to dispatch to a restaurant booking service.


Dialog Flow Models Component(s) 1087


In at least one embodiment, dialog flow models component(s) 1087 may be operable to provide dialog flow models, which represent the steps one takes in a particular kind of conversation between a user and intelligent automated assistant 1002. For example, the dialog flow for the generic task of performing a transaction includes steps for getting the necessary data for the transaction and confirming the transaction parameters before committing it.


Task Flow Models Component(s) 1086


In at least one embodiment, task flow models component(s) 1086 may be operable to provide task flow models, which represent the steps one takes to solve a problem or address a need. For example, the task flow for getting a dinner reservation involves finding a desirable restaurant, checking availability, and doing a transaction to get a reservation for a specific time with the restaurant.


According to specific embodiments, multiple instances or threads of task flow models component(s) 1086 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of task flow models component(s) 1086 may be may be implemented as programs, state machines, or other ways of identifying an appropriate step in a flow graph.


In at least one embodiment, task flow models component(s) 1086 may use a task modeling framework called generic tasks. Generic tasks are abstractions that model the steps in a task and their required inputs and generated outputs, without being specific to domains. For example, a generic task for transactions might include steps for gathering data required for the transaction, executing the transaction, and outputting results of the transaction—all without reference to any particular transaction domain or service for implementing it. It might be instantiated for a domain such as shopping, but it is independent of the shopping domain and might equally well apply to domains of reserving, scheduling, and the like.


At least a portion of the functions, operations, actions, and/or other features associated with task flow models component(s) 1086 and/or procedure(s) described herein may be implemented, at least in part, using concepts, features, components, processes, and/or other aspects disclosed herein in connection with generic task modeling framework.


Additionally, at least a portion of the functions, operations, actions, and/or other features associated with task flow models component(s) 1086 and/or procedure(s) described herein may be implemented, at least in part, using concepts, features, components, processes, and/or other aspects relating to constrained selection tasks, as described herein. For example, one embodiment of generic tasks may be implemented using a constrained selection task model.


In at least one embodiment, a given instance of task flow models component(s) 1086 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by task flow models component(s) 1086 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Domain models 1056;
    • Vocabulary 1058;
    • Domain entity databases 1072;
    • Short term personal memory 1052;
    • Long term personal memory 1054;
    • Dialog flow models 1087;
    • Service capability models 1088.


Referring now to FIG. 34, there is shown a flow diagram depicting an example of task flow for a constrained selection task 351 according to one embodiment.


Constrained selection is a kind of generic task in which the goal is to select some item from a set of items in the world based on a set of constraints. For example, a constrained selection task 351 may be instantiated for the domain of restaurants. Constrained selection task 351 starts by soliciting criteria and constraints from the user 352. For example, the user might be interested in Asian food and may want a place to eat near his or her office.


In step 353, assistant 1002 presents items that meet the stated criteria and constraints for the user to browse. In this example, it may be a list of restaurants and their properties which may be used to select among them.


In step 354, the user is given an opportunity to refine criteria and constraints. For example, the user might refine the request by saying “near my office”. The system would then present a new set of results in step 353.


Referring now also to FIG. 35, there is shown an example of screen 3501 including list 3502 of items presented by constrained selection task 351 according to one embodiment.


In step 355, the user can select among the matching items. Any of a number of follow-on tasks 359 may then be made available, such as for example book 356, remember 357, or share 358. In various embodiments, follow-on tasks 359 can involve interaction with web-enabled services, and/or with functionality local to the device (such as setting a calendar appointment, making a telephone call, sending an email or text message, setting an alarm, and the like).


In the example of FIG. 35, the user can select an item within list 3502 to see more details and to perform additional actions. Referring now also to FIG. 36, there is shown an example of screen 3601 after the user has selected an item from list 3502. Additional information and options corresponding to follow-on tasks 359 concerning the selected item are displayed.


In various embodiments, the flow steps may be offered to the user in any of several input modalities, including but not limited to any combination of explicit dialog prompts and GUI links.


Services Component(s) 1084


Services component(s) 1084 represent the set of services that intelligent automated assistant 1002 might call on behalf of the user. Any service that can be called may be offered in a services component 1084.


In at least one embodiment, services component(s) 1084 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Provide the functions over an API that would normally be provided by a web-based user interface to a service. For example, a review website might provide a service API that would return reviews of a given entity automatically when called by a program. The API offers to intelligent automated assistant 1002 the services that a human would otherwise obtain by operating the user interface of the website.
    • Provide the functions over an API that would normally be provided by a user interface to an application. For example, a calendar application might provide a service API that would return calendar entries automatically when called by a program. The API offers to intelligent automated assistant 1002 the services that a human would otherwise obtain by operating the user interface of the application. In one embodiment, assistant 1002 is able to initiate and control any of a number of different functions available on the device. For example, if assistant 1002 is installed on a smartphone, personal digital assistant, tablet computer, or other device, assistant 1002 can perform functions such as: initiate applications, make calls, send emails and/or text messages, add calendar events, set alarms, and the like. In one embodiment, such functions are activated using services component(s) 1084.
    • Provide services that are not currently implemented in a user interface, but that are available through an API to assistant in larger tasks. For example, in one embodiment, an API to take a street address and return machine-readable geo-coordinates might be used by assistant 1002 as a service component 1084 even if it has no direct user interface on the web or a device.


According to specific embodiments, multiple instances or threads of services component(s) 1084 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of services component(s) 1084 may be performed, implemented and/or initiated by one or more of the following types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof):

    • implementation of an API exposed by a service, locally or remotely or any combination;
    • inclusion of a database within automated assistant 1002 or a database service available to assistant 1002.


For example, a website that offers users an interface for browsing movies might be used by an embodiment of intelligent automated assistant 1002 as a copy of the database used by the website. Services component(s) 1084 would then offer an internal API to the data, as if it were provided over a network API, even though the data is kept locally.


As another example, services component(s) 1084 for an intelligent automated assistant 1002 that helps with restaurant selection and meal planning might include any or all of the following set of services which are available from third parties over the network:

    • a set of restaurant listing services which lists restaurants matching name, location, or other constraints;
    • a set of restaurant rating services which return rankings for named restaurants;
    • a set of restaurant reviews services which returns written reviews for named restaurants;
    • a geocoding service to locate restaurants on a map;
    • a reservation service that enables programmatic reservation of tables at restaurants.


      Services Orchestration Component(s) 1082


Services orchestration component(s) 1082 of intelligent automated assistant 1002 executes a service orchestration procedure.


In at least one embodiment, services orchestration component(s) 1082 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Dynamically and automatically determine which services may meet the user's request and/or specified domain(s) and task(s);
    • Dynamically and automatically call multiple services, in any combination of concurrent and sequential ordering;
    • Dynamically and automatically transform task parameters and constraints to meet input requirements of service APIs;
    • Dynamically and automatically monitor for and gather results from multiple services;
    • Dynamically and automatically merge service results data from various services into to a unified result model;
    • Orchestrate a plurality of services to meet the constraints of a request;
    • Orchestrate a plurality of services to annotate an existing result set with auxiliary information;
    • Output the result of calling a plurality of services in a uniform, service independent representation that unifies the results from the various services (for example, as a result of calling several restaurant services that return lists of restaurants, merge the data on at least one restaurant from the several services, removing redundancy).


For example, in some situations, there may be several ways to accomplish a particular task. For example, user input such as “remind me to leave for my meeting across town at 2 pm” specifies an action that can be accomplished in at least three ways: set alarm clock; create a calendar event; or call a to-do manager. In one embodiment, services orchestration component(s) 1082 makes the determination as to which way to best satisfy the request.


Services orchestration component(s) 1082 can also make determinations as to which combination of several services would be best to invoke in order to perform a given overall task. For example, to find and reserve a table for dinner, services orchestration component(s) 1082 would make determinations as to which services to call in order to perform such functions as looking up reviews, getting availability, and making a reservation. Determination of which services to use may depend on any of a number of different factors. For example, in at least one embodiment, information about reliability, ability of service to handle certain types of requests, user feedback, and the like, can be used as factors in determining which service(s) is/are appropriate to invoke.


According to specific embodiments, multiple instances or threads of services orchestration component(s) 1082 may be concurrently implemented and/or initiated via the use of one or more processors and/or other combinations of hardware and/or hardware and software.


In at least one embodiment, a given instance of services orchestration component(s) 1082 may use explicit service capability models 1088 to represent the capabilities and other properties of external services, and reason about these capabilities and properties while achieving the features of services orchestration component(s) 1082. This affords advantages over manually programming a set of services that may include, for example, one or more of the following (or combinations thereof):

    • Ease of development;
    • Robustness and reliability in execution;
    • The ability to dynamically add and remove services without disrupting code;
    • The ability to implement general distributed query optimization algorithms that are driven by the properties and capabilities rather than hard coded to specific services or APIs.


In at least one embodiment, a given instance of services orchestration component(s) 1082 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by services orchestration component(s) 1082 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Instantiations of domain models;
    • Syntactic and semantic parses of natural language input;
    • Instantiations of task models (with values for parameters);
    • Dialog and task flow models and/or selected steps within them;
    • Service capability models 1088;
    • Any other information available in an active ontology 1050.


Referring now to FIG. 37, there is shown an example of a procedure for executing a service orchestration procedure according to one embodiment.


In this particular example, it is assumed a single user is interesting in finding a good place for dinner at a restaurant, and is engaging intelligent automated assistant 1002 in a conversation to help provide this service.


Consider the task of finding restaurants that are of high quality, are well reviewed, near a particular location, available for reservation at a particular time, and serve a particular kind of food. These domain and task parameters are given as input 390.


The method begins 400. At 402, it is determined whether the given request may require any services. In some situations, services delegation may not be required, for example if assistant 1002 is able to perform the desired task itself. For example, in one embodiment, assistant 1002 may be able to answer a factual question without invoking services delegation. Accordingly, if the request does not require services, then standalone flow step is executed in 403 and its result 490 is returned. For example, if the task request was to ask for information about automated assistant 1002 itself, then the dialog response may be handled without invoking any external services.


If, in step 402, it is determined that services delegation is required, services orchestration component(s) 1082 proceed to step 404. In 404, services orchestration component(s) 1082 may match up the task requirements with declarative descriptions of the capabilities and properties of services in service capability models 1088. At least one service provider that might support the instantiated operation provides declarative, qualitative metadata detailing, for example, one or more of the following (or combinations thereof):

    • the data fields that are returned with results;
    • which classes of parameters the service provider is statically known to support;
    • policy functions for parameters the service provider might be able to support after dynamic inspection of the parameter values;
    • a performance rating defining how the service performs (e.g. relational DB, web service, triple store, full-text index, or some combination thereof);
    • property quality ratings statically defining the expected quality of property values returned with the result object;
    • an overall quality rating of the results the service may expect to return.


For example, reasoning about the classes of parameters that service may support, a service model may state that services 1, 2, 3, and 4 may provide restaurants that are near a particular location (a parameter), services 2 and 3 may filter or rank restaurants by quality (another parameter), services 3, 4, and 5 may return reviews for restaurants (a data field returned), service 6 may list the food types served by restaurants (a data field returned), and service 7 may check availability of restaurants for particular time ranges (a parameter). Services 8 through 99 offer capabilities that are not required for this particular domain and task.


Using this declarative, qualitative metadata, the task, the task parameters, and other information available from the runtime environment of the assistant, services orchestration component(s) 1082 determines 404 an optimal set of service providers to invoke. The optimal set of service providers may support one or more task parameters (returning results that satisfy one or more parameters) and also considers the performance rating of at least one service provider and the overall quality rating of at least one service provider.


The result of step 404 is a dynamically generated list of services to call for this particular user and request.


In at least one embodiment, services orchestration component(s) 1082 considers the reliability of services as well as their ability to answer specific information requests.


In at least one embodiment, services orchestration component(s) 1082 hedges against unreliability by calling overlapping or redundant services.


In at least one embodiment, services orchestration component(s) 1082 considers personal information about the user (from the short term personal memory component) to select services. For example, the user may prefer some rating services over others.


In step 450, services orchestration component(s) 1082 dynamically and automatically invokes multiple services on behalf of a user. In at least one embodiment, these are called dynamically while responding to a user's request. According to specific embodiments, multiple instances or threads of the services may be concurrently called. In at least one embodiment, these are called over a network using APIs, or over a network using web service APIs, or over the Internet using web service APIs, or any combination thereof.


In at least one embodiment, the rate at which services are called is programmatically limited and/or managed.


Referring now also to FIG. 38, there is shown an example of a service invocation procedure 450 according to one embodiment. Service invocation is used, for example, to obtain additional information or to perform tasks by the use of external services. In one embodiment, request parameters are transformed as appropriate for the service's API. Once results are received from the service, the results are transformed to a results representation for presentation to the user within assistant 1002.


In at least one embodiment, services invoked by service invocation procedure 450 can be a web service, application running on the device, operating system function, or the like.


Representation of request 390 is provided, including for example task parameters and the like. For at least one service available from service capability models 1088, service invocation procedure 450 performs transformation 452, calling 454, and output-mapping 456 steps.


In transformation step 452, the current task parameters from request representation 390 are transformed into a form that may be used by at least one service. Parameters to services, which may be offered as APIs or databases, may differ from the data representation used in task requests, and also from at least one other. Accordingly, the objective of step 452 is to map at least one task parameter in the one or more corresponding formats and values in at least one service being called.


For example, the names of businesses such as restaurants may vary across services that deal with such businesses. Accordingly, step 452 would involve transforming any names into forms that are best suited for at least one service.


As another example, locations are known at various levels of precision and using various units and conventions across services. Service 1 might may require ZIP codes, service 2 GPS coordinates, and service 3 postal street addresses.


The service is called 454 over an API and its data gathered. In at least one embodiment, the results are cached. In at least one embodiment, the services that do not return within a specified level performance (e.g., as specified in Service Level Agreement or SLA) are dropped.


In output mapping step 456, the data returned by a service is mapped back onto unified result representation 490. This step may include dealing with different formats, units, and so forth.


In step 410, results from multiple services are obtained. In step 412, results from multiple services are validated and merged. In one embodiment, if validated results are collected, an equality policy function—defined on a per-domain basis—is then called pair-wise across one or more results to determine which results represent identical concepts in the real world. When a pair of equal results is discovered, a set of property policy functions—also defined on a per-domain basis—are used to merge property values into a merged result. The property policy function may use the property quality ratings from the service capability models, the task parameters, the domain context, and/or the long-term personal memory 1054 to decide the optimal merging strategy.


For example, lists of restaurants from different providers of restaurants might be merged and duplicates removed. In at least one embodiment, the criteria for identifying duplicates may include fuzzy name matching, fuzzy location matching, fuzzy matching against multiple properties of domain entities, such as name, location, phone number, and/or website address, and/or any combination thereof.


In step 414, the results are sorted and trimmed to return a result list of the desired length.


In at least one embodiment, a request relaxation loop is also applied. If, in step 416, services orchestration component(s) 1082 determines that the current result list is not sufficient (e.g., it has fewer than the desired number of matching items), then task parameters may be relaxed 420 to allow for more results. For example, if the number of restaurants of the desired sort found within N miles of the target location is too small, then relaxation would run the request again, looking in an area larger than N miles away, and/or relaxing some other parameter of the search.


In at least one embodiment, the service orchestration method is applied in a second pass to “annotate” results with auxiliary data that is useful to the task.


In step 418, services orchestration component(s) 1082 determines whether annotation is required. It may be required if, for example, if the task may require a plot of the results on a map, but the primary services did not return geo-coordinates required for mapping.


In 422, service capability models 1088 are consulted again to find services that may return the desired extra information. In one embodiment, the annotation process determines if additional or better data may be annotated to a merged result. It does this by delegating to a property policy function—defined on a per-domain basis—for at least one property of at least one merged result. The property policy function may use the merged property value and property quality rating, the property quality ratings of one or more other service providers, the domain context, and/or the user profile to decide if better data may be obtained. If it is determined that one or more service providers may annotate one or more properties for a merged result, a cost function is invoked to determine the optimal set of service providers to annotate.


At least one service provider in the optimal set of annotation service providers is then invoked 450 with the list of merged results, to obtain results 424. The changes made to at least one merged result by at least one service provider are tracked during this process, and the changes are then merged using the same property policy function process as was used in step 412. Their results are merged 426 into the existing result set.


The resulting data is sorted 428 and unified into a uniform representation 490.


It may be appreciated that one advantage of the methods and systems described above with respect to services orchestration component(s) 1082 is that they may be advantageously applied and/or utilized in various fields of technology other than those specifically relating to intelligent automated assistants. Examples of such other areas of technologies where aspects and/or features of service orchestration procedures include, for example, one or more of the following:

    • Dynamic “mash ups” on websites and web-based applications and services;
    • Distributed database query optimization;
    • Dynamic service oriented architecture configuration.


      Service Capability Models Component(s) 1088


In at least one embodiment, service capability models component(s) 1088 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Provide machine readable information about the capabilities of services to perform certain classes of computation;
    • Provide machine readable information about the capabilities of services to answer certain classes of queries;
    • Provide machine readable information about which classes of transactions are provided by various services;
    • Provide machine readable information about the parameters to APIs exposed by various services;
    • Provide machine readable information about the parameters that may be used in database queries on databases provided by various services.


      Output Processor Component(s) 1090


In at least one embodiment, output processor component(s) 1090 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Format output data that is represented in a uniform internal data structure into forms and layouts that render it appropriately on different modalities. Output data may include, for example, communication in natural language between the intelligent automated assistant and the user; data about domain entities, such as properties of restaurants, movies, products, and the like; domain specific data results from information services, such as weather reports, flight status checks, prices, and the like; and/or interactive links and buttons that enable the user to respond by directly interacting with the output presentation.
    • Render output data for modalities that may include, for example, any combination of: graphical user interfaces; text messages; email messages; sounds; animations; and/or speech output.
    • Dynamically render data for different graphical user interface display engines based on the request. For example, use different output processing layouts and formats depending on which web browser and/or device is being used.
    • Render output data in different speech voices dynamically.
    • Dynamically render to specified modalities based on user preferences.
    • Dynamically render output using user-specific “skins” that customize the look and feel.
    • Send a stream of output packages to a modality, showing intermediate status, feedback, or results throughout phases of interaction with assistant 1002.


According to specific embodiments, multiple instances or threads of output processor component(s) 1090 may be concurrently implemented and/or initiated via the use of one or more processor(s) 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of output processor component(s) 1090 may be performed, implemented and/or initiated by one or more of the following types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof):

    • software modules within the client or server of an embodiment of an intelligent automated assistant;
    • remotely callable services;
    • using a mix of templates and procedural code.


Referring now to FIG. 39, there is shown a flow diagram depicting an example of a multiphase output procedure according to one embodiment.


The method begins 700. The multiphase output procedure includes automated assistant 1002 processing steps 702 and multiphase output steps 704


In step 710, a speech input utterance is obtained and a speech-to-text component (such as component described in connection with FIG. 22) interprets the speech to produce a set of candidate speech interpretations 712. In one embodiment, speech-to-text component is implemented using, for example, Nuance Recognizer, available from Nuance Communications, Inc. of Burlington, Mass. Candidate speech interpretations 712 may be shown to the user in 730, for example in paraphrased form. For example, the interface might show “did you say?” alternatives listing a few possible alternative textual interpretations of the same speech sound sample.


In at least one embodiment, a user interface is provided to enable the user to interrupt and choose among the candidate speech interpretations.


In step 714, the candidate speech interpretations 712 are sent to a language interpreter 1070, which may produce representations of user intent 716 for at least one candidate speech interpretation 712. In step 732, paraphrases of these representations of user intent 716 are generated and presented to the user. (See related step 132 of procedure 221 in FIG. 22).


In at least one embodiment, the user interface enables the user to interrupt and choose among the paraphrases of natural language interpretations 732.


In step 718, task and dialog analysis is performed. In step 734, task and domain interpretations are presented to the user using an intent paraphrasing algorithm.


Referring now also to FIG. 40, there is shown a screen shot depicting an example of output processing according to one embodiment. Screen 4001 includes echo 4002 of the user's speech input, generated by step 730. Screen 4001 further includes paraphrase 4003 of the user's intent, generated by step 734. In one embodiment, as depicted in the example of FIG. 40, special formatting/highlighting is used for key words such as “events”, which may be used to facilitate training of the user for interaction with intelligent automated assistant 1002. For example, by visually observing the formatting of the displayed text, the user may readily identify and interpret back the intelligent automated assistant recognizes keywords such as “events”, “next Wednesday”, “San Francisco”, and the like.


Returning to FIG. 39, as requests are dispatched 720 to services and results are dynamically gathered, intermediate results may be displayed in the form of real-time progress 736. For example, a list of restaurants may be returned and then their reviews may be populated dynamically as the results from the reviews services arrive. Services can include web-enabled services and/or services that access information stored locally on the device and/or from any other source.


A uniform representation of response 722 is generated and formatted 724 for the appropriate output modality. After the final output format is completed, a different kind of paraphrase may be offered in 738. In this phase, the entire result set may be analyzed and compared against the initial request. A summary of results or answer to a question may then be offered.


Referring also to FIG. 41, there is shown another example of output processing according to one embodiment. Screen 4101 depicts paraphrase 4102 of the text interpretation, generated by step 732, real-time progress 4103 generated by step 736, and paraphrased summary 4104 generated by step 738. Also included are detailed results 4105.


In one embodiment, assistant 1002 is capable of generating output in multiple modes. Referring now to FIG. 42, there is shown a flow diagram depicting an example of multimodal output processing according to one embodiment.


The method begins 600. Output processor 1090 takes uniform representation of response 490 and formats 612 the response according to the device and modality that is appropriate and applicable. Step 612 may include information from device and modality models 610 and/or domain data models 614.


Once response 490 has been formatted 612, any of a number of different output mechanisms can be used, in any combination. Examples depicted in FIG. 42 include:

    • Generating 620 text message output, which is sent 630 to a text message channel;
    • Generating 622 email output, which is sent 632 as an email message;
    • Generating 624 GUI output, which is sent 634 to a device or web browser for rendering;
    • Generating 626 speech output, which is sent 636 to a speech generation module.


One skilled in the art will recognize that many other output mechanisms can be used.


In one embodiment, the content of output messages generated by multiphase output procedure 700 is tailored to the mode of multimodal output processing 600. For example, if the output modality is speech 626, the language of used to paraphrase user input 730, text interpretations 732, task and domain interpretations 734, progress 736, and/or result summaries 738 may be more or less verbose or use sentences that are easier to comprehend in audible form than in written form. In one embodiment, the language is tailored in the steps of the multiphase output procedure 700; in other embodiments, the multiphase output procedure 700 produces an intermediate result that is further refined into specific language by multimodal output processing 600.


Short Term Personal Memory Component(s) 1052


In at least one embodiment, short term personal memory component(s) 1052 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Keep a history of the recent dialog between the embodiment of the assistant and the user, including the history of user inputs and their interpretations;
    • Keep a history of recent selections by the user in the GUI, such as which items were opened or explored, which phone numbers were called, which items were mapped, which movie trailers where played, and the like;
    • Store the history of the dialog and user interactions in a database on the client, the server in a user-specific session, or in client session state such as web browser cookies or RAM used by the client;
    • Store the list of recent user requests;
    • Store the sequence of results of recent user requests;
    • Store the click-stream history of UI events, including button presses, taps, gestures, voice activated triggers, and/or any other user input.
    • Store device sensor data (such as location, time, positional orientation, motion, light level, sound level, and the like) which might be correlated with interactions with the assistant.


According to specific embodiments, multiple instances or threads of short term personal memory component(s) 1052 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


According to different embodiments, one or more different threads or instances of short term personal memory component(s) 1052 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of short term personal memory component(s) 1052. For example, short term personal memory component(s) 1052 may be invoked when there is a user session with the embodiment of assistant 1002, on at least one input form or action by the user or response by the system.


In at least one embodiment, a given instance of short term personal memory component(s) 1052 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. For example, short term personal memory component(s) 1052 may access data from long-term personal memory components(s) 1054 (for example, to obtain user identity and personal preferences) and/or data from the local device about time and location, which may be included in short term memory entries.


Referring now to FIGS. 43A and 43B, there are shown screen shots depicting an example of the use of short term personal memory component(s) 1052 to maintain dialog context while changing location, according to one embodiment. In this example, the user has asked about the local weather, then just says “in new york”. Screen 4301 shows the initial response, including local weather. When the user says “in new york”, assistant 1002 uses short term personal memory component(s) 1052 to access the dialog context and thereby determine that the current domain is weather forecasts. This enables assistant 1002 to interpret the new utterance “in new york” to mean “what is the weather forecast in New York this coming Tuesday?”. Screen 4302 shows the appropriate response, including weather forecasts for New York.


In the example of FIGS. 43A and 43B, what was stored in short term memory was not only the words of the input “is it going to rain the day after tomorrow?” but the system's semantic interpretation of the input as the weather domain and the time parameter set to the day after tomorrow.


Long-Term Personal Memory Component(s) 1054


In at least one embodiment, long-term personal memory component(s) 1054 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • To persistently store the personal information and data about a user, including for example his or her preferences, identities, authentication credentials, accounts, addresses, and the like;
    • To store information that the user has collected by using the embodiment of assistant 1002, such as the equivalent of bookmarks, favorites, clippings, and the like;
    • To persistently store saved lists of business entities including restaurants, hotels, stores, theaters and other venues. In one embodiment, long-term personal memory component(s) 1054 saves more than just the names or URLs, but also saves the information sufficient to bring up a full listing on the entities including phone numbers, locations on a map, photos, and the like;
    • To persistently store saved movies, videos, music, shows, and other items of entertainment;
    • To persistently store the user's personal calendar(s), to do list(s), reminders and alerts, contact databases, social network lists, and the like;
    • To persistently store shopping lists and wish lists for products and services, coupons and discount codes acquired, and the like;
    • To persistently store the history and receipts for transactions including reservations, purchases, tickets to events, and the like.


According to specific embodiments, multiple instances or threads of long-term personal memory component(s) 1054 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of long-term personal memory component(s) 1054 may be performed, implemented and/or initiated using one or more databases and/or files on (or associated with) clients 1304 and/or servers 1340, and/or residing on storage devices.


According to different embodiments, one or more different threads or instances of long-term personal memory component(s) 1054 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of long-term personal memory component(s) 1054. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of long-term personal memory component(s) 1054 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Long term personal memory entries may be acquired as a side effect of the user interacting with an embodiment of assistant 1002. Any kind of interaction with the assistant may produce additions to the long term personal memory, including browsing, searching, finding, shopping, scheduling, purchasing, reserving, communicating with other people via an assistant.
    • Long term personal memory may also be accumulated as a consequence of users signing up for an account or service, enabling assistant 1002 access to accounts on other services, using an assistant 1002 service on a client device with access to other personal information databases such as calendars, to-do lists, contact lists, and the like.


In at least one embodiment, a given instance of long-term personal memory component(s) 1054 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices, which may be located, for example, at client(s) 1304 and/or server(s) 1340. Examples of different types of data which may be accessed by long-term personal memory component(s) 1054 may include, but are not limited to data from other personal information databases such as contact or friend lists, calendars, to-do lists, other list managers, personal account and wallet managers provided by external services 1360, and the like.


Referring now to FIGS. 44A through 44C, there are shown screen shots depicting an example of the use of long term personal memory component(s) 1054, according to one embodiment. In the example, a feature is provided (named “My Stuff”), which includes access to saved entities such as restaurants, movies, and businesses that are found via interactive sessions with an embodiment of assistant 1002. In screen 4401 of FIG. 44A, the user has found a restaurant. The user taps on Save to My Stuff 4402, which saves information about the restaurant in long-term personal memory component(s) 1054.


Screen 4403 of FIG. 44B depicts user access to My Stuff. In one embodiment, the user can select among categories to navigate to the desired item.


Screen 4404 of FIG. 44C depicts the My Restaurant category, including items previously stored in My Stuff.


Automated Call and Response Procedure


Referring now to FIG. 33, there is shown a flow diagram depicting an automatic call and response procedure, according to one embodiment. The procedure of FIG. 33 may be implemented in connection with one or more embodiments of intelligent automated assistant 1002. It may be appreciated that intelligent automated assistant 1002 as depicted in FIG. 1 is merely one example from a wide range of intelligent automated assistant system embodiments which may be implemented. Other embodiments of intelligent automated assistant systems (not shown) may include additional, fewer and/or different components/features than those illustrated, for example, in the example intelligent automated assistant 1002 depicted in FIG. 1.


In at least one embodiment, the automated call and response procedure of FIG. 33 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • The automated call and response procedure of FIG. 33 may provide an interface control flow loop of a conversational interface between the user and intelligent automated assistant 1002. At least one iteration of the automated call and response procedure may serve as a ply in the conversation. A conversational interface is an interface in which the user and assistant 1002 communicate by making utterances back and forth in a conversational manner.
    • The automated call and response procedure of FIG. 33 may provide the executive control flow for intelligent automated assistant 1002. That is, the procedure controls the gathering of input, processing of input, generation of output, and presentation of output to the user.
    • The automated call and response procedure of FIG. 33 may coordinate communications among components of intelligent automated assistant 1002. That is, it may direct where the output of one component feeds into another, and where the overall input from the environment and action on the environment may occur.


In at least some embodiments, portions of the automated call and response procedure may also be implemented at other devices and/or systems of a computer network.


According to specific embodiments, multiple instances or threads of the automated call and response procedure may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. In at least one embodiment, one or more or selected portions of the automated call and response procedure may be implemented at one or more client(s) 1304, at one or more server(s) 1340, and/or combinations thereof.


For example, in at least some embodiments, various aspects, features, and/or functionalities of the automated call and response procedure may be performed, implemented and/or initiated by software components, network services, databases, and/or the like, or any combination thereof.


According to different embodiments, one or more different threads or instances of the automated call and response procedure may be initiated in response to detection of one or more conditions or events satisfying one or more different types of criteria (such as, for example, minimum threshold criteria) for triggering initiation of at least one instance of automated call and response procedure. Examples of various types of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of the automated call and response procedure may include, but are not limited to, one or more of the following (or combinations thereof):

    • a user session with an instance of intelligent automated assistant 1002, such as, for example, but not limited to, one or more of:
      • a mobile device application starting up, for instance, a mobile device application that is implementing an embodiment of intelligent automated assistant 1002;
      • a computer application starting up, for instance, an application that is implementing an embodiment of intelligent automated assistant 1002;
      • a dedicated button on a mobile device pressed, such as a “speech input button”;
      • a button on a peripheral device attached to a computer or mobile device, such as a headset, telephone handset or base station, a GPS navigation system, consumer appliance, remote control, or any other device with a button that might be associated with invoking assistance;
      • a web session started from a web browser to a website implementing intelligent automated assistant 1002;
      • an interaction started from within an existing web browser session to a website implementing intelligent automated assistant 1002, in which, for example, intelligent automated assistant 1002 service is requested;
      • an email message sent to a modality server 1426 that is mediating communication with an embodiment of intelligent automated assistant 1002;
      • a text message is sent to a modality server 1426 that is mediating communication with an embodiment of intelligent automated assistant 1002;
      • a phone call is made to a modality server 1434 that is mediating communication with an embodiment of intelligent automated assistant 1002;
      • an event such as an alert or notification is sent to an application that is providing an embodiment of intelligent automated assistant 1002.
    • when a device that provides intelligent automated assistant 1002 is turned on and/or started.


According to different embodiments, one or more different threads or instances of the automated call and response procedure may be initiated and/or implemented manually, automatically, statically, dynamically, concurrently, and/or combinations thereof. Additionally, different instances and/or embodiments of the automated call and response procedure may be initiated at one or more different time intervals (e.g., during a specific time interval, at regular periodic intervals, at irregular periodic intervals, upon demand, and the like).


In at least one embodiment, a given instance of the automated call and response procedure may utilize and/or generate various different types of data and/or other types of information when performing specific tasks and/or operations. This may include, for example, input data/information and/or output data/information. For example, in at least one embodiment, at least one instance of the automated call and response procedure may access, process, and/or otherwise utilize information from one or more different types of sources, such as, for example, one or more databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Additionally, at least one instance of the automated call and response procedure may generate one or more different types of output data/information, which, for example, may be stored in local memory and/or remote memory devices.


In at least one embodiment, initial configuration of a given instance of the automated call and response procedure may be performed using one or more different types of initialization parameters. In at least one embodiment, at least a portion of the initialization parameters may be accessed via communication with one or more local and/or remote memory devices. In at least one embodiment, at least a portion of the initialization parameters provided to an instance of the automated call and response procedure may correspond to and/or may be derived from the input data/information.


In the particular example of FIG. 33, it is assumed that a single user is accessing an instance of intelligent automated assistant 1002 over a network from a client application with speech input capabilities. The user is interested in finding a good place for dinner at a restaurant, and is engaging intelligent automated assistant 1002 in a conversation to help provide this service.


The method begins 10. In step 100, the user is prompted to enter a request. The user interface of the client offers several modes of input, as described in connection with FIG. 26. These may include, for example:

    • an interface for typed input, which may invoke an active typed-input elicitation procedure as illustrated in FIG. 11;
    • an interface for speech input, which may invoke an active speech input elicitation procedure as illustrated in FIG. 22.
    • an interface for selecting inputs from a menu, which may invoke active GUI-based input elicitation as illustrated in FIG. 23.


One skilled in the art will recognize that other input modes may be provided.


In one embodiment, step 100 may include presenting options remaining from a previous conversation with assistant 1002, for example using the techniques described in the active dialog suggestion input elicitation procedure described in connection with FIG. 24.


For example, by one of the methods of active input elicitation in step 100, the user might say to assistant 1002, “where may I get some good Italian around here?” For example, the user might have spoken this into a speech input component. An embodiment of an active input elicitation component 1094 calls a speech-to-text service, asks the user for confirmation, and then represents the confirmed user input as a uniform annotated input format 2690.


An embodiment of language interpreter component 1070 is then called in step 200, as described in connection with FIG. 28. Language interpreter component 1070 parses the text input and generates a list of possible interpretations of the user's intent 290. In one parse, the word “italian” is associated with restaurants of style Italian; “good” is associated with the recommendation property of restaurants; and “around here” is associated with a location parameter describing a distance from a global sensor reading (for example, the user's location as given by GPS on a mobile device).


In step 300, the representation of the user's intent 290 is passed to dialog flow processor 1080, which implements an embodiment of a dialog and flow analysis procedure as described in connection with FIG. 32. Dialog flow processor 1080 determines which interpretation of intent is most likely, maps this interpretation to instances of domain models and parameters of a task model, and determines the next flow step in a dialog flow. In the current example, a restaurant domain model is instantiated with a constrained selection task to find a restaurant by constraints (the cuisine style, recommendation level, and proximity constraints). The dialog flow model indicates that the next step is to get some examples of restaurants meeting these constraints and present them to the user.


In step 400, an embodiment of the flow and service orchestration procedure 400 is invoked, via services orchestration component 1082 as described in connection with FIG. 37. It invokes a set of services 1084 on behalf of the user's request to find a restaurant. In one embodiment, these services 1084 contribute some data to a common result. Their data are merged and the resulting list of restaurants is represented in a uniform, service-independent form.


In step 500, output processor 1092 generates a dialog summary of the results, such as, “I found some recommended Italian restaurants near here.” Output processor 1092 combines this summary with the output result data, and then sends the combination to a module that formats the output for the user's particular mobile device in step 600.


In step 700, this device-specific output package is sent to the mobile device, and the client software on the device renders it on the screen (or other output device) of the mobile device.


The user browses this presentation, and decides to explore different options. If the user is done 790, the method ends. If the user is not done 790, another iteration of the loop is initiated by returning to step 100.


The automatic call and response procedure may be applied, for example to a user's query “how about mexican food?”. Such input may be elicited in step 100. In step 200, the input is interpreted as restaurants of style Mexican, and combined with the other state (held in short term personal memory 1052) to support the interpretation of the same intent as the last time, with one change in the restaurant style parameter. In step 300, this updated intent produces a refinement of the request, which is given to service orchestration component(s) 1082 in step 400.


In step 400 the updated request is dispatched to multiple services 1084, resulting in a new set of restaurants which are summarized in dialog in 500, formatted for the device in 600, and sent over the network to show new information on the user's mobile device in step 700.


In this case, the user finds a restaurant of his or her liking, shows it on a map, and sends directions to a friend.


One skilled in the art will recognize that different embodiments of the automated call and response procedure (not shown) may include additional features and/or operations than those illustrated in the specific embodiment of FIG. 33, and/or may omit at least a portion of the features and/or operations of automated call and response procedure illustrated in the specific embodiment of FIG. 33.


Constrained Selection


In one embodiment, intelligent automated assistant 1002 uses constrained selection in its interactions with the user, so as to more effectively identify and present items that are likely to be of interest to the user.


Constrained selection is a kind of generic task. Generic tasks are abstractions that characterize the kinds of domain objects, inputs, outputs, and control flow that are common among a class of tasks. A constrained selection task is performed by selecting items from a choice set of domain objects (such as restaurants) based on selection constraints (such as a desired cuisine or location). In one embodiment, assistant 1002 helps the user explore the space of possible choices, eliciting the user's constraints and preferences, presenting choices, and offering actions to perform on those choices such as to reserve, buy, remember, or share them. The task is complete when the user selects one or more items on which to perform the action.


Constrained selection is useful in many contexts: for example, picking a movie to see, a restaurant for dinner, a hotel for the night, a place to buy a book, or the like. In general, constrained selection is useful when one knows the category and needs to select an instance of the category with some desired properties.


One conventional approach to constrained selection is a directory service. The user picks a category and the system offers a list of choices. In a local directory, one may constrain the directory to a location, such as a city. For instance, in a “yellow pages” service, users select the book for a city and then look up the category, and the book shows one or more items for that category. The main problem with a directory service is that the number of possibly relevant choices is large (e.g., restaurants in a given city).


Another conventional approach is a database application, which provides a way to generate a choice set by eliciting a query from the user, retrieving matching items, and presenting the items in some way that highlights salient features. The user browses the rows and columns of the result set, possibly sorting the results or changing the query until he or she finds some suitable candidates. The problem with the database service is that it may require the user to operationalize their human need as a formal query and to use the abstract machinery of sort, filter, and browse to explore the resulting data. These are difficult for most people to do, even with graphical user interfaces.


A third conventional approach is open-ended search, such as “local search”. Search is easy to do, but there are several problems with search services that make them difficult for people to accomplish the task of constrained selection. Specifically:

    • As with directory search, the user may not just enter a category and look at one or more possible choice, but must narrow down the list.
    • If the user can narrow the selection by constraints, it is not obvious what constraints may be used (e.g., may I search for places that are within walking distance or are open late?)
    • It is not clear how to state constraints (e.g., is it called cuisine or restaurant type, and what are the possible values?)
    • Multiple preferences conflict; there is usually no objectively “best” answer to a given situation (e.g., I want a place that is close by and cheap serving gourmet food with excellent service and which is open until midnight).
    • Preferences are relative, and they depend on what is available. For example, if the user may get a table at a highly rated restaurant, he or she might choose it even though it is expensive. In general, though, the user would prefer less expensive options.


In various embodiments, assistant 1002 of the present invention helps streamline the task of constrained selection. In various embodiments, assistant 1002 employs database and search services, as well as other functionality, to reduce the effort, on the part of the user, of stating what he or she is looking for, considering what is available, and deciding on a satisfactory solution.


In various embodiments, assistant 1002 helps to make constrained selection simpler for humans in any of a number of different ways.


For example, in one embodiment, assistant 1002 may operationalize properties into constraints. The user states what he or she wants in terms of properties of the desired outcome. Assistant 1002 operationalizes this input into formal constraints. For example, instead of saying “find one or more restaurants less than 2 miles from the center of Palo Alto whose cuisine includes Italian food” the user may just say “Italian restaurants in palo alto”. Assistant 1002 may also operationalize qualities requested by the user that are not parameters to a database. For example, if the user requests romantic restaurants, the system may operationalize this as a text search or tag matching constraint. In this manner, assistant 1002 helps overcome some of the problems users may otherwise have with constrained selection. It is easier, for a user, to imagine and describe a satisfactory solution than to describe conditions that would distinguish suitable from unsuitable solutions.


In one embodiment, assistant 1002 may suggest useful selection criteria, and the user need only say which criteria are important at the moment. For example, assistant 1002 may ask “which of these matter: price (cheaper is better), location (closer is better), rating (higher rated is better)?” Assistant 1002 may also suggest criteria that may require specific values; for example, “you can say what kind of cuisine you would like or a food item you would like”.


In one embodiment, assistant 1002 may help the user make a decision among choices that differ on a number of competing criteria (for example, price, quality, availability, and convenience).


By providing such guidance, assistant 1002 may help users in making multiparametric decisions in any of several ways:

    • One is to reduce the dimensionality of the space, combining raw data such as ratings from multiple sources into a composite “recommendation” score. The composite score may take into account domain knowledge about the sources of data (e.g., Zagat ratings may be more predictive of quality than Yelp).
    • Another approach is to focus on a subset of criteria, turning a problem of “what are all the possible criteria to consider and how to they combine?” into a selection of the most important criteria in a given situation (e.g., “which is more important, price or proximity?”).
    • Another way to simply the decision making is to assume default values and preference orders (e.g., all things being equal, higher rated and closer and cheaper are better). The system may also remember users' previous responses that indicate their default values and preferences.
    • Fourth, the system may offer salient properties of items in the choice set that were not mentioned in the original request. For example, the user may have asked for local Italian food. The system may offer a choice set of restaurants, and with them, a list of popular tags used by reviewers or a tag line from a guide book (e.g., “a nice spot for a date” “great pasta”). This could let people pick out a specific item and complete the task. Research shows that most people make decisions by evaluating specific instances rather than deciding on criteria and rationally accepting the one that pops to the top. It also shows that people learn about features from concrete cases. For example, when choosing among cars, buyers may not care about navigation systems until they see that some of the cars have them (and then the navigation system may become an important criterion). Assistant 1002 may present salient properties of listed items that help people pick a winner or that suggest a dimension along which to optimize.


      Conceptual Data Model


In one embodiment, assistant 1002 offers assistance with the constrained selection task by simplifying the conceptual data model. The conceptual data model is the abstraction presented to users in the interface of assistant 1002. To overcome the psychological problems described above, in one embodiment assistant 1002 provides a model that allows users to describe what they want in terms of a few easily recognized and recalled properties of suitable choices rather than constraint expressions. In this manner, properties can be made easy to compose in natural language requests (e.g., adjectives modifying keyword markers) and be recognizable in prompts (“you may also favor recommended restaurants . . . ”). In one embodiment, a data model is used that allows assistant 1002 to determine the domain of interest (e.g., restaurants versus hotels) and a general approach to guidance that may be instantiated with domain-specific properties.


In one embodiment, the conceptual data model used by assistant 1002 includes a selection class. This is a representation of the space of things from which to choose. For example, in the find-a-restaurant application, the selection class is the class of restaurants. The selection class may be abstract and have subclasses, such as “things to do while in a destination”. In one embodiment, the conceptual data model assumes that, in a given problem solving situation, the user is interested in choosing from a single selection class. This assumption simplifies the interaction and also allows assistant 1002 to declare its boundaries of competence (“I know about restaurants, hotels, and movies” as opposed to “I know about life in the city”).


Given a selection class, in one embodiment the data model presented to the user for the constrained selection task includes, for example: items; item features; selection criteria; and constraints.


Items are instances of the selection class.


Item features are properties, attributes, or computed values that may be presented and/or associated with at least one item. For example, the name and phone number of a restaurant are item features. Features may be intrinsic (the name or cuisine of a restaurant) or relational (e.g., the distance from one's current location of interest). They may be static (e.g., restaurant name) or dynamic (rating). They may be composite values computed from other data (e.g., a “value for money” score). Item features are abstractions for the user made by the domain modeler; they do not need to correspond to underlying data from back-end services.


Selection criteria are item features that may be used to compare the value or relevance of items. That is, they are ways to say which items are preferred. Selection criteria are modeled as features of the items themselves, whether they are intrinsic properties or computed. For example, proximity (defined as distance from the location of interest) is a selection criterion. Location in space-time is a property, not a selection criterion, and it is used along with the location of interest to compute the distance from the location of interest.


Selection criteria may have an inherent preference order. That is, the values of any particular criterion may be used to line up items in a best first order. For example, the proximity criterion has an inherent preference that closer is better. Location, on the other hand, has no inherent preference value. This restriction allows the system to make default assumptions and guide the selection if the user only mentions the criterion. For example, the user interface might offer to “sort by rating” and assume that higher rated is better.


One or more selection criteria are also item features; they are those features related to choosing among possible items. However, item features are not necessarily related to a preference (e.g., the names and phone numbers of restaurants are usually irrelevant to choosing among them).


In at least one embodiment, constraints are restrictions on the desired values of the selection criteria. Formally, constraints might be represented as set membership (e.g., cuisine type includes Italian), pattern matches (e.g., restaurant review text includes “romantic”), fuzzy inequalities (e.g., distance less than a few miles), qualitative thresholds (e.g., highly rated), or more complex functions (e.g., a good value for money). To make things simple enough for normal humans, this data model reduces at least one or more constraints to symbolic values that may be matched as words. Time and distance may be excluded from this reduction. In one embodiment, the operators and threshold values used for implementing constraints are hidden from the user. For example, a constraint on the selection criteria called “cuisine” may be represented as a symbolic value such as “Italian” or “Chinese”. A constraint on rating is “recommended” (a binary choice). For time and distance, in one embodiment assistant 1002 uses proprietary representations that handle a range of inputs and constraint values. For example, distance might be “walking distance” and time might be “tonight”; in one embodiment, assistant 1002 uses special processing to match such input to more precise data.


In at least one embodiment, some constraints may be required constraints. This means that the task simply cannot be completed without this data. For example, it is hard to pick a restaurant without some notion of desired location, even if one knows the name.


To summarize, a domain is modeled as selection classes with item features that are important to users. Some of the features are used to select and order items offered to the user—these features are called selection criteria. Constraints are symbolic limits on the selection criteria that narrow the set of items to those that match.


Often, multiple criteria may compete and constraints may match partially. The data model reduces the selection problem from an optimization (finding the best solution) to a matching problem (finding items that do well on a set of specified criteria and match a set of symbolic constraints). The algorithms for selecting criteria and constraints and determining an ordering are described in the next section.


Methodology for Constrained Selection


In one embodiment, assistant 1002 performs constrained selection by taking as input an ordered list of criteria, with implicit or explicit constraints on at least one, and generating a set of candidate items with salient features. Computationally, the selection task may be characterized as a nested search: first, identify a selection class, then identify the important selection criteria, then specify constraints (the boundaries of acceptable solutions), and search through instances in order of best-fit to find acceptable items.


Referring now to FIG. 45, there is shown an example of an abstract model 4500 for a constrained selection task as a nested search. In the example assistant 1002 identifies 4505 a selection call among all local search types 4501. The identified class is restaurant. Within the set of all restaurants 4502, assistant 1002 selects 4506 criteria. In the example, the criterion is identified as distance. Within the set of restaurants in PA 4503, assistant 1002 specifies 4507 constraints for the search. In the example, the identified constraint is “Italian cuisine”). Within the set of Italian restaurants in PA 4504, assistant 4508 selects items for presentation to the user.


In one embodiment, such a nested search is what assistant 1002 does once it has the relevant input data, rather than the flow for eliciting the data and presenting results. In one embodiment, such control flow is governed via a dialog between assistant 1002 and the user which operates by other procedures, such as dialog and task flow models. Constrained selection offers a framework for building dialog and task flow models at this level of abstraction (that is, suitable for constrained selection tasks regardless of domain).


Referring now to FIG. 46, there is shown an example of a dialog 4600 to help guide the user through a search process, so that the relevant input data can be obtained.


In the example dialog 4600, the first step is for the user to state the kind of thing they are looking for, which is the selection class. For example, the user might do this by saying “dining in palo alto”. This allows assistant 1002 to infer 4601 the task and domain.


Once assistant 1002 has understood the task and domain binding (selection class=restaurants), the next step is to understand which selection criteria are important to this user, for example by soliciting 4603 criteria and/or constraints. In the example above, “in palo alto” indicates a location of interest. In the context of restaurants, the system may interpret a location as a proximity constraint (technically, a constraint on the proximity criterion). Assistant 1002 explains 4604 what is needed, receives input. If there is enough information to constrain the choice set to a reasonable size, then assistant 1002 paraphrases the input and presents 4605 one or more restaurants that meet the proximity constraint, sorted in some useful order. The user can then select 4607 from this list, or refine 4606 the criteria and constraints. Assistant 1002 reasons about the constraints already stated, and uses domain-specific knowledge to suggest other criteria that might help, soliciting constraints on these criteria as well. For example, assistant 1002 may reason that, when recommending restaurants within walking distance of a hotel, the useful criteria to solicit would be cuisine and table availability.


The constrained selection task 4609 is complete when the user selects 4607 an instance of the selection class. In one embodiment, additional follow-on tasks 4602 are enabled by assistant 1002. Thus, assistant 1002 can offer services that indicate selection while providing some other value. Examples 4608 booking a restaurant, setting a reminder on a calendar, and/or sharing the selection with others by sending an invitation. For example, booking a restaurant certainly indicates that it was selected; other options might be to put the restaurant on a calendar or send in invitation with directions to friends.


Referring now to FIG. 47, there is shown a flow diagram depicting a method of constrained selection according to one embodiment. In one embodiment, assistant 1002 operates in an opportunistic and mixed-initiative manner, permitting the user to jump to the inner loop, for instance, by stating task, domain, criteria, and constraints one or more at once in the input.


The method begins 4701. Input is received 4702 from the user, according to any of the modes described herein. If, based on the input, the task not known (step 4703, “No”), assistant 1002 requests 4705 clarifying input from the user.


In step 4717, assistant 1002 determines whether the user provides additional input. If so, assistant 1002 returns to step 4702. Otherwise the method ends 4799.


If, in step 4703, the task is known, assistant 1002 determines 4704 whether the task is constrained selection. If not, assistant 1002 proceeds 4706 to the specified task flow.


If, in step 4704, the task is constrained selection (step 4703, “Yes”), assistant 1002 determines 4707 whether the selection class can be determined. If not, assistant 1002 offers 4708 a choice of known selection classes, and returns to step 4717.


If, in step 4707, the selection class can be determined, assistant 1002 determines 4709 whether all required constraints can be determined. If not, assistant 1002 prompts 4710 for required information, and returns to step 4717.


If, in step 4709, all required constants can be determined, assistant 1002 determines 4711 whether any result items can be found, given the constraints. If there are no items that meet the constraints, assistant 1002 offers 4712 ways to relax the constraints. For example, assistant 1002 may relax the constraints from lowest to highest precedence, using a filter/sort algorithm. In one embodiment, if there are items that meet some of the constraints, then assistant 1002 may paraphrase the situation (outputting, for example, “I could not find Recommended Greek restaurants that deliver on Sundays in San Carlos. However, I found 3 Greek restaurants and 7 Recommend restaurants in San Carlos.”). In one embodiment, if there are no items that match any constraints, then assistant 1002 may paraphrase this situation and prompt for different constraints (outputting, for example, “Sorry, I could not find any restaurants in Anytown, Tex. You may pick a different location.”). Assistant 1002 returns to step 4717.


If, in step 4711, result items can be found, assistant 1002 offers 4713 a list of items. In one embodiment, assistant 1002 paraphrases the currently specified criteria and constraints (outputting, for example, “Here are some recommended Italian restaurants in San Jose.” (recommended=yes, cuisine=Italian, proximity=<in San Jose>)). In one embodiment, assistant 1002 presents a sorted, paginated list of items that meet the known constraints. If an item only shows some of the constraints, such a condition can be shown as part of the item display. In one embodiment, assistant 1002 offers the user ways to select an item, for example by initiating another task on that item such as booking, remembering, scheduling, or sharing. In one embodiment, on any given item, assistant 1002 presents item features that are salient for picking instances of the selection class. In one embodiment, assistant 1002 shows how the item meets a constraint; for example, Zagat rating of 5 meets the Recommended=yes constraint, and “1 mile away” meets the “within walking distance of an address” constraint. In one embodiment, assistant 1002 allows the user to drill down for more detail on an item, which results in display of more item features.


Assistant 1002 determines 4714 whether the user has selected an item. If the user selects an item, the task is complete. Any follow-on task is performed 4715, if there is one, and the method ends 4799.


If, in step 4714, the user does not select an item, assistant 1002 offers 4716 the user ways to select other criteria and constraints and returns to step 4717. For example, given the currently specified criteria and constraints, assistant 1002 may offer criteria that are most likely to constrain the choice set to a desired size. If the user selects a constraint value, that constraint value is added to the previously determined constraints when steps 4703 to 4713 are repeated.


Since one or more criteria may have an inherent preference value, selecting the criteria may add information to the request. For example, allowing the user to indicate that positive reviews are valued allows assistant 1002 to sort by this criterion. Such information can be taken into account when steps 4703 to 4713 are repeated.


In one embodiment, assistant 1002 allows the user to raise the importance of a criterion that is already specified, so that it would be higher in the precedence order. For example, if the user asked for fast, cheap, highly recommended restaurants within one block of their location, assistant 1002 may request that the user chooses which of these criteria are more important. Such information can be taken into account when steps 4703 to 4713 are repeated.


In one embodiment, the user can provide additional input at any point while the method of FIG. 47 is being performed. In one embodiment, assistant 1002 checks periodically or continuously for such input, and, in response, loops back to step 4703 to process it.


In one embodiment, when outputting an item or list of items, assistant 1002 indicates, in the presentation of items, the features that were used to select and order them. For example, if the user asked for nearby Italian restaurants, such item features for distance and cuisine may be shown in the presentation of the item. This may include highlighting matches, as well as listing selection criteria that were involved in the presentation of an item.


Example Domains



FIG. 48 provides an example of constrained selection domains that may be handled by assistant 1002 according to various embodiments.


Filtering and Sorting Results


In one embodiment, when presenting items that meet currently specified criteria and constraints, a filter/sort methodology can be employed. In one embodiment selection constraints may serve as both filter and sort parameters to the underlying services. Thus, any selection criterion can be used to determine which items are in the list, and to compute the order in which to paginate and show them. Sort order for this task is akin to relevance rank in search. For example, proximity is a criterion with symbolic constraint values such as “within driving distance” and a general notion of sorting by distance. The “driving distance” constraint might be used to select a group of candidate items. Within that group, closer items might be sorted higher in the list.


In one embodiment, selection constraints and associated filtering and sorting are at discrete “levels”, which are functions of both the underlying data and the input from the user. For example, proximity is grouped into levels such as “walking distance”, “taxi distance”, “driving distance”. When sorting, one or more items within walking distance are treated as if they were the same distance. The input from the user may come into play in the way he or she specifies a constraint. If the user enters “in palo alto”, for example, then one or more items within the Palo Alto city limits are perfect matches and are equivalent. If the user enters, “near the University Avenue train station” then the match would depend on a distance from that address, with the degree of match dependent on the selection class (e.g., near for restaurants is different than near for hotels). Even within a constraint that may be specified with a continuous value, a discretization may be applied. This may be important for sorting operations, so that multiple criteria may participate in determining the best-first ordering.


In one embodiment, the item list—those items that are considered “matching” or “good enough”—may be shorter or longer than the number of items shown on one “page” of the output. Generally, items in the first page are given the most attention, but conceptually there is a longer list, and pagination is simply a function of the form factor of the output medium. This means, for instance, that if the user is offered a way to sort or browse the items by some criterion, then it is the entire set of items (more than one page worth) that is sorted or browsed.


In one embodiment, there is a precedence ordering among selection criteria. That is, some criteria may matter more than others in the filter and sort. In one embodiment, those criteria selected by the user are given higher precedence than others, and there is a default ordering over one or more criteria. This allows for a general lexicographic sort. The assumption is that there is a meaningful a priori precedence. For example, unless the user states otherwise, it may be more important for a restaurant to be close than to be inexpensive. In one embodiment, the a priori precedence ordering is domain-specific. The model allows for user-specific preferences to override the domain defaults, if that is desired.


Since the values of constraints can represent several internal data types, there are different ways for constraints to match, and they may be specific to the constraint. For example, in one embodiment:

    • Binary constraints match one or more or none. For example, whether a restaurant is “Fast” might be either true or not.
    • Set membership constraints match one or more or none based on a property value. For example, cuisine=Greek means the set of cuisines for a restaurant includes Greek.
    • Enumeration constraints match at a threshold. For example, a rating criterion might have constraint values rated, highly-rated, or top-rated. Constraining to highly-rated would also match top-rated.
    • Numeric constraints match at a threshold that may be criterion specific. For example, “open late” might be a criterion, and the user might ask for places open after 10:00 pm. This kind of constraint may be slightly out of scope for the constrained selection task, since it is not a symbolic constraint value. However, in one embodiment, assistant 1002 recognizes some cases of numeric constraints like this, and maps them to threshold values with symbolic constraints (e.g., “restaurants in palo alto open now”->“here are 2 restaurants in palo alto that are open late”).
    • Location and time are handled specially. A constraint on proximity might be a location of interest specified at some level of granularity, and that determines the match. If the user specifies a city, then city-level matching is appropriate; a ZIP code may allow for a radius. Assistant 1002 may also understand locations that are “near” other locations of interest, also based on special processing. Time is relevant as a constraint value of criteria that have threshold value based on a service call, such as table availability or flights within a given time range.


In one embodiment, constraints can be modeled so that there is a single threshold value for selection and a small set of discrete values for sorting. For example, the affordability criterion might be modeled as a roughly binary constraint, where affordable restaurants are any under some threshold price range. When the data justify multiple discrete levels for selection, constraints can be modeled using a gradient of matching. In one embodiment two levels of matching (such as strong and weak matching) may be provided; however, one skilled in the art will recognize that in other embodiments, any number of levels of matching can be provided. For example, proximity may be matched with a fuzzy boundary, so that things that are near the location of interest may match weakly. The operational consequence of a strong or weak match is in the filter/sort algorithm as described below.


For at least one criterion, an approach to matching and default thresholds can be established, if relevant. The user may be able to say just the name of the constraint, a symbolic constraint value, or a precise constraint expression if it is handled specially (such as time and location).


An ideal situation for constrained selection occurs when the user states constraints that result in a short list of candidates, one or more of which meet the constraints. The user then chooses among winners based on item features. In many cases, however, the problem is over- or under-constrained. When it is over-constrained, there are few or no items that meet the constraints. When it is under-constrained, there are so many candidates that examining the list is not expedient. In one embodiment, the general constrained selection model of the present invention is able to handle multiple constraints with robust matching and usually produce something to choose from. Then the user may elect to refine their criteria and constraints or just complete the task with a “good enough” solution.


Method


In one embodiment, the following method is used for filtering and sorting results:

    • 1. Given an ordered list of selection criteria selected by the user, determine constraints on at least one.
      • a. If the user specified a constraint value, use it. For example, if the user said “greek food” the constraint is cuisine=Greek. If the user said “san Francisco” the constraint is In the City of San Francisco. If the user said “south of market” then the constraint is In the Neighborhood of SoMa.
      • b. Otherwise use a domain- and criteria-specific default. For example, if the user said “a table at some that place” he or she is indicating that the availability criterion is relevant, but he or she did not specify a constraint value. The default constraint values for availability might be some range of date times such as tonight and a default party size of 2.
    • 2. Select a minimum of N results by specified constraints.
      • a. Try to get N results at strong match.
      • b. If that fails, try to relax constraints, in reverse precedence order. That is, match at strong level for one or more of the criteria except the last, which may match at a weak level. If there is no weak match for that constraint, then try weak matches up the line from lowest to highest precedence.
      • c. Then repeat the loop allowing failure to match on constraints, from lowest to highest precedence.
    • 3. After getting a minimum choice set, sort lexicographically over one or more criteria (which may include user-specified criteria as well as other criteria) in precedence order.
      • a. Consider the set of user-specified criteria as highest precedence, then one or more remaining criteria in their a priori precedence. For example, if the a priori precedence is (availability, cuisine, proximity, rating), and the user gives constraints on proximity and cuisine, then the sort precedence is (cuisine, proximity, availability, rating).
      • b. Sort on criteria using discrete match levels (strong, weak, none), using the same approach as in relaxing constraints, this time applied the full criteria list.
        • i. If a choice set was obtained without relaxing constraints, then one or more of the choice set may “tie” in the sort because they one or more match at strong levels. Then, the next criteria in the precedence list may kick in to sort them. For example, if the user says cuisine=Italian, proximity=In San Francisco, and the sort precedence is (cuisine, proximity, availability, rating), then one or more the places on the list have equal match values for cuisine and proximity. So the list would be sorted on availability (places with tables available bubble to the top). Within the available places, the highest rated ones would be at the top.
        • ii. If the choice set was obtained by relaxing constraints, then one or more of the fully matching items are at the top of the list, then the partially matching items. Within the matching group, they are sorted by the remaining criteria, and the same for the partially matching group. For example, if there were only two Italian restaurants in San Francisco, then the available one would be shown first, then the unavailable one. Then the rest of the restaurants in San Francisco would be shown, sorted by availability and rating.


          Precedence Ordering


The techniques described herein allow assistant 1002 to be extremely robust in the face of partially specified constraints and incomplete data. In one embodiment, assistant 1002 uses these techniques to generate a user list of items in best-first order, i.e. according to relevance.


In one embodiment, such relevance sorting is based on an a priori precedence ordering. That is, of the things that matter about a domain, a set of criteria is chosen and placed in order of importance. One or more things being equal, criteria higher in the precedence order may be more relevant to a constrained selection among items than those lower in the order. Assistant 1002 may operate on any number of criteria. In addition, criteria may be modified over time without breaking existing behaviors.


In one embodiment, the precedence order among criteria may be tuned with domain-specific parameters, since the way criteria interact may depend on the selection class. For example, when selecting among hotels, availability and price may be dominant constraints, whereas for restaurants, cuisine and proximity may be more important.


In one embodiment, the user may override the default criteria ordering in the dialog. This allows the system to guide the user when searches are over-constrained, by using the ordering to determine which constraints should be relaxed. For example, if the user gave constraints on cuisine, proximity, recommendation, and food item, and there were no fully matching items, the user could say that food item was more important than recommendation level and change the mix so the desired food item matches were sorted to the top.


In one embodiment, when precedence order is determined, user-specified constraints take precedence over others. For example, in one embodiment, proximity is a required constraint and so is always specified, and further has precedence over other unselected constraints. Therefore it does not have to be the highest precedence constraint in order to be fairly dominant. Also, many criteria may not match at one or more unless a constraint is given by the user, and so the precedence of these criteria only matters within user-selected criteria. For example, when the user specifies a cuisine it is important to them, and otherwise is not relevant to sorting items.


For example, the following is a candidate precedence sorting paradigm for the restaurant domain:


1. cuisine* (not sortable unless a constraint value is given)


2. availability* (sortable using a default constraint value, e.g., time)


3. recommended


4. proximity* (a constraint value is always given)


5. affordability


6. may deliver


7. food item (not sortable unless a constraint value, e.g., a keyword, is given)


8. keywords (not sortable unless a constraint value, e.g., a keyword, is given)


9. restaurant name


The following is an example of a design rationale for the above sorting paradigm:

    • If a user specifies a cuisine, he or she wants it to stick.
    • One or more things being equal, sort by rating level (it is the highest precedence among criteria than may be used to sort without a constraint).
    • In at least one embodiment, proximity may be more important than most things. However, since it matches at discrete levels (in a city, within a radius for walking and the like), and it is always specified, then most of the time most matching items may “tie” on proximity.
    • Availability (as determined by a search on a website such as opentable.com, for instance) is a valuable sort criterion, and may be based on a default value for sorting when not specified. If the user indicates a time for booking, then only available places may be in the list and the sort may be based on recommendation.
    • If the user says they want highly recommended places, then it may sort above proximity and availability, and these criteria may be relaxed before recommendation. The assumption is that if someone is looking for nice place, they may be willing to drive a bit farther and it is more important than a default table availability. If a specific time for availability is specified, and the user requests recommended places, then places that are both recommended and available may come first, and recommendation may relax to a weak match before availability fails to match at one or more.
    • The remaining constraints except for name are one or more based on incomplete data or matching. So they are weak sort heuristics by default, and when they are specified the match one or more-or-none.
    • Name may be used as a constraint to handle the case where someone mentions the restaurant by name, e.g., find one or more Hobee's restaurants near Palo Alto. In this case, one or more items may match the name, and may be sorted by proximity (the other specified constraint in this example).


      Domain Modeling: Mapping Selection Criteria to Underlying Data


It may be desirable to distinguish between the data that are available for computation by assistant 1002 and the data used for making selections. In one embodiment, assistant 1002 uses a data model that reduces the complexity for the user by folding one or more kinds of data used to distinguish among items into a simple selection criteria model. Internally, these data may take several forms. Instances of the selection class can have intrinsic properties and attributes (such as cuisine of a restaurant), may be compared along dimensions (such as the distance from some location), and may be discovered by some query (such as whether it matches a text pattern or is available at a given time). They may also be computed from other data which are not exposed to the user as selection criteria (e.g., weighted combinations of ratings from multiple sources). These data are one or more relevant to the task, but the distinctions among these three kinds of data are not relevant to the user. Since the user thinks in terms of features of the desired choice rather than in properties and dimensions, assistant 1002 operationalizes these various criteria into features of the items. Assistant 1002 provides a user-facing domain data model and maps it to data found in web services.


One type of mapping is an isomorphism from underlying data to user-facing criteria. For example, the availability of tables for reservations as seen by the user could be exactly what an online reservation website, such as opentable.com, offers, using the same granularity for time and party size.


Another type of mapping is a normalization of data from one or more services to a common value set, possibly with a unification of equivalent values. For example, cuisines of one or more restaurants may be represented as a single ontology in assistant 1002, and mapped to various vocabularies used in different services. That ontology might be hierarchical, and have leaf nodes pointing to specific values from at least one service. For example, one service might have a cuisine value for “Chinese”, another for “Szechuan”, and a third for “Asian”. The ontology used by assistant 1002 would cause references to “Chinese food” or “Szechuan” to semantically match one or more of these nodes, with confidence levels reflecting the degree of match.


Normalization might also be involved when resolving differences in precision. For example, the location of a restaurant may be given to the street level in one service but only to city in another. In one embodiment, assistant 1002 uses a deep structural representation of locations and times that may be mapped to different surface data values.


In one embodiment, assistant 1002 uses a special kind of mapping for open-ended qualifiers (e.g., romantic, quiet) which may be mapped to matches in full text search, tags, or other open-textured features. The name of the selection constraint in this case would be something like “is described as”.


In at least one embodiment, constraints may be mapped to operational preference orderings. That is, given the name of a selection criterion and its constraint value, assistant 1002 is able to interpret the criterion as an ordering over possible items. There are several technical issues to address in such a mapping. For example:

    • Preference orderings may conflict. The ordering given by one constraint may be inconsistent or even inversely correlated with the ordering given by another. For example, price and quality tend to be in opposition. In one embodiment, assistant 1002 interprets constraints chosen by the user in a weighted or otherwise combined ordering that reflects the user's desires but is true to the data. For example, the user may ask for “cheap fast food French restaurants within walking distance rated highly”. In many locations, there may not be any such restaurant. However, in one embodiment, assistant 1002 may show a list of items that tries to optimize for at least one constraint, and explain why at least one is listed. For example, item one might be “highly rated French cuisine” and another “cheap fast food within walking distance”.
    • Data may be used as either hard or soft constraints. For example, the price range of a restaurant may be important to choosing one, but it may be difficult to state a threshold value for price up-front. Even seemingly hard constraints like cuisine may be, in practice, soft constraints because of partial matching. Since, in one embodiment, assistant 1002 using a data modeling strategy that seeks to flatten one or more criteria into symbolic values (such as “cheap” or “close”), these constraints may be mapped into a function that gets the criteria and order right, without being strict about matching specific threshold values. For symbolic criteria with clear objective truth values, assistant 1002 may weight the objective criteria higher than other criteria, and make it clear in the explanation that it knows that some of the items do not strictly match the requested criteria.
    • Items may match some but not one or more constraints, and the “best fitting” items may be shown.
    • In general, assistant 1002 determines which item features are salient for a domain, and which may serve as selection criteria, and for at least one criteria, possible constraint values. Such information can be provided, for example, via operational data and API calls.


      Paraphrase and Prompt Text


As described above, in one embodiment assistant 1002 provides feedback to show it understands the user's intent and is working toward the user's goal by producing paraphrases of its current understanding. In the conversational dialog model of the present invention, the paraphrase is what assistant 1002 outputs after the user's input, as a preface (for example, paraphrase 4003 in FIG. 40) or summary of the results to follow (for example, list 3502 in FIG. 35). The prompt is a suggestion to the user about what else they can do to refine their request or explore the selection space along some dimensions.


In one embodiment, the purposes of paraphrase and prompt text include, for example:

    • to show that assistant 1002 understands the concepts in the user's input, not just the text;
    • to indicate the boundaries of assistant's 1002 understanding;
    • to guide the user to enter text that is required for the assumed task;
    • to help the user explore the space of possibilities in constrained selection;
    • to explain the current results obtained from services in terms of the user's stated criteria and assistant's 1002 assumptions (for example, to explain the results of under- and over-constrained requests).


For example, the following paraphrase and prompt illustrates several of these goals:


User input: indonesian food in menlo park


System Interpretation:


Task=constrainedSelection


SelectionClass=restaurant


Constraints:

    • Location=Menlo Park, Calif.
    • Cuisine=Indonesian (known in ontology)


Results from Services: no strong matches


Paraphrase: Sorry, I can't find any Indonesian restaurants near Menlo Park.


Prompt: You could try other cuisines or locations.


Prompt Under Hypertext Links:

    • Indonesian: You can try other food categories such as Chinese, or a favorite food item such as steak.
    • Menlo Park Enter a location such as a city, neighborhood, street address, or “near” followed by a landmark.
    • Cuisines: Enter a food category such as Chinese or Pizza.
    • Locations: Enter a location: a city, zip code, or “near” followed by the name of a place.


In one embodiment, assistant 1002 responds to user input relatively quickly with the paraphrase. The paraphrase is then updated after results are known. For example, an initial response may be “Looking for Indonesian restaurants near Menlo Park . . . ” Once results are obtained, assistant 1002 would update the text to read, “Sorry, I can't find any Indonesian restaurants near Menlo Park. You could try other cuisines or locations.” Note that certain items are highlighted (indicated here by underline), indicating that those items represent constraints that can be relaxed or changed.


In one embodiment, special formatting/highlighting is used for key words in the paraphrase. This can be helpful to facilitate training of the user for interaction with intelligent automated assistant 1002, by indicating to the user which words are most important to, and more likely to be recognized by, assistant 1002. User may then be more likely to use such words in the future.


In one embodiment, paraphrase and prompt are generated using any relevant context data. For example, any of the following data items can be used, alone or in combination:

    • The parse—a tree of ontology nodes bound to their matching input tokens, with annotations and exceptions. For each node in the parse, this may include the node's metadata and/or any tokens in the input that provide evidence for the node's value.
    • The task, if known
    • The selection class.
    • The location constraint, independent of selection class.
    • Which required parameters are unknown for the given selection class (e.g., location is a required constraint on restaurants).
    • The name of a named entity in the parse that is an instance of the selection class, if there is one (e.g., a specific restaurant or movie name.)
    • Is this a follow-up refinement or the beginning of a conversation? (Reset starts a new conversation.)
    • Which constraints in the parse are bound to values in the input that changed their values? In other words, which constraints were just changed by the latest input?
    • Is the selection class inferred or directly stated?
    • Sorted by quality, relevance, or proximity?
    • For each constraint specified, how well was it matched?
    • Was refinement entered as text or clicking?


In one embodiment, the paraphrase algorithm accounts for the query, domain model 1056, and the service results. Domain model 1056 contains classes and features including metadata that is used to decide how to generate text. Examples of such metadata for paraphrase generation include:

    • IsConstraint={true|false}
    • IsMultiValued={true|false}
    • ConstraintType={EntityName, Location, Time, CategoryConstraint, AvailabilityConstraint, BinaryConstraint, SearchQualifier, GuessedQualifier}
    • DisplayName=string
    • DisplayTemplateSingular=string
    • DisplayTemplatePlural=string
    • GrammaticalRole={AdjectiveBeforeNoun,Noun,ThatClauseModifer}


For example, a parse might contain these elements:

    • Class: Restaurant
    • IsConstraint=false
    • DisplayTemplateSingular=“restaurant”
    • DisplayTemplatePlural=“restaurants”
    • GrammaticalRole=Noun
    • Feature: RestaurantName (example: “Il Formaio”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=EntityName
    • DisplayTemplateSingular=“named $1”
    • DisplayTemplatePlural=“named $1”
    • GrammaticalRole=Noun
    • Feature: RestaurantCuisine (example: “Chinese”)
    • IsConstraint=true
    • IsMultiValued=false
      • ConstraintType=CategoryConstraint
    • GrammaticalRole=AdjectiveBeforeNoun
    • Feature: RestaurantSubtype (example: “café”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=CategoryConstraint
    • DisplayTemplateSingular=“$1”
    • DisplayTemplatePlural=“$1s”
    • GrammaticalRole=Noun
    • Feature: RestaurantQualifiers (example: “romantic”)
    • IsConstraint=true
    • IsMultiValued=true
    • ConstraintType=SearchQualifier
    • DisplayTemplateSingular=“is described as $1”
    • DisplayTemplatePlural=“are described as $1”
    • DisplayTemplateCompact=“matching $1”
    • GrammaticalRole=Noun
    • Feature: FoodType (example: “burritos”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=SearchQualifier
    • DisplayTemplateSingular=“serves $1”
    • DisplayTemplatePlural=“serve $1”
    • DisplayTemplateCompact=“serving $1”
    • GrammaticalRole=ThatClauseModifer
    • Feature: IsRecommended (example: true)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=BinaryConstraint
    • DisplayTemplateSingular=“recommended”
    • DisplayTemplatePlural=“recommended”
    • GrammaticalRole=AdjectiveBeforeNoun
    • Feature: RestaurantGuessedQualifiers (example: “spectacular”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=GuessedQualifier
    • DisplayTemplateSingular=“matches $1 in reviews”
    • DisplayTemplatePlural=“match $1 in reviews”
    • DisplayTemplateCompact=“matching $1”
    • GrammaticalRole=ThatClauseModifer


In one embodiment, assistant 1002 is able to handle unmatched input. To handle such input, domain model 1056 can provide for nodes of type GuessedQualifier for each selection class, and rules that match otherwise unmatched words if they are in the right grammatical context. That is, GuessedQualifiers are treated as miscellaneous nodes in the parse which match when there are words that are not found in the ontology but which are in the right context to indicate that that are probably qualifiers of the selection class. The difference between GuessedQualifiers and SearchQualifiers is that the latter are matched to vocabulary in the ontology. This distinction allows us to paraphrase that assistant 1002 identified the intent solidly on the SearchQualifiers and can be more hesitant when echoing back the GuessedQualifiers.


In one embodiment, assistant 1002 performs the following steps when generating paraphrase text:

    • 1. If the task is unknown, explain what assistant 1002 can do and prompt for more input.
    • 2. If the task is a constrained selection task and the location is known, then explain the domains that assistant 1002 knows and prompt for the selection class.
    • 3. If the selection class is known but a required constraint is missing, then prompt for that constraint. (for example, location is required for constrained selection on restaurants)
    • 4. If the input contains an EntityName of the selection class, then output “looking up”<name> in <location>.
    • 5. If this is the initial request in a conversation, then output “looking for” followed by the complex noun phrase that describes the constraints.
    • 6. If this is a follow-up refinement step in the dialog,
      • a. If the user just completed a required input, then output “thanks” and then paraphrase normally. (This happens when there is a required constraint that is mapped to the user input.)
      • b. If the user is changing a constraint, acknowledge this and then paraphrase normally.
      • c. If the user typed in the proper name of an instance of the selection class, handle this specially.
      • d. If the user just added an unrecognized phrase, then indicate how it will be folded in as search. If appropriate, the input may be dispatched to a search service.
      • e. If the user is just adding a normal constraint, then output “OK”, and paraphrase normally.
    • 7. To explain results, use the same approach for paraphrase. However, when the results are surprising or unexpected, then explain the results using knowledge about the data and service. Also, when the query is over- or underconstrained, prompt for more input.


      Grammar for Constructing Complex Noun Phrases


In one embodiment, when paraphrasing 734 a constrained selection task query, the foundation is a complex noun phrase around the selection class that refers to the current constraints. Each constraint has a grammatical position, based on its type. For example, in one embodiment, assistant 1002 may construct a paraphrase such as:

    • recommended romantic Italian restaurants near Menlo Park with open tables for 2 that serve osso buco and are described as “quiet”


A grammar to construct this is

  • <paraphraseNounClause> :==<binaryConstraint> <searchQualifier> <categoryConstraint> <itemNoun> <locationConstraint> <availabiltyConstraint> <adjectivalClauses>
  • <binaryConstraint> :==single adjective that indicates the presence or absence of a BinaryConstraint (e.g., recommended (best), affordable (cheap)) It is possible to list more than one in the same query.
  • <searchQualifier> :==a word or words that match the ontology for a qualifier of the selection class, which would be passed into a search engine service. (e.g., romantic restaurants, funny movies).
  •  Use when ConstraintType=SearchQualifier.
  • <categoryConstraint> :==an adjective that identifies the genre, cuisine, or category of the selection class (e.g., Chinese restaurant or R-rated file). It is the last prefix adjective because it is the most intrinsic. Use for features of type CategoryConstraint and GrammaticalRole=AcljectiveBeforeNoun.
  • <itemNoun> :==<namedEntityPhrase>|<selectionClass>|<selectionClassSubType> find the most specific way to display the noun. NamedEntity<SubType<Class
  • <selectionClass> :==a noun that is the generic name for the selection class (e.g., restaurant, movie, place)
  • <selectionClassSubType> :==a noun phrase that is the subtype of the selection class if it is known (e.g., diner, museum, store, bar for the selection class local business). Use for features in which ConstraintType=CategoryConstraint and GrammaticalRole=AdjectiveBeforeNoun.
  • <namedEntityPhrase> :==<entityName>|“the” (<selectionClass>|<selectionClassSubType>)<
  • entityName> :==the proper name of an instance of the selection class (e.g., “Il Fornaio” “Animal House” “Harry's Bar”)
  • <locationConstraint> :==<locationPreposition> <locationName>
  • <locationPreposition> :==“in”, “near”, “at”, and the like
  • <locationName> :==city, street address, landmark, or something for GPS like “your current location”
  • <availabilityConstraint> :==the availability constraint expressed as a prepositional phrase that comes after the noun (e.g., “with open tables”, “with seats available”, “available online”). It comes right after the noun to give it salience.
  • <adjectivalClauses> :==<modiferVerbPhrase>|“that”<modiferVerbPhrase>“and”<modiferVerbPhrase>
  • <modiferVerbPhrase>:=a verb phrase that expresses a search-keyword style constraint on the selection class (e.g., restaurants that “are described as quiet”, “serve meat after 11”, “match ‘tragically hip’ in reviews”; movies that “contain violence”, “star Billy Bob Thornton”). Include all constraints in the parse whose GrammaticalRole=ThatClauseModifer, using the “that . . . and” variant if there are more than one. Use the DisplayTemplatePlural to generate the “that” clauses, putting the GuessedQualifier last. If there is only one such constraint, use the DisplayTemplateCompact variant.


Table 1 provides some examples of paraphrases that may be provided in response to the first input for a task, according to one embodiment.









TABLE 1







Paraphrases in response to first input








Input
Initial Paraphrase





tie house
Sorry, I don't understand “tie house.” I know



about restaurants, hotels, and other




local businesses, flights, weather, and buying things




online. What are you looking for, and where?


palo alto
I can help you find restaurants, businesses, events,



and things to do in Palo Alto. What are you



looking for?


food
Looking for a place to eat? Where? (examples)


Italian food
I can tell you about Italian restaurants in your area.




Where would you like to eat?



burrito
I can help you find places that serve burritos in



your area. Where would you like to eat?


best mexican food
I can help you find good Mexican restaurants in



your area. Where are you?


restaurants palo alto
Looking for restaurants near Palo Alto.


Italian palo alto
Looking for Italian restaurants near Palo Alto.


thai food in menlo park
Looking for Thai restaurants near Menlo Park


indonesian food in menlo park
Looking for Indonesian restaurants near




Menlo Park



best mexican food in Palo Alto
Looking for recommended Mexican restaurants



near Palo Alto.


fast food menlo park
Looking for fast food restaurants near Menlo Park


healthy food in menlo park
Looking for places near Menlo Park that serve




healthy food.



dive bar in menlo park
Looking for dive bars near Menlo Park.


pool room in menlo park
Looking for pool rooms near Menlo Park.


hookah room in menlo park
Looking for places near Menlo Park described as



“hookah room”.


spicy food in sf
Looking for places near Menlo Park that serve




spicy food.



burgers in Menlo park
Looking for places near Menlo Park that serve




burgers.



belly dancing place in sf
Looking for places near San Francisco described



as “belly dancing”.


belly dancing place in menlo park
Looking for places near Menlo Park described as



“belly dancing”.


juke joint in sf
Looking for joints near San Francisco described as



“juke”.


tie house Menlo park
Looking for places near Menlo Park described as



“tie house”.


thai house palo alto
Looking up Thai House in Palo Alto


il fornaio menlo park
Looking up Il Fornaio in Palo Alto


il fornao in Menlo park
Looking for places near Palo Alto described as “il



fornao”.


cliff house in Menlo park
Looking up Cliff House in Palo Alto


romantic restaurant in palo alto
Looking for romantic restaurants in Palo Alto


romantic restaurant in palo alto
Looking for romantic restaurants in Palo Alto


quiet romantic restaurant in palo
Looking for romantic restaurants in Palo Alto


alto
described as “quiet”


quiet romantic restaurant in palo
Looking for romantic restaurants in Palo Alto


alto
described as “quiet


tragically hip restaurant in palo
Looking for restaurants in Palo Alto described as


alto
“tragically hip”


tragically hip restaurant in palo
Looking for restaurants in Palo Alto described as


alto
“tragically hip”


table for two tonight in palo alto
Checking availability for tonight at restaurants



near Palo Alto.


table for two italian food tonight in
Checking availability for tonight at Italian


palo alto
restaurants near Palo Alto.


il fornaio palo alto 6pm for 2
Checking availability for tables tonight at




Il Fornaio in Palo Alto.



table for 2 at thai house in PA
Checking availability for tables tonight at




Thai House in Palo Alto.



pizza delivery in menlo park



I want the best quiet romantic
OK, looking for recommended romantic italian


italian restaurant for osso buco in
restaurants near Menlo Park that serve osso buco


or near menlo park
and are described as “quiet”.


Book me a table for 2 at the best
OK, looking for recommended romantic italian


quiet romantic italian restaurant for
restaurants near Menlo Park with open tables for 2


osso buco in or near menlo park
that serve osso buco and are described as “quiet”.










Refining a Query about Places to Eat


Table 2 provides some examples of paraphrases in response to a situation where user's intent to find a place to eat is known, but they have not selected a particular place to eat. They are facing a list of restaurants, and they provide refinements.









TABLE 2





Paraphrases in response to refinements


Refinements
















menlo park (was unknown)
Thanks, now looking for restaurants



in Menlo Park.


cheapest
OK, looking for affordable restaurants



near Menlo Park.


chinese (was italian)
OK, changing cuisine to Chinese. Looking



for Chinese restaurants near Menlo Park.


pizza (adding food item)
OK, looking for Italian restaurants near




Menlo Park that serve pizza.



san francisco
OK, changing location to San Francisco.


(was menlo park)
Looking for Italian restaurants near




San Francisco that serve pizza.



tragically hip
OK, I'll search reviews for



“tragically hip”.


quiet romantic
OK, looking for romantic restaurants



in Palo Alto described as “quiet”


cliff house
Cliff House sounds familiar. I'll look



it up in Palo Alto.









Table 3 provides some examples of results summaries that are provided once results are obtained.









TABLE 3







Results Summaries









Input
# Results
Results Summary





tie house
N/A
N/A (no call to services)


palo alto
N/A
N/A (no call to services)


food
N/A
N/A (no call to services)


Italian food
N/A
N/A (no call to services)


burrito
N/A
N/A (no call to services)


best mexican food
N/A
N/A (no call to services)


restaurants palo alto
many
Here are some recommended restaurants near





Palo Alto. Do you prefer any particular food type?





Would you like a reservation?


Italian palo alto
some
Here are some Italian restaurants near Palo Alto. To




reserve a table, click on available times.


thai food in menlo park
some
Here are some Thai restaurants near Menlo Park. To




reserve a table, click on available times.


indonesian food in
0
Sorry, I can't find any Indonesian restaurants near


menlo park


Menlo Park. You could try other cuisines or






locations.



best mexican food in
some
Here are some recommended Mexican restaurants


Palo Alto

near Palo Alto.


fast food menlo park
some
OK, here are some fast food restaurants near





Menlo Park.



healthy food in menlo
some
Here are some places near Menlo Park that might


park

serve healthy food, based on reviews.


dive bar in menlo park
some
Here are some bars near Menlo Park. I don't see




anything specific to “dive bar.” Are there other




ways of saying it?


pool room in menlo park
some
Here are some places in Menlo Park that are




described as pool rooms. You can add other words




to describe what you want.


hookah room in menlo
0
I can't find places Menlo Park matching “hookah


park

room”. Interested in restaurants, hotels, or





local businesses?



spicy food in sf
weak match
Here are some places to eat in San Francisco. I




don't know which serve spicy food. Could it go by




another name?


burgers in Menlo park
some
You might find burgers at these places to eat near





Menlo Park.



belly dancing place in sf
some
Here are some places in Menlo Park that are




described as “belly dancing”. You can add other




words to describe what you want.


belly dancing place in
0
I can help you find restaurants, businesses, events,


menlo park

and things to do in San Francisco. What are some




other words for “belly dancing place”?


juke joint in sf
0
I can help you find restaurants, businesses, events,




and things to do in San Francisco. What are some




other words for “juke joint”?


tie house Menlo park
0
Sorry, I don't know about “tie house” in





Menlo Park. Any other names for it?



thai house palo alto
1
Got it: Thai House restaurant in Palo Alto, CA.




Want to reserve a table? When and for how many?


il fornaio menlo park
weak match
There is a Il Fornaio restaurant in Palo Alto, which




is near Menlo Park.


il fornao in Menlo park
spell match
Did you mean Il Fornaio in Palo Alto? If not, try




different words.


cliff house in Menlo
0
I couldn't find Cliff House in Palo Alto. Could it go


park

by a different name or be in a different city?


romantic restaurant in
some
Here are some restaurants near Palo Alto that are


palo alto

described in reviews as romantic.


romantic restaurant in
0
Here are restaurants near Palo Alto. Searching


palo alto

reviews did not find any described as romantic. Any




other preferences?


quiet romantic restaurant
some
Here are some restaurants near Palo Alto that match


in palo alto

“quiet romantic” in reviews.


quiet romantic restaurant
0
Here are some restaurants near Palo Alto. Searching


in palo alto

reviews did not find any matching “quiet romantic”.




Any other preferences?


tragically hip restaurant
some
Here are some restaurants near Palo Alto that match


in palo alto

“tragically hip” in reviews.


tragically hip restaurant
0
Here are some restaurants near Palo Alto. Searching


in palo alto

reviews did not find any matching “tragically hip”.




Any other preferences?


table for two tonight in
some
Here are restaurants with open tables from 6 pm to


palo alto


8 pm tonight for a party of two in Palo Alto, CA.



table for two italian food
some
Here are restaurants with open tables from 6 pm to


tonight in palo alto


8 pm tonight for a party of two in Palo Alto, CA.



il fornaio palo alto 6pm
1
Here are table options at Il Fornaio restaurant in


for 2


Palo Alto, CA at 6 pm today for a party of 2.



table for 2 at thai house
1
Here is the information for Thai House in Palo Alto, CA.


in PA

You can call them at the phone number listed.


pizza delivery in menlo

Here are places that serve pizza in menlo park. I do


park

not have delivery options at this time. Click on




restaurant phone numbers to call for delivery.


I want the best quiet
weak match,
Here are the best matches for recommended


romantic italian
sorted by

romantic italian restaurants near Menlo Park that



restaurant for osso buco
availability
serve osso buco and are described as “quiet”. Click


in or near menlo park

on available times to reserve a table.


Book me a table for 2 at
weak match,
Here are the best matches for recommended


the best quiet romantic
sorted by

romantic italian restaurants near Menlo Park with



italian restaurant for
availability

open tables for 2 that serve osso buco and are



osso buco in or near

described as “quiet”. Click on available times to


menlo park

reserve a table.


refinements




menlo park (was un-
some
Here are some recommended restaurants near


known)


Menlo Park. Do you prefer any particular food





type?


cheapest
some
I found 4 affordable restaurants near Menlo Park.


chinese (was italian)

I found 4 Chinese restaurants near Menlo Park.


pizza (adding food item)
some
I found 4 Italian restaurants near Menlo Park that




serve pizza.


san francisco (was
some
I found 4 Italian restaurants near San Francisco.


menlo park)




tragically hip
some
I found 4 restaurants near Palo Alto that match




“tragically hip” in reviews.


quiet romantic
some
Here are some restaurants near Palo Alto that match




“quiet romantic” in reviews.


cliff house
0
I couldn't find Cliff House in Palo Alto. Could it go




by a different name or be in a different city?









Table 4 provides some examples of prompts that are provided when users click on active links.


Prompts when Users Click on Active Links









TABLE 4







Prompts when users click on active links









Anchor Text
Prompt Text
Notes





Location, where
Enter a location: a city, zip code, or
This prompt might be used when



“near” followed by the name of a
the user has not specified a



place.
location yet.


Palo Alto
Enter a location such as a city,
This prompt might be used when



neighborhood, street address, or
the user is changing locations.



“near” followed by a landmark.



food type
Enter a food category such as
Merge food type and cuisine can



Chinese or Pizza.
be merged


Italian
You can try other food categories
User already said Italian.



such as Chinese, or a favorite food
Assistant 1002 is helping the



item such as steak.
user explore alternatives. If it is




a food item, it dominates over




cuisine.


reservation
Enter the day and time to reserve a
Prompting for a reservation



table, such as “tomorrow at 8”.



healthy food
You can also enter menu items or
Known food type



cuisines



spicy food
You can also enter menu items or
Unknown food type



cuisines



restaurants
What kind of restaurant? (e.g.,
Clicking on the restaurants link



Chinese, Pizza)
should insert the word




“restaurant” on the end of the




text input.


businesses
You can find local florists, ATMs,
Clicking on the businesses link



doctors, drug stores, and the like
should add to the machine



What kind of business are you
readable tag that this is a local



looking for?
search


events
You can discover upcoming converts,




shows, and the like What interests




you?



things to do
Music, art, theater, sports, and the




like What kind of thing would you




like to do in this area?



hotels
I can help you find an available hotel




room. Any preferences for amenities




or location?



weather
Enter a city, and I'll tell you what the
If location is known, just show



weather is like there.
the weather data


buying things
I can help you find music, movies,




books, electronics, toys, and more --




and buy it from Amazon. What are




you looking for?










Suggesting Possible Responses in a Dialog


In one embodiment, assistant 1002 provides contextual suggestions. Suggestions are a way for assistant 1002 to offer the user options to move forward from his or her current situation in the dialog. The set of suggestions offered by assistant 1002 depends on context, and the number of suggestions offered may depend on the medium and form factor. For example, in one embodiment, the most salient suggestions may be offered in line in the dialog, an extended list of suggestions (“more”) may be offered in a scrollable menu, and even more suggestions are reachable by typing a few characters and picking from autocomplete options. One skilled in the art will recognize that other mechanisms may be used for providing suggestions.


In various embodiments, different types of suggestions may be provided. Examples of suggestion types include:

    • options to refine a query, including adding or removing or changing constraint values;
    • options to repair or recover from bad situations, such as “not what I mean” or “start over” or “search the web”;
    • options to disambiguate among;
    • interpretations of speech;
    • interpretations of text, including spell correction and semantic ambiguity;
    • context-specific commands, such as “show these on a map” or “send directions to my date” or “explain these results”;
    • suggested cross-selling offers, such as next steps in meal or event planning scenarios;
    • options to reuse previous commands, or parts of them.


In various embodiments, the context that determines the most relevant suggestions may be derived from, for example:

    • dialog state
    • user state, including, for example:
      • static properties (name, home address, etc)
      • dynamic properties (location, time, network speed)
    • interaction history, including, for example:
      • query history
      • results history
      • the text that has been entered so far into autocomplete.


In various embodiments, suggestions may be generated by any mechanism, such as for example:

    • paraphrasing a domain, task, or constraint based on the ontology model;
    • prompting in autocomplete based on the current domain and constraints;
    • paraphrasing ambiguous alternative interpretations;
    • alternative interpretations of speech-to-text;
    • hand authoring, based on special dialog conditions.


According to one embodiment, suggestions are generated as operations on commands in some state of completion. Commands are explicit, canonical representations of requests, including assumptions and inferences, based on attempted interpretations on user input. In situations where the user input is incomplete or ambiguous, suggestions are an attempt to help the user adjust the input to clarify the command.


In one embodiment, each command is an imperative sentence having some combination of a

    • command verb (imperative such as “find” or “where is”);
    • domain (selection class such as “restaurants”);
    • constraint(s) such as location=Palo Alto and cuisine=Italian.


These parts of a command (verb, domain, constraints) correspond to nodes in the ontology.


A suggestion, then, may be thought of as operations on a command, such as setting it, changing it, or declaring that it is relevant or not relevant. Examples include:

    • setting a command verb or domain (“find restaurants”)
    • changing a command verb (“book it”, “map it”, “save it”)
    • changing a domain (“looking for a restaurant, not a local business”)
    • stating that a constraint is relevant (“try refining by cuisine”)
    • choosing a value for a constraint (“Italian”, “French”, and the like)
    • choosing a constraint and value together (“near here”, “tables for 2”)
    • stating that a constraint value is wrong (“not that Boston”)
    • stating that a constraint is not relevant (“ignore the expense”)
    • stating the intent to change a constraint value (“try a different location”)
    • changing a constraint value (“Italian, not Chinese”)
    • adding to a constraint value (“and with a pool, too”)
    • snapping a value to grid (“Los Angeles, not los angelos”)
    • initiating a new command, reusing context ([after movies] “find nearby restaurants”, “send directions to my friend”)
    • initiating a command that is “meta” to context (“explain these results”)
    • initiating a new command, resetting or ignoring context (“start over”, “help with speech”)


A suggestion may also involve some combination of the above. For example:

    • “the movie Milk not [restaurants serving] the food item milk”
    • “restaurants serving pizza, not just pizza joints”
    • “The place called Costco in Mountain View, I don't care whether you think it is a restaurant or local business”
    • “Chinese in Mountain View” [a recent query]


In one embodiment, assistant 1002 includes a general mechanism to maintain a list of suggestions, ordered by relevance. The format in which a suggestion is offered may differ depending on current context, mode, and form factor of the device.


In one embodiment, assistant 1002 determines which constraints to modify by considering any or all of the following factors:

    • Consider whether the constraint has a value;
    • Consider whether the constraint was inferred or explicitly stated;
    • Consider its salience (suggestionIndex).


In one embodiment, assistant 1002 determines an output format for the suggestion. Examples of output formats include:

    • change domain:
      • if autocomplete option “find restaurants”, then “try something different”
      • else [was inferred] “not looking for restaurants”
    • change name constraint:
      • if name was inferred, offer alternative ambiguous interpretation”
      • stuff into autocomplete the entity names from current results
      • different name
      • consider that it wasn't a name lookup (remove constraint)—maybe offer category in place of it
    • “not named”
    • “not in Berkeley”
    • “some other day”
    • not that sense of (use ambiguity alternatives)
    • inferred date: “any day, I don't need a reservation”


In one embodiment, assistant 1002 attempts to resolve ambiguities via suggestions. For example, if the set of current interpretations of user intent is too ambiguous 310, then suggestions are one way to prompt for more information 322. In one embodiment, for constrained selection tasks, assistant 1002 factors out common constraints among ambiguous interpretations of intent 290 and presents the differences among them to the user. For example, if the user input includes the word “café” and this word could match the name of a restaurant or the type of restaurant, then assistant 1002 can ask “did you mean restaurants named ‘café’ or ‘café restaurants’?”


In one embodiment, assistant 1002 infers constraints under certain situations. That is, for constrained selection tasks, not all constraints need be mentioned explicitly in the user input; some can be inferred from other information available in active ontology 1050, short term personal memory 1052, and/or other sources of information available to assistant 1002. For example:

    • Inferring domain or location
    • Default assumption, like location
    • Weakly matched constraint (fuzzy, low salience location, etc)
    • Ambiguous criteria (match to constraint value without prefix (name vs. category, often ambiguous)


In cases where the assistant 1002 infers constraint values, it may also offer these assumptions as suggestions for the user to overrule. For example, it might tell the user “I assumed you meant around here. Would you like to look at a different location?”


The present invention has been described in particular detail with respect to possible embodiments. Those of skill in the art will appreciate that the invention may be practiced in other embodiments. First, the particular naming of the components, capitalization of terms, the attributes, data structures, or any other programming or structural aspect is not mandatory or significant, and the mechanisms that implement the invention or its features may have different names, formats, or protocols. Further, the system may be implemented via a combination of hardware and software, as described, or entirely in hardware elements, or entirely in software elements. Also, the particular division of functionality between the various system components described herein is merely exemplary, and not mandatory; functions performed by a single system component may instead be performed by multiple components, and functions performed by multiple components may instead be performed by a single component.


In various embodiments, the present invention can be implemented as a system or a method for performing the above-described techniques, either singly or in any combination. In another embodiment, the present invention can be implemented as a computer program product comprising a non-transitory computer readable storage medium and computer program code, encoded on the medium, for causing a processor in a computing device or other electronic device to perform the above-described techniques.


Reference in the specification to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.


Some portions of the above are presented in terms of algorithms and symbolic representations of operations on data bits within a memory of a computing device. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps (instructions) leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical signals capable of being stored, transferred, combined, compared and otherwise manipulated. It is convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. Furthermore, it is also convenient at times, to refer to certain arrangements of steps requiring physical manipulations of physical quantities as modules or code devices, without loss of generality.


It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “displaying” or “determining” or the like, refer to the action and processes of a computer system, or similar electronic computing module and/or device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.


Certain aspects of the present invention include process steps and instructions described herein in the form of an algorithm. It should be noted that the process steps and instructions of the present invention can be embodied in software, firmware and/or hardware, and when embodied in software, can be downloaded to reside on and be operated from different platforms used by a variety of operating systems.


The present invention also relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computing device selectively activated or reconfigured by a computer program stored in the computing device. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, application specific integrated circuits (ASICs), or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Further, the computing devices referred to herein may include a single processor or may be architectures employing multiple processor designs for increased computing capability.


The algorithms and displays presented herein are not inherently related to any particular computing device, virtualized system, or other apparatus. Various general-purpose systems may also be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will be apparent from the description provided herein. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any references above to specific languages are provided for disclosure of enablement and best mode of the present invention.


Accordingly, in various embodiments, the present invention can be implemented as software, hardware, and/or other elements for controlling a computer system, computing device, or other electronic device, or any combination or plurality thereof. Such an electronic device can include, for example, a processor, an input device (such as a keyboard, mouse, touchpad, trackpad, joystick, trackball, microphone, and/or any combination thereof), an output device (such as a screen, speaker, and/or the like), memory, long-term storage (such as magnetic storage, optical storage, and/or the like), and/or network connectivity, according to techniques that are well known in the art. Such an electronic device may be portable or nonportable. Examples of electronic devices that may be used for implementing the invention include: a mobile phone, personal digital assistant, smartphone, kiosk, desktop computer, laptop computer, tablet computer, consumer electronic device, consumer entertainment device; music player; camera; television; set-top box; electronic gaming unit; or the like. An electronic device for implementing the present invention may use any operating system such as, for example, iOS or MacOS, available from Apple Inc. of Cupertino, Calif., or any other operating system that is adapted for use on the device.


While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of the above description, will appreciate that other embodiments may be devised which do not depart from the scope of the present invention as described herein. In addition, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the claims.

Claims
  • 1. A method for operating an intelligent automated assistant, comprising: at an electronic device comprising a processor and memory storing instructions for execution by the processor: receiving a user request, the user request including at least a speech input received from a user, wherein the speech input includes at least one value of at least one parameter; andpresenting to the user an echo of the speech input based on a textual interpretation of the speech input;determining a task to be performed by the electronic device, from a plurality of tasks performable by the electronic device, wherein the task is determined by performing natural language processing on the speech input; andpresenting to the user a paraphrase of the task, including a natural language formulation of the task and the at least one value of the at least one parameter.
  • 2. The method of claim 1, wherein a respective sentence used in the paraphrase is tailored to a respective modality used to present the paraphrase to the user, and wherein a more verbose sentence is used in the paraphrase when the paraphrase is to be presented in audible form than when the paraphrase is to be presented in written form.
  • 3. The method of claim 1, wherein the echo includes one or more first words and the paraphrase includes one or more second words, and wherein the one or more second words represent a respective semantic interpretation of the one or more first words and associate the one or more first words with a concept of a respective domain among a plurality of predefined domains.
  • 4. The method of claim 1, wherein the echo and the paraphrase are presented on a conversation screen, and wherein the paraphrase includes the at least one value of the at least one parameter presented in a highlighted format.
  • 5. The method of claim 1, wherein the paraphrase indicates a real-time progress of the task.
  • 6. The method of claim 1, wherein the paraphrase provides a summary of a result set, and wherein the paraphrase is presented in addition to the result set.
  • 7. The method of claim 1, wherein the paraphrase specifies multiple selection criteria derived from the user request, and indicates that no result meeting all of the multiple selection criteria have been found, and wherein the paraphrase specifies a relaxed form of the multiple selection criteria and presents a summary of results obtained based on the relaxed form of the multiple selection criteria.
  • 8. The method of claim 1, further comprising presenting to the user, concurrently with the paraphrase of the task, a result set generated as a result of performing the task.
  • 9. The method of claim 1, wherein presenting the paraphrase of the task includes presenting a real-time progress of the task, the method further comprising: retrieving a result set;ceasing to present the paraphrase of the task; andafter ceasing to present the paraphrase of the task, presenting a summary of a result set, wherein the summary of the result set includes a natural language formulation of the task and the least one value of the at least one parameter.
  • 10. The method of claim 1, wherein the echo of the speech input is presented visually, and the paraphrase is presented via speech output.
  • 11. The method of claim 10, wherein the echo of the speech input is not presented via speech output, and the paraphrase is presented visually.
  • 12. The method of claim 10, further comprising visually presenting a result set generated as a result of the performance of the task.
  • 13. A system for operating an intelligent automated assistant, comprising: one or more processors; andmemory having instructions stored thereon, the instructions, when executed by the one or more processors, cause the processors to perform operations comprising: receiving a user request, the user request including at least a speech input received from a user, wherein the speech input includes at least one value of at least one parameter; andpresenting to the user an echo of the speech input based on a textual interpretation of the speech inputdetermining a task to be performed by the electronic device, from a plurality of tasks performable by the electronic device, wherein the task is determined by performing natural language processing on the speech input; andpresenting to the user a paraphrase of the task, including a natural language formulation of the task and the at least one value of the at least one parameter.
  • 14. The system of claim 13, wherein a respective sentence used in the paraphrase is tailored to a respective modality used to present the paraphrase to the user, and wherein a more verbose sentence is used in the paraphrase when the paraphrase is to be presented in audible form than when the paraphrase is to be presented in written form.
  • 15. The system of claim 13, wherein the echo includes one or more first words and the paraphrase includes one or more second words, and wherein the one or more second words represent a respective semantic interpretation of the one or more first words and associate the one or more first words with a concept of a respective domain among a plurality of predefined domains.
  • 16. The system of claim 13, wherein the echo and the paraphrase are presented on a conversation screen, and wherein the paraphrase includes the at least one value of the at least one parameter presented in a highlighted format.
  • 17. The system of claim 13, wherein the paraphrase indicates a real-time progress of the task.
  • 18. The system of claim 13, wherein the paraphrase provides a summary of a result set, and wherein the paraphrase is presented in addition to the result set.
  • 19. The system of claim 13, wherein the paraphrase specifies multiple selection criteria derived from the user request, and indicates that no result meeting all of the multiple selection criteria have been found, and wherein the paraphrase specifies a relaxed form of the multiple selection criteria and presents a summary of results obtained based on the relaxed form of the multiple selection criteria.
  • 20. The system of claim 13, the operations further comprising presenting to the user, concurrently with the paraphrase of the task, a result set generated as a result of performing the task.
  • 21. The system of claim 13, wherein presenting the paraphrase of the task includes presenting a real-time progress of the task, the method further comprising: retrieving a result set;ceasing to present the paraphrase of the task; andafter ceasing to present the paraphrase of the task, presenting a summary of a result set, wherein the summary of the result set includes a natural language formulation of the task and the least one value of the at least one parameter.
  • 22. A non-transitory computer readable storage medium having instructions stored thereon, the instructions, when executed by one or more processors, cause the processors to perform operations comprising: receiving a user request, the user request including at least a speech input received from a user, wherein the speech input includes at least one value of at least one parameter; andpresenting to the user an echo of the speech input based on a textual interpretation of the speech input;determining a task to be performed by the electronic device, from a plurality of tasks performable by the electronic device, wherein the task is determined by performing natural language processing on the speech input; andpresenting to the user a paraphrase of the task, including a natural language formulation of the task and the at least one value of the at least one parameter.
  • 23. The computer readable storage medium of claim 22, wherein a respective sentence used in the paraphrase is tailored to a respective modality used to present the paraphrase to the user, and wherein a more verbose sentence is used in the paraphrase when the paraphrase is to be presented in audible form than when the paraphrase is to be presented in written form.
  • 24. The computer readable storage medium of claim 22, wherein the echo includes one or more first words and the paraphrase includes one or more second words, and wherein the one or more second words represent a respective semantic interpretation of the one or more first words and associate the one or more first words with a concept of a respective domain among a plurality of predefined domains.
  • 25. The computer readable storage medium of claim 22, wherein the echo and the paraphrase are presented on a conversation screen, and wherein the paraphrase includes the at least one value of the at least one parameter presented in a highlighted format.
  • 26. The computer readable storage medium of claim 22, wherein the paraphrase indicates a real-time progress of the task.
  • 27. The computer readable storage medium of claim 22, wherein the paraphrase provides a summary of a result set, and wherein the paraphrase is presented in addition to the result set.
  • 28. The computer readable storage medium of claim 22, wherein the paraphrase specifies multiple selection criteria derived from the user request, and indicates that no result meeting all of the multiple selection criteria have been found, and wherein the paraphrase specifies a relaxed form of the multiple selection criteria and presents a summary of results obtained based on the relaxed form of the multiple selection criteria.
  • 29. The computer readable storage medium of claim 22, the operations further comprising presenting to the user, concurrently with the paraphrase of the task, a result set generated as a result of performing the task.
  • 30. The computer readable storage medium of claim 22, wherein presenting the paraphrase of the task includes presenting a real-time progress of the task, the method further comprising: retrieving a result set;ceasing to present the paraphrase of the task; andafter ceasing to present the paraphrase of the task, presenting a summary of a result set, wherein the summary of the result set includes a natural language formulation of the task and the least one value of the at least one parameter.
CROSS-REFERENCE TO RELATED APPLICATIONS

This is a continuation of U.S. application Ser. No. 12/987,982, filed Jan. 10, 2011, entitled “Intelligent Automated Assistant,” which application claims priority from U.S. Provisional Patent Application Ser. No. 61/295,774, filed Jan. 18, 2010, which are incorporated herein by reference in their entirety.

US Referenced Citations (2747)
Number Name Date Kind
1559320 Hirsh Oct 1925 A
2180522 Henne Nov 1939 A
3704345 Coker et al. Nov 1972 A
3710321 Rubenstein Jan 1973 A
3828132 Flanagan et al. Aug 1974 A
3979557 Schulman et al. Sep 1976 A
4013085 Wright Mar 1977 A
4081631 Feder Mar 1978 A
4090216 Constable May 1978 A
4107784 Van Bemmelen Aug 1978 A
4108211 Tanaka Aug 1978 A
4159536 Kehoe et al. Jun 1979 A
4181821 Pirz et al. Jan 1980 A
4204089 Key et al. May 1980 A
4241286 Gordon Dec 1980 A
4253477 Eichman Mar 1981 A
4278838 Antonov Jul 1981 A
4282405 Taguchi Aug 1981 A
4310721 Manley et al. Jan 1982 A
4332464 Bartulis et al. Jun 1982 A
4348553 Baker et al. Sep 1982 A
4384169 Mozer et al. May 1983 A
4386345 Narveson et al. May 1983 A
4433377 Eustis et al. Feb 1984 A
4451849 Fuhrer May 1984 A
4485439 Rothstein Nov 1984 A
4495644 Parks et al. Jan 1985 A
4513379 Wilson et al. Apr 1985 A
4513435 Sakoe et al. Apr 1985 A
4555775 Pike Nov 1985 A
4577343 Oura Mar 1986 A
4586158 Brandle Apr 1986 A
4587670 Levinson et al. May 1986 A
4589022 Prince et al. May 1986 A
4611346 Bednar et al. Sep 1986 A
4615081 Lindahl Oct 1986 A
4618984 Das et al. Oct 1986 A
4642790 Minshull et al. Feb 1987 A
4653021 Takagi Mar 1987 A
4654875 Srihari et al. Mar 1987 A
4655233 Laughlin Apr 1987 A
4658425 Julstrom Apr 1987 A
4670848 Schramm Jun 1987 A
4677570 Taki Jun 1987 A
4680429 Murdock et al. Jul 1987 A
4680805 Scott Jul 1987 A
4688195 Thompson et al. Aug 1987 A
4692941 Jacks et al. Sep 1987 A
4698625 McCaskill et al. Oct 1987 A
4709390 Atal et al. Nov 1987 A
4713775 Scott et al. Dec 1987 A
4718094 Bahl et al. Jan 1988 A
4724542 Williford Feb 1988 A
4726065 Froessl Feb 1988 A
4727354 Lindsay Feb 1988 A
4736296 Katayama et al. Apr 1988 A
4750122 Kaji et al. Jun 1988 A
4754489 Bokser Jun 1988 A
4755811 Slavin et al. Jul 1988 A
4776016 Hansen Oct 1988 A
4783804 Juang et al. Nov 1988 A
4783807 Marley Nov 1988 A
4785413 Atsumi Nov 1988 A
4790028 Ramage Dec 1988 A
4797930 Goudie Jan 1989 A
4802223 Lin et al. Jan 1989 A
4803729 Baker Feb 1989 A
4807752 Chodorow Feb 1989 A
4811243 Racine Mar 1989 A
4813074 Marcus Mar 1989 A
4819271 Bahl et al. Apr 1989 A
4827518 Feustel et al. May 1989 A
4827520 Zeinstra May 1989 A
4829576 Porter May 1989 A
4829583 Monroe et al. May 1989 A
4831551 Schalk et al. May 1989 A
4833712 Bahl et al. May 1989 A
4833718 Sprague May 1989 A
4837798 Cohen et al. Jun 1989 A
4837831 Gillick et al. Jun 1989 A
4839853 Deerwester et al. Jun 1989 A
4852168 Sprague Jul 1989 A
4862504 Nomura Aug 1989 A
4875187 Smith Oct 1989 A
4878230 Murakami et al. Oct 1989 A
4887212 Zamora et al. Dec 1989 A
4896359 Yamamoto et al. Jan 1990 A
4903305 Gillick et al. Feb 1990 A
4905163 Garber et al. Feb 1990 A
4908867 Silverman Mar 1990 A
4914586 Swinehart et al. Apr 1990 A
4914590 Loatman et al. Apr 1990 A
4918723 Iggulden et al. Apr 1990 A
4926491 Maeda et al. May 1990 A
4928307 Lynn May 1990 A
4935954 Thompson et al. Jun 1990 A
4939639 Lee et al. Jul 1990 A
4941488 Marxer et al. Jul 1990 A
4944013 Gouvianakis et al. Jul 1990 A
4945504 Nakama et al. Jul 1990 A
4953106 Gansner et al. Aug 1990 A
4955047 Morganstein et al. Sep 1990 A
4965763 Zamora Oct 1990 A
4972462 Shibata Nov 1990 A
4974191 Amirghodsi et al. Nov 1990 A
4975975 Filipski Dec 1990 A
4977598 Doddington et al. Dec 1990 A
4980916 Zinser Dec 1990 A
4985924 Matsuura Jan 1991 A
4992972 Brooks et al. Feb 1991 A
4994966 Hutchins Feb 1991 A
4994983 Landell et al. Feb 1991 A
5003577 Ertz et al. Mar 1991 A
5007095 Nara et al. Apr 1991 A
5007098 Kumagai Apr 1991 A
5010574 Wang Apr 1991 A
5016002 Levanto May 1991 A
5020112 Chou May 1991 A
5021971 Lindsay Jun 1991 A
5022081 Hirose et al. Jun 1991 A
5027110 Chang et al. Jun 1991 A
5027406 Roberts et al. Jun 1991 A
5027408 Kroeker et al. Jun 1991 A
5029211 Ozawa Jul 1991 A
5031217 Nishimura Jul 1991 A
5032989 Tornetta Jul 1991 A
5033087 Bahl et al. Jul 1991 A
5040218 Vitale et al. Aug 1991 A
5046099 Nishimura Sep 1991 A
5047614 Bianco Sep 1991 A
5050215 Nishimura Sep 1991 A
5053758 Cornett et al. Oct 1991 A
5054084 Tanaka et al. Oct 1991 A
5057915 Kohorn et al. Oct 1991 A
5067158 Arjmand Nov 1991 A
5067503 Stile Nov 1991 A
5072452 Brown et al. Dec 1991 A
5075896 Wilcox et al. Dec 1991 A
5079723 Herceg et al. Jan 1992 A
5083119 Trevett et al. Jan 1992 A
5083268 Hemphill et al. Jan 1992 A
5086792 Chodorow Feb 1992 A
5090012 Kajiyama et al. Feb 1992 A
5091790 Silverberg Feb 1992 A
5091945 Kleijn Feb 1992 A
5103498 Lanier et al. Apr 1992 A
5109509 Katayama et al. Apr 1992 A
5111423 Kopec, Jr. et al. May 1992 A
5119079 Hube et al. Jun 1992 A
5122951 Kamiya Jun 1992 A
5123103 Ohtaki et al. Jun 1992 A
5125022 Hunt et al. Jun 1992 A
5125030 Nomura et al. Jun 1992 A
5127043 Hunt et al. Jun 1992 A
5127053 Koch Jun 1992 A
5127055 Larkey Jun 1992 A
5128672 Kaehler Jul 1992 A
5133011 McKiel, Jr. Jul 1992 A
5133023 Bokser Jul 1992 A
5142584 Ozawa Aug 1992 A
5148541 Lee et al. Sep 1992 A
5153913 Kandefer et al. Oct 1992 A
5157610 Asano et al. Oct 1992 A
5161102 Griffin et al. Nov 1992 A
5164900 Bernath Nov 1992 A
5164982 Davis Nov 1992 A
5165007 Bahl et al. Nov 1992 A
5167004 Netsch et al. Nov 1992 A
5175536 Aschliman et al. Dec 1992 A
5175803 Yeh Dec 1992 A
5175814 Anick et al. Dec 1992 A
5179627 Sweet et al. Jan 1993 A
5179652 Rozmanith et al. Jan 1993 A
5194950 Murakami et al. Mar 1993 A
5195034 Garneau et al. Mar 1993 A
5195167 Bahl et al. Mar 1993 A
5197005 Shwartz et al. Mar 1993 A
5199077 Wilcox et al. Mar 1993 A
5201034 Matsuura et al. Apr 1993 A
5202952 Gillick et al. Apr 1993 A
5208862 Ozawa May 1993 A
5210689 Baker et al. May 1993 A
5212638 Bernath May 1993 A
5212821 Gorin et al. May 1993 A
5216747 Hardwick et al. Jun 1993 A
5218700 Beechick Jun 1993 A
5220629 Kosaka et al. Jun 1993 A
5220639 Lee Jun 1993 A
5220657 Bly et al. Jun 1993 A
5222146 Bahl et al. Jun 1993 A
5230036 Akamine et al. Jul 1993 A
5231670 Goldhor et al. Jul 1993 A
5235680 Bijnagte Aug 1993 A
5237502 White et al. Aug 1993 A
5241619 Schwartz et al. Aug 1993 A
5253325 Clark Oct 1993 A
5257387 Richek et al. Oct 1993 A
5260697 Barrett et al. Nov 1993 A
5266931 Tanaka Nov 1993 A
5266949 Rossi Nov 1993 A
5267345 Brown et al. Nov 1993 A
5268990 Cohen et al. Dec 1993 A
5274771 Hamilton et al. Dec 1993 A
5274818 Vasilevsky et al. Dec 1993 A
5276616 Kuga et al. Jan 1994 A
5276794 Lamb, Jr. Jan 1994 A
5278980 Pedersen et al. Jan 1994 A
5282265 Rohra Suda et al. Jan 1994 A
5283818 Klausner et al. Feb 1994 A
5287448 Nicol et al. Feb 1994 A
5289562 Mizuta et al. Feb 1994 A
RE34562 Murakami et al. Mar 1994 E
5291286 Murakami et al. Mar 1994 A
5293448 Honda Mar 1994 A
5293452 Picone et al. Mar 1994 A
5296642 Konishi Mar 1994 A
5297170 Eyuboglu et al. Mar 1994 A
5297194 Hunt et al. Mar 1994 A
5299125 Baker et al. Mar 1994 A
5299284 Roy Mar 1994 A
5301109 Landauer et al. Apr 1994 A
5303406 Hansen et al. Apr 1994 A
5305205 Weber et al. Apr 1994 A
5305768 Gross et al. Apr 1994 A
5309359 Katz et al. May 1994 A
5315689 Kanazawa et al. May 1994 A
5317507 Gallant May 1994 A
5317647 Pagallo May 1994 A
5325297 Bird et al. Jun 1994 A
5325298 Gallant Jun 1994 A
5325462 Farrett Jun 1994 A
5326270 Ostby et al. Jul 1994 A
5327342 Roy Jul 1994 A
5327498 Hamon Jul 1994 A
5329608 Bocchieri et al. Jul 1994 A
5333236 Bahl et al. Jul 1994 A
5333266 Boaz et al. Jul 1994 A
5333275 Wheatley et al. Jul 1994 A
5335011 Addeo et al. Aug 1994 A
5335276 Thompson et al. Aug 1994 A
5341293 Vertelney et al. Aug 1994 A
5341466 Perlin et al. Aug 1994 A
5345536 Hoshimi et al. Sep 1994 A
5349645 Zhao Sep 1994 A
5353374 Wilson et al. Oct 1994 A
5353376 Oh et al. Oct 1994 A
5353377 Kuroda et al. Oct 1994 A
5353408 Kato et al. Oct 1994 A
5353432 Richek et al. Oct 1994 A
5357431 Nakada et al. Oct 1994 A
5367640 Hamilton et al. Nov 1994 A
5369575 Lamberti et al. Nov 1994 A
5369577 Kadashevich et al. Nov 1994 A
5371853 Kao et al. Dec 1994 A
5373566 Murdock Dec 1994 A
5377103 Lamberti et al. Dec 1994 A
5377301 Rosenberg et al. Dec 1994 A
5377303 Firman Dec 1994 A
5384671 Fisher Jan 1995 A
5384892 Strong Jan 1995 A
5384893 Hutchins Jan 1995 A
5386494 White Jan 1995 A
5386556 Hedin et al. Jan 1995 A
5390236 Klausner et al. Feb 1995 A
5390279 Strong Feb 1995 A
5390281 Luciw et al. Feb 1995 A
5392419 Walton Feb 1995 A
5396625 Parkes Mar 1995 A
5400434 Pearson Mar 1995 A
5404295 Katz et al. Apr 1995 A
5406305 Shimomura et al. Apr 1995 A
5408060 Muurinen Apr 1995 A
5412756 Bauman et al. May 1995 A
5412804 Krishna May 1995 A
5412806 Du et al. May 1995 A
5418951 Damashek May 1995 A
5422656 Allard et al. Jun 1995 A
5424947 Nagao et al. Jun 1995 A
5425108 Hwang et al. Jun 1995 A
5428731 Powers, III Jun 1995 A
5434777 Luciw Jul 1995 A
5442598 Haikawa et al. Aug 1995 A
5442780 Takanashi et al. Aug 1995 A
5444823 Nguyen Aug 1995 A
5449368 Kuzmak Sep 1995 A
5450523 Zhao Sep 1995 A
5455888 Iyengar et al. Oct 1995 A
5459488 Geiser Oct 1995 A
5463696 Beernink et al. Oct 1995 A
5463725 Henckel et al. Oct 1995 A
5465401 Thompson Nov 1995 A
5469529 Bimbot et al. Nov 1995 A
5471611 McGregor Nov 1995 A
5473728 Luginbuhl et al. Dec 1995 A
5475587 Anick et al. Dec 1995 A
5475796 Iwata Dec 1995 A
5477447 Luciw et al. Dec 1995 A
5477448 Golding et al. Dec 1995 A
5477451 Brown et al. Dec 1995 A
5479488 Lenning et al. Dec 1995 A
5481739 Staats Jan 1996 A
5485372 Golding et al. Jan 1996 A
5485543 Aso Jan 1996 A
5488727 Agrawal et al. Jan 1996 A
5490234 Narayan Feb 1996 A
5491758 Bellegarda et al. Feb 1996 A
5491772 Hardwick et al. Feb 1996 A
5493677 Balogh Feb 1996 A
5495604 Harding et al. Feb 1996 A
5497319 Chong et al. Mar 1996 A
5500903 Gulli Mar 1996 A
5500905 Martin et al. Mar 1996 A
5500937 Thompson-Rohrlich Mar 1996 A
5502774 Bellegarda et al. Mar 1996 A
5502790 Yi Mar 1996 A
5502791 Nishimura et al. Mar 1996 A
5515475 Gupta et al. May 1996 A
5521816 Roche et al. May 1996 A
5524140 Klausner et al. Jun 1996 A
5533182 Bates et al. Jul 1996 A
5535121 Roche et al. Jul 1996 A
5536902 Serra et al. Jul 1996 A
5537317 Schabes et al. Jul 1996 A
5537618 Boulton et al. Jul 1996 A
5537647 Hermansky et al. Jul 1996 A
5543588 Bisset et al. Aug 1996 A
5543897 Altrieth, III Aug 1996 A
5544264 Bellegarda et al. Aug 1996 A
5548507 Martino et al. Aug 1996 A
5555343 Luther Sep 1996 A
5555344 Zunkler Sep 1996 A
5559301 Bryan, Jr. et al. Sep 1996 A
5559945 Beaudet et al. Sep 1996 A
5564446 Wiltshire Oct 1996 A
5565888 Selker Oct 1996 A
5568536 Tiller et al. Oct 1996 A
5568540 Greco et al. Oct 1996 A
5570324 Geil Oct 1996 A
5572576 Klausner et al. Nov 1996 A
5574823 Hassanein et al. Nov 1996 A
5574824 Slyh et al. Nov 1996 A
5577135 Grajski et al. Nov 1996 A
5577164 Kaneko et al. Nov 1996 A
5577241 Spencer Nov 1996 A
5578808 Taylor Nov 1996 A
5579037 Tahara et al. Nov 1996 A
5579436 Chou et al. Nov 1996 A
5581484 Prince Dec 1996 A
5581652 Abe et al. Dec 1996 A
5581655 Cohen et al. Dec 1996 A
5583993 Foster et al. Dec 1996 A
5584024 Shwartz Dec 1996 A
5594641 Kaplan et al. Jan 1997 A
5596260 Moravec et al. Jan 1997 A
5596676 Swaminathan et al. Jan 1997 A
5596994 Bro Jan 1997 A
5608624 Luciw Mar 1997 A
5608698 Yamanoi et al. Mar 1997 A
5608841 Tsuboka Mar 1997 A
5610812 Schabes et al. Mar 1997 A
5613036 Strong Mar 1997 A
5613122 Burnard et al. Mar 1997 A
5615378 Nishino et al. Mar 1997 A
5615384 Allard et al. Mar 1997 A
5616876 Cluts Apr 1997 A
5617386 Choi Apr 1997 A
5617507 Lee et al. Apr 1997 A
5617539 Ludwig et al. Apr 1997 A
5619583 Page et al. Apr 1997 A
5619694 Shimazu Apr 1997 A
5621859 Schwartz et al. Apr 1997 A
5621903 Luciw et al. Apr 1997 A
5627939 Huang et al. May 1997 A
5634084 Malsheen et al. May 1997 A
5636325 Farrett Jun 1997 A
5638425 Meador, III et al. Jun 1997 A
5638489 Tsuboka Jun 1997 A
5638523 Mullet et al. Jun 1997 A
5640487 Lau et al. Jun 1997 A
5642464 Yue et al. Jun 1997 A
5642466 Narayan Jun 1997 A
5642519 Martin Jun 1997 A
5644656 Akra et al. Jul 1997 A
5644727 Atkins Jul 1997 A
5649060 Ellozy et al. Jul 1997 A
5652828 Silverman Jul 1997 A
5652884 Palevich Jul 1997 A
5652897 Linebarger et al. Jul 1997 A
5661787 Pocock Aug 1997 A
5664055 Kroon Sep 1997 A
5670985 Cappels, Sr. et al. Sep 1997 A
5675819 Schuetze Oct 1997 A
5682475 Johnson et al. Oct 1997 A
5682539 Conrad et al. Oct 1997 A
5684513 Decker Nov 1997 A
5687077 Gough, Jr. Nov 1997 A
5689287 Mackinlay et al. Nov 1997 A
5689618 Gasper et al. Nov 1997 A
5696962 Kupiec Dec 1997 A
5699082 Marks et al. Dec 1997 A
5701400 Amado Dec 1997 A
5706442 Anderson et al. Jan 1998 A
5708659 Rostoker et al. Jan 1998 A
5708822 Wical Jan 1998 A
5710886 Christensen et al. Jan 1998 A
5710922 Alley et al. Jan 1998 A
5712949 Kato et al. Jan 1998 A
5712957 Waibel et al. Jan 1998 A
5715468 Budzinski Feb 1998 A
5717877 Orton et al. Feb 1998 A
5721827 Logan et al. Feb 1998 A
5721949 Smith et al. Feb 1998 A
5724406 Juster Mar 1998 A
5724985 Snell et al. Mar 1998 A
5726672 Hernandez et al. Mar 1998 A
5727950 Cook et al. Mar 1998 A
5729694 Holzrichter et al. Mar 1998 A
5732216 Logan et al. Mar 1998 A
5732390 Katayanagi et al. Mar 1998 A
5732395 Silverman Mar 1998 A
5734750 Arai et al. Mar 1998 A
5734791 Acero et al. Mar 1998 A
5736974 Selker Apr 1998 A
5737487 Bellegarda et al. Apr 1998 A
5737734 Schultz Apr 1998 A
5739451 Winksy et al. Apr 1998 A
5740143 Suetomi Apr 1998 A
5742705 Parthasarathy Apr 1998 A
5742736 Haddock Apr 1998 A
5745116 Pisutha-Arnond Apr 1998 A
5745873 Braida et al. Apr 1998 A
5748512 Vargas May 1998 A
5748974 Johnson May 1998 A
5749071 Silverman May 1998 A
5749081 Whiteis May 1998 A
5751906 Silverman May 1998 A
5757358 Osga May 1998 A
5757979 Hongo et al. May 1998 A
5758079 Ludwig et al. May 1998 A
5758314 McKenna May 1998 A
5759101 Von Kohorn Jun 1998 A
5761640 Kalyanswamy et al. Jun 1998 A
5765131 Stentiford et al. Jun 1998 A
5765168 Burrows Jun 1998 A
5771276 Wolf Jun 1998 A
5774834 Visser Jun 1998 A
5774855 Foti et al. Jun 1998 A
5774859 Houser et al. Jun 1998 A
5777614 Ando et al. Jul 1998 A
5778405 Ogawa Jul 1998 A
5790978 Olive et al. Aug 1998 A
5794050 Dahlgren et al. Aug 1998 A
5794182 Manduchi et al. Aug 1998 A
5794207 Walker et al. Aug 1998 A
5794237 Gore, Jr. Aug 1998 A
5797008 Burrows Aug 1998 A
5799268 Boguraev Aug 1998 A
5799269 Schabes et al. Aug 1998 A
5799276 Komissarchik et al. Aug 1998 A
5801692 Muzio et al. Sep 1998 A
5802466 Gallant et al. Sep 1998 A
5802526 Fawcett et al. Sep 1998 A
5812697 Sakai et al. Sep 1998 A
5812698 Platt et al. Sep 1998 A
5815142 Allard et al. Sep 1998 A
5815225 Nelson Sep 1998 A
5818451 Bertram et al. Oct 1998 A
5818924 King et al. Oct 1998 A
5822288 Shinada Oct 1998 A
5822730 Roth et al. Oct 1998 A
5822743 Gupta et al. Oct 1998 A
5825349 Meier et al. Oct 1998 A
5825881 Colvin, Sr. Oct 1998 A
5826261 Spencer Oct 1998 A
5828768 Eatwell et al. Oct 1998 A
5828999 Bellegarda et al. Oct 1998 A
5832433 Yashchin et al. Nov 1998 A
5832435 Silverman Nov 1998 A
5835077 Dao et al. Nov 1998 A
5835721 Donahue et al. Nov 1998 A
5835732 Kikinis et al. Nov 1998 A
5835893 Ushioda Nov 1998 A
5839106 Bellegarda Nov 1998 A
5841902 Tu Nov 1998 A
5842165 Raman et al. Nov 1998 A
5845255 Mayaud Dec 1998 A
5850480 Scanlon Dec 1998 A
5850629 Holm et al. Dec 1998 A
5854893 Ludwig et al. Dec 1998 A
5857184 Lynch Jan 1999 A
5860063 Gorin et al. Jan 1999 A
5860064 Henton Jan 1999 A
5860075 Hashizume et al. Jan 1999 A
5862233 Poletti Jan 1999 A
5864806 Mokbel et al. Jan 1999 A
5864815 Rozak et al. Jan 1999 A
5864844 James et al. Jan 1999 A
5864855 Ruocco et al. Jan 1999 A
5864868 Contois Jan 1999 A
5867799 Lang et al. Feb 1999 A
5870710 Ozawa et al. Feb 1999 A
5873056 Liddy et al. Feb 1999 A
5875427 Yamazaki Feb 1999 A
5875437 Atkins Feb 1999 A
5876396 Lo et al. Mar 1999 A
5877751 Kanemitsu et al. Mar 1999 A
5878393 Hata et al. Mar 1999 A
5878394 Muhling Mar 1999 A
5878396 Henton Mar 1999 A
5880731 Liles et al. Mar 1999 A
5884039 Ludwig et al. Mar 1999 A
5884323 Hawkins et al. Mar 1999 A
5890117 Silverman Mar 1999 A
5890122 Van Kleeck et al. Mar 1999 A
5891180 Greeninger et al. Apr 1999 A
5895448 Vysotsky et al. Apr 1999 A
5895464 Bhandari et al. Apr 1999 A
5895466 Goldberg et al. Apr 1999 A
5896321 Miller et al. Apr 1999 A
5896500 Ludwig et al. Apr 1999 A
5899972 Miyazawa et al. May 1999 A
5909666 Gould et al. Jun 1999 A
5912951 Checchio et al. Jun 1999 A
5912952 Brendzel Jun 1999 A
5913193 Huang et al. Jun 1999 A
5915236 Gould et al. Jun 1999 A
5915238 Tjaden Jun 1999 A
5915249 Spencer Jun 1999 A
5917487 Ulrich Jun 1999 A
5918303 Yamaura et al. Jun 1999 A
5920327 Seidensticker, Jr. Jul 1999 A
5920836 Gould et al. Jul 1999 A
5920837 Gould et al. Jul 1999 A
5923757 Hocker et al. Jul 1999 A
5924068 Richard et al. Jul 1999 A
5926769 Valimaa et al. Jul 1999 A
5926789 Barbara et al. Jul 1999 A
5930408 Seto Jul 1999 A
5930751 Cohrs et al. Jul 1999 A
5930754 Karaali et al. Jul 1999 A
5930769 Rose Jul 1999 A
5930783 Li et al. Jul 1999 A
5933477 Wu Aug 1999 A
5933806 Beyerlein et al. Aug 1999 A
5933822 Braden-Harder et al. Aug 1999 A
5936926 Yokouchi et al. Aug 1999 A
5940811 Norris Aug 1999 A
5940841 Schmuck et al. Aug 1999 A
5941944 Messerly Aug 1999 A
5943043 Furuhata et al. Aug 1999 A
5943049 Matsubara et al. Aug 1999 A
5943052 Allen et al. Aug 1999 A
5943443 Itonori et al. Aug 1999 A
5943670 Prager Aug 1999 A
5948040 DeLorme et al. Sep 1999 A
5949961 Sharman Sep 1999 A
5950123 Schwelb et al. Sep 1999 A
5952992 Helms Sep 1999 A
5953541 King et al. Sep 1999 A
5956021 Kubota et al. Sep 1999 A
5956699 Wong et al. Sep 1999 A
5960394 Gould et al. Sep 1999 A
5960422 Prasad Sep 1999 A
5963924 Williams et al. Oct 1999 A
5966126 Szabo Oct 1999 A
5970474 LeRoy et al. Oct 1999 A
5973676 Kawakura Oct 1999 A
5974146 Randle et al. Oct 1999 A
5977950 Rhyne Nov 1999 A
5982352 Pryor Nov 1999 A
5982891 Ginter et al. Nov 1999 A
5982902 Terano Nov 1999 A
5983179 Gould Nov 1999 A
5987132 Rowney Nov 1999 A
5987140 Rowney et al. Nov 1999 A
5987401 Trudeau Nov 1999 A
5987404 Della Pietra et al. Nov 1999 A
5987440 O'Neil et al. Nov 1999 A
5990887 Redpath et al. Nov 1999 A
5991441 Jourjine Nov 1999 A
5995460 Takagi et al. Nov 1999 A
5995590 Brunet et al. Nov 1999 A
5998972 Gong Dec 1999 A
5999169 Lee Dec 1999 A
5999895 Forest Dec 1999 A
5999908 Abelow Dec 1999 A
5999927 Tukey et al. Dec 1999 A
6006274 Hawkins et al. Dec 1999 A
6009237 Hirabayashi et al. Dec 1999 A
6011585 Anderson Jan 2000 A
6014428 Wolf Jan 2000 A
6016471 Kuhn et al. Jan 2000 A
6018705 Gaudet et al. Jan 2000 A
6018711 French-St. George et al. Jan 2000 A
6020881 Naughton et al. Feb 2000 A
6023536 Visser Feb 2000 A
6023676 Erell Feb 2000 A
6023684 Pearson Feb 2000 A
6024288 Gottlich et al. Feb 2000 A
6026345 Shah et al. Feb 2000 A
6026375 Hall et al. Feb 2000 A
6026388 Liddy et al. Feb 2000 A
6026393 Gupta et al. Feb 2000 A
6029132 Kuhn et al. Feb 2000 A
6035267 Watanabe et al. Mar 2000 A
6035303 Baer et al. Mar 2000 A
6035336 Lu et al. Mar 2000 A
6038533 Buchsbaum et al. Mar 2000 A
6040824 Maekawa et al. Mar 2000 A
6041023 Lakhansingh Mar 2000 A
6047255 Williamson Apr 2000 A
6052654 Gaudet et al. Apr 2000 A
6052656 Suda et al. Apr 2000 A
6054990 Tran Apr 2000 A
6055514 Wren Apr 2000 A
6055531 Bennett et al. Apr 2000 A
6064767 Muir et al. May 2000 A
6064959 Young et al. May 2000 A
6064960 Bellegarda et al. May 2000 A
6064963 Gainsboro May 2000 A
6067519 Lowry May 2000 A
6069648 Suso et al. May 2000 A
6070139 Miyazawa et al. May 2000 A
6070147 Harms et al. May 2000 A
6073033 Campo Jun 2000 A
6073036 Heikkinen et al. Jun 2000 A
6073097 Gould et al. Jun 2000 A
6076051 Messerly et al. Jun 2000 A
6076060 Lin et al. Jun 2000 A
6076088 Paik et al. Jun 2000 A
6078914 Redfern Jun 2000 A
6081750 Hoffberg et al. Jun 2000 A
6081774 de Hita et al. Jun 2000 A
6081780 Lumelsky Jun 2000 A
6088671 Gould et al. Jul 2000 A
6088731 Kiraly et al. Jul 2000 A
6092043 Squires et al. Jul 2000 A
6094649 Bowen et al. Jul 2000 A
6097391 Wilcox Aug 2000 A
6101468 Gould et al. Aug 2000 A
6101470 Eide et al. Aug 2000 A
6105865 Hardesty Aug 2000 A
6108627 Sabourin Aug 2000 A
6111562 Downs et al. Aug 2000 A
6116907 Baker et al. Sep 2000 A
6119101 Peckover Sep 2000 A
6121960 Carroll et al. Sep 2000 A
6122340 Darley et al. Sep 2000 A
6122614 Kahn et al. Sep 2000 A
6122616 Henton Sep 2000 A
6125284 Moore et al. Sep 2000 A
6125346 Nishimura et al. Sep 2000 A
6125356 Brockman et al. Sep 2000 A
6129582 Wilhite et al. Oct 2000 A
6138098 Shieber et al. Oct 2000 A
6141642 Oh Oct 2000 A
6141644 Kuhn et al. Oct 2000 A
6144377 Oppermann et al. Nov 2000 A
6144938 Surace et al. Nov 2000 A
6144939 Pearson et al. Nov 2000 A
6151401 Annaratone Nov 2000 A
6154551 Frenkel Nov 2000 A
6154720 Onishi et al. Nov 2000 A
6157935 Tran et al. Dec 2000 A
6161084 Messerly et al. Dec 2000 A
6161087 Wightman et al. Dec 2000 A
6161944 Leman Dec 2000 A
6163769 Acero et al. Dec 2000 A
6163809 Buckley Dec 2000 A
6167369 Schulze Dec 2000 A
6169538 Nowlan et al. Jan 2001 B1
6172948 Keller et al. Jan 2001 B1
6173194 Vanttila Jan 2001 B1
6173251 Ito et al. Jan 2001 B1
6173261 Arai et al. Jan 2001 B1
6173263 Conkie Jan 2001 B1
6173279 Levin et al. Jan 2001 B1
6177905 Welch Jan 2001 B1
6177931 Alexander et al. Jan 2001 B1
6179432 Zhang et al. Jan 2001 B1
6182028 Karaali et al. Jan 2001 B1
6185533 Holm et al. Feb 2001 B1
6188999 Moody Feb 2001 B1
6191939 Burnett Feb 2001 B1
6192253 Charlier et al. Feb 2001 B1
6192340 Abecassis Feb 2001 B1
6195641 Loring et al. Feb 2001 B1
6205456 Nakao Mar 2001 B1
6208044 Viswanadham et al. Mar 2001 B1
6208956 Motoyama Mar 2001 B1
6208964 Sabourin Mar 2001 B1
6208967 Pauws et al. Mar 2001 B1
6208971 Bellegarda et al. Mar 2001 B1
6216102 Martino et al. Apr 2001 B1
6216131 Liu et al. Apr 2001 B1
6217183 Shipman Apr 2001 B1
6222347 Gong Apr 2001 B1
6226403 Parthasarathy May 2001 B1
6226533 Akahane May 2001 B1
6226614 Mizuno et al. May 2001 B1
6230322 Saib et al. May 2001 B1
6232539 Looney et al. May 2001 B1
6232966 Kurlander May 2001 B1
6233545 Datig May 2001 B1
6233559 Balakrishnan May 2001 B1
6233578 Machihara et al. May 2001 B1
6237025 Ludwig et al. May 2001 B1
6240303 Katzur May 2001 B1
6243681 Guji et al. Jun 2001 B1
6246981 Papineni et al. Jun 2001 B1
6248946 Dwek Jun 2001 B1
6249606 Kiraly et al. Jun 2001 B1
6259436 Moon et al. Jul 2001 B1
6259826 Pollard et al. Jul 2001 B1
6260011 Heckerman et al. Jul 2001 B1
6260013 Sejnoha Jul 2001 B1
6260016 Holm et al. Jul 2001 B1
6260024 Shkedy Jul 2001 B1
6266637 Donovan et al. Jul 2001 B1
6268859 Andresen et al. Jul 2001 B1
6269712 Zentmyer Aug 2001 B1
6271835 Hoeksma Aug 2001 B1
6272456 De Campos Aug 2001 B1
6272464 Kiraz et al. Aug 2001 B1
6275795 Tzirkel-Hancock Aug 2001 B1
6275824 O'Flaherty et al. Aug 2001 B1
6278970 Milner Aug 2001 B1
6282507 Horiguchi et al. Aug 2001 B1
6285785 Bellegarda et al. Sep 2001 B1
6285786 Seni et al. Sep 2001 B1
6289085 Miyashita et al. Sep 2001 B1
6289124 Okamoto Sep 2001 B1
6289301 Higginbotham et al. Sep 2001 B1
6289353 Hazlehurst et al. Sep 2001 B1
6292772 Kantrowitz Sep 2001 B1
6295390 Kobayashi et al. Sep 2001 B1
6295541 Bodnar et al. Sep 2001 B1
6297818 Ulrich et al. Oct 2001 B1
6298314 Blackadar et al. Oct 2001 B1
6298321 Karlov et al. Oct 2001 B1
6304844 Pan et al. Oct 2001 B1
6304846 George et al. Oct 2001 B1
6307548 Flinchem et al. Oct 2001 B1
6308149 Gaussier et al. Oct 2001 B1
6311157 Strong Oct 2001 B1
6311189 deVries et al. Oct 2001 B1
6317237 Nakao et al. Nov 2001 B1
6317594 Gossman et al. Nov 2001 B1
6317707 Bangalore et al. Nov 2001 B1
6317831 King Nov 2001 B1
6321092 Fitch et al. Nov 2001 B1
6324512 Junqua et al. Nov 2001 B1
6330538 Breen Dec 2001 B1
6332175 Birrell et al. Dec 2001 B1
6334103 Surace et al. Dec 2001 B1
6335722 Tani et al. Jan 2002 B1
6336365 Blackadar et al. Jan 2002 B1
6336727 Kim Jan 2002 B1
6340937 Stepita-Klauco Jan 2002 B1
6341316 Kloba et al. Jan 2002 B1
6343267 Kuhn et al. Jan 2002 B1
6345250 Martin Feb 2002 B1
6351522 Vitikainen Feb 2002 B1
6351762 Ludwig et al. Feb 2002 B1
6353442 Masui Mar 2002 B1
6353794 Davis et al. Mar 2002 B1
6356854 Schubert et al. Mar 2002 B1
6356864 Foltz et al. Mar 2002 B1
6356905 Gershman et al. Mar 2002 B1
6357147 Darley et al. Mar 2002 B1
6359572 Vale Mar 2002 B1
6359970 Burgess Mar 2002 B1
6360227 Aggarwal et al. Mar 2002 B1
6360237 Schulz et al. Mar 2002 B1
6366883 Campbell et al. Apr 2002 B1
6366884 Bellegarda et al. Apr 2002 B1
6374217 Bellegarda Apr 2002 B1
6377530 Burrows Apr 2002 B1
6377925 Greene, Jr. et al. Apr 2002 B1
6377928 Saxena et al. Apr 2002 B1
6385586 Dietz May 2002 B1
6385662 Moon et al. May 2002 B1
6389114 Dowens et al. May 2002 B1
6397183 Baba et al. May 2002 B1
6397186 Bush et al. May 2002 B1
6401065 Kanevsky et al. Jun 2002 B1
6405169 Kondo et al. Jun 2002 B1
6408272 White et al. Jun 2002 B1
6411932 Molnar et al. Jun 2002 B1
6415250 Van Den Akker Jul 2002 B1
6421305 Gioscia et al. Jul 2002 B1
6421672 McAllister et al. Jul 2002 B1
6421707 Miller et al. Jul 2002 B1
6424944 Hikawa Jul 2002 B1
6430551 Thelen et al. Aug 2002 B1
6434522 Tsuboka Aug 2002 B1
6434524 Weber Aug 2002 B1
6434604 Harada et al. Aug 2002 B1
6437818 Ludwig et al. Aug 2002 B1
6438523 Oberteuffer et al. Aug 2002 B1
6442518 Van Thong et al. Aug 2002 B1
6442523 Siegel Aug 2002 B1
6446076 Burkey et al. Sep 2002 B1
6448485 Barile Sep 2002 B1
6448986 Smith Sep 2002 B1
6449620 Draper et al. Sep 2002 B1
6453281 Walters et al. Sep 2002 B1
6453292 Ramaswamy et al. Sep 2002 B2
6453315 Weissman et al. Sep 2002 B1
6456616 Rantanen Sep 2002 B1
6456972 Gladstein et al. Sep 2002 B1
6460015 Hetherington et al. Oct 2002 B1
6460029 Fries et al. Oct 2002 B1
6462778 Abram et al. Oct 2002 B1
6463128 Elwin Oct 2002 B1
6466654 Cooper et al. Oct 2002 B1
6467924 Shipman Oct 2002 B2
6469712 Hilpert, Jr. et al. Oct 2002 B1
6469722 Kinoe et al. Oct 2002 B1
6469732 Chang et al. Oct 2002 B1
6470347 Gillam Oct 2002 B1
6473630 Baranowski et al. Oct 2002 B1
6477488 Bellegarda Nov 2002 B1
6477494 Hyde-Thomson et al. Nov 2002 B2
6487533 Hyde-Thomson et al. Nov 2002 B2
6487534 Thelen et al. Nov 2002 B1
6487663 Jaisimha et al. Nov 2002 B1
6489951 Wong et al. Dec 2002 B1
6490560 Ramaswamy et al. Dec 2002 B1
6493428 Hillier Dec 2002 B1
6493652 Ohlenbusch et al. Dec 2002 B1
6493667 De Souza et al. Dec 2002 B1
6499013 Weber Dec 2002 B1
6499014 Chihara Dec 2002 B1
6501937 Ho et al. Dec 2002 B1
6502194 Berman et al. Dec 2002 B1
6505158 Conkie Jan 2003 B1
6505175 Silverman et al. Jan 2003 B1
6505183 Loofbourrow et al. Jan 2003 B1
6510406 Marchisio Jan 2003 B1
6510417 Quilici et al. Jan 2003 B1
6513008 Pearson et al. Jan 2003 B2
6513063 Julia et al. Jan 2003 B1
6519565 Clements et al. Feb 2003 B1
6519566 Boyer et al. Feb 2003 B1
6523026 Gillis Feb 2003 B1
6523061 Halverson et al. Feb 2003 B1
6523172 Martinez-Guerra et al. Feb 2003 B1
6526351 Whitham Feb 2003 B2
6526382 Yuschik Feb 2003 B1
6526395 Morris Feb 2003 B1
6529592 Khan Mar 2003 B1
6529608 Gersabeck et al. Mar 2003 B2
6532444 Weber Mar 2003 B1
6532446 King Mar 2003 B1
6535610 Stewart Mar 2003 B1
6535852 Eide Mar 2003 B2
6535983 McCormack et al. Mar 2003 B1
6536139 Darley et al. Mar 2003 B2
6538665 Crow et al. Mar 2003 B2
6542171 Satou et al. Apr 2003 B1
6542584 Sherwood et al. Apr 2003 B1
6546262 Freadman Apr 2003 B1
6546367 Otsuka Apr 2003 B2
6546388 Edlund et al. Apr 2003 B1
6549497 Miyamoto et al. Apr 2003 B2
6553343 Kagoshima et al. Apr 2003 B1
6553344 Bellegarda et al. Apr 2003 B2
6556971 Rigsby et al. Apr 2003 B1
6556983 Altschuler et al. Apr 2003 B1
6560903 Darley May 2003 B1
6563769 Van Der Meulen May 2003 B1
6564186 Kiraly et al. May 2003 B1
6582342 Kaufman Jun 2003 B2
6583806 Ludwig et al. Jun 2003 B2
6584464 Warthen Jun 2003 B1
6587403 Keller et al. Jul 2003 B1
6587404 Keller et al. Jul 2003 B1
6591379 LeVine et al. Jul 2003 B1
6594673 Smith et al. Jul 2003 B1
6594688 Ludwig et al. Jul 2003 B2
6597345 Hirshberg Jul 2003 B2
6598021 Shambaugh et al. Jul 2003 B1
6598022 Yuschik Jul 2003 B2
6598039 Livowsky Jul 2003 B1
6598054 Schuetze et al. Jul 2003 B2
6601026 Appelt et al. Jul 2003 B2
6601234 Bowman-Amuah Jul 2003 B1
6603837 Kesanupalli et al. Aug 2003 B1
6604059 Strubbe et al. Aug 2003 B2
6606388 Townsend et al. Aug 2003 B1
6606632 Saulpaugh et al. Aug 2003 B1
6611789 Darley Aug 2003 B1
6615172 Bennett et al. Sep 2003 B1
6615175 Gazdzinski Sep 2003 B1
6615176 Lewis et al. Sep 2003 B2
6615220 Austin et al. Sep 2003 B1
6621768 Keller et al. Sep 2003 B1
6621892 Banister et al. Sep 2003 B1
6622121 Crepy et al. Sep 2003 B1
6622136 Russell Sep 2003 B2
6623529 Lakritz Sep 2003 B1
6625583 Silverman et al. Sep 2003 B1
6628808 Bach et al. Sep 2003 B1
6631186 Gibson et al. Oct 2003 B1
6631346 Karaorman et al. Oct 2003 B1
6633846 Bennett et al. Oct 2003 B1
6633932 Bork et al. Oct 2003 B1
6643401 Kashioka et al. Nov 2003 B1
6647260 Dusse et al. Nov 2003 B2
6650735 Burton et al. Nov 2003 B2
6654740 Tokuda et al. Nov 2003 B2
6658389 Alpdemir Dec 2003 B1
6658577 Huppi et al. Dec 2003 B2
6662023 Helle Dec 2003 B1
6665639 Mozer et al. Dec 2003 B2
6665640 Bennett et al. Dec 2003 B1
6665641 Coorman et al. Dec 2003 B1
6671683 Kanno Dec 2003 B2
6671856 Gillam Dec 2003 B1
6675169 Bennett et al. Jan 2004 B1
6675233 Du et al. Jan 2004 B1
6680675 Suzuki Jan 2004 B1
6684187 Conkie Jan 2004 B1
6684376 Kerzman et al. Jan 2004 B1
6690387 Zimmerman et al. Feb 2004 B2
6690800 Resnick Feb 2004 B2
6690828 Meyers Feb 2004 B2
6691064 Vroman Feb 2004 B2
6691090 Laurila et al. Feb 2004 B1
6691111 Lazaridis et al. Feb 2004 B2
6691151 Cheyer et al. Feb 2004 B1
6694295 Lindholm et al. Feb 2004 B2
6694297 Sato Feb 2004 B2
6697780 Beutnagel et al. Feb 2004 B1
6697824 Bowman-Amuah Feb 2004 B1
6701294 Ball et al. Mar 2004 B1
6701305 Holt et al. Mar 2004 B1
6701318 Fox et al. Mar 2004 B2
6704015 Bovarnick et al. Mar 2004 B1
6704698 Paulsen, Jr. et al. Mar 2004 B1
6704710 Strong Mar 2004 B2
6708153 Brittan et al. Mar 2004 B2
6711585 Copperman et al. Mar 2004 B1
6714221 Christie et al. Mar 2004 B1
6716139 Hosseinzadeh-Dolkhani et al. Apr 2004 B1
6718324 Edlund et al. Apr 2004 B2
6718331 Davis et al. Apr 2004 B2
6720980 Lui et al. Apr 2004 B1
6721728 McGreevy Apr 2004 B2
6721734 Subasic et al. Apr 2004 B1
6724370 Dutta et al. Apr 2004 B2
6728675 Maddalozzo, Jr. et al. Apr 2004 B1
6728729 Jawa et al. Apr 2004 B1
6731312 Robbin May 2004 B2
6732142 Bates et al. May 2004 B1
6735632 Kiraly et al. May 2004 B1
6738738 Henton May 2004 B2
6741264 Lesser May 2004 B1
6742021 Halverson et al. May 2004 B1
6751592 Shiga Jun 2004 B1
6751595 Chintrakulchai et al. Jun 2004 B2
6751621 Calistri-Yeh et al. Jun 2004 B1
6754504 Reed Jun 2004 B1
6757362 Cooper et al. Jun 2004 B1
6757365 Bogard Jun 2004 B1
6757646 Marchisio Jun 2004 B2
6757653 Buth et al. Jun 2004 B2
6757718 Halverson et al. Jun 2004 B1
6760412 Loucks Jul 2004 B1
6760700 Lewis et al. Jul 2004 B2
6760754 Isaacs et al. Jul 2004 B1
6762741 Weindorf Jul 2004 B2
6763089 Feigenbaum Jul 2004 B2
6766294 MacGinite et al. Jul 2004 B2
6766320 Want et al. Jul 2004 B1
6766324 Carlson et al. Jul 2004 B2
6768979 Menendez-Pidal et al. Jul 2004 B1
6772123 Cooklev et al. Aug 2004 B2
6772195 Hatlelid et al. Aug 2004 B1
6775358 Breitenbach et al. Aug 2004 B1
6778951 Contractor Aug 2004 B1
6778952 Bellegarda Aug 2004 B2
6778962 Kasai et al. Aug 2004 B1
6778970 Au Aug 2004 B2
6778979 Grefenstette et al. Aug 2004 B2
6782510 Gross et al. Aug 2004 B1
6784901 Harvey et al. Aug 2004 B1
6789094 Rudoff et al. Sep 2004 B2
6789231 Reynar et al. Sep 2004 B1
6790704 Doyle et al. Sep 2004 B2
6792082 Levine Sep 2004 B1
6792086 Saylor et al. Sep 2004 B1
6792407 Kibre et al. Sep 2004 B2
6794566 Pachet Sep 2004 B2
6795059 Endo Sep 2004 B2
6799226 Robbin et al. Sep 2004 B1
6801604 Maes et al. Oct 2004 B2
6801964 Mahdavi Oct 2004 B1
6803905 Capps et al. Oct 2004 B1
6804649 Miranda Oct 2004 B2
6804677 Shadmon et al. Oct 2004 B2
6807536 Achlioptas et al. Oct 2004 B2
6807574 Partovi et al. Oct 2004 B1
6810379 Vermeulen et al. Oct 2004 B1
6813218 Antonelli et al. Nov 2004 B1
6813491 McKinney Nov 2004 B1
6813607 Faruquie et al. Nov 2004 B1
6816578 Kredo et al. Nov 2004 B1
6820055 Saindon et al. Nov 2004 B2
6829018 Lin et al. Dec 2004 B2
6829603 Chai et al. Dec 2004 B1
6832194 Mozer et al. Dec 2004 B1
6832381 Mathur et al. Dec 2004 B1
6836760 Silverman et al. Dec 2004 B1
6839464 Hawkins et al. Jan 2005 B2
6839669 Gould et al. Jan 2005 B1
6839670 Stammler et al. Jan 2005 B1
6839742 Dyer et al. Jan 2005 B1
6842767 Partovi et al. Jan 2005 B1
6847966 Sommer et al. Jan 2005 B1
6847979 Allemang et al. Jan 2005 B2
6850775 Berg Feb 2005 B1
6850887 Epstein et al. Feb 2005 B2
6851115 Cheyer et al. Feb 2005 B1
6857800 Zhang et al. Feb 2005 B2
6859931 Cheyer et al. Feb 2005 B1
6862568 Case Mar 2005 B2
6862710 Marchisio Mar 2005 B1
6865533 Addison et al. Mar 2005 B2
6868045 Schroder Mar 2005 B1
6868385 Gerson Mar 2005 B1
6870529 Davis Mar 2005 B1
6871346 Kumbalimutt et al. Mar 2005 B1
6873986 McConnell et al. Mar 2005 B2
6876947 Darley et al. Apr 2005 B1
6877003 Ho et al. Apr 2005 B2
6879957 Pechter et al. Apr 2005 B1
6882335 Saarinen Apr 2005 B2
6882747 Thawonmas et al. Apr 2005 B2
6882955 Ohlenbusch et al. Apr 2005 B1
6882971 Craner Apr 2005 B2
6885734 Eberle et al. Apr 2005 B1
6889361 Bates et al. May 2005 B1
6895084 Saylor et al. May 2005 B1
6895257 Boman et al. May 2005 B2
6895380 Sepe, Jr. May 2005 B2
6895558 Loveland May 2005 B1
6898550 Blackadar et al. May 2005 B1
6901364 Nguyen et al. May 2005 B2
6901399 Corston et al. May 2005 B1
6904405 Suominen Jun 2005 B2
6907112 Guedalia et al. Jun 2005 B1
6910004 Tarbouriech et al. Jun 2005 B2
6910007 Stylianou et al. Jun 2005 B2
6910186 Kim Jun 2005 B2
6911971 Suzuki et al. Jun 2005 B2
6912407 Clarke et al. Jun 2005 B1
6912498 Stevens et al. Jun 2005 B2
6912499 Sabourin et al. Jun 2005 B1
6915138 Kraft Jul 2005 B2
6915246 Gusler et al. Jul 2005 B2
6917373 Vong et al. Jul 2005 B2
6918677 Shipman Jul 2005 B2
6924828 Hirsch Aug 2005 B1
6925438 Mohamed et al. Aug 2005 B2
6928149 Panjwani et al. Aug 2005 B1
6928614 Everhart Aug 2005 B1
6931255 Mekuria Aug 2005 B2
6931384 Horvitz et al. Aug 2005 B1
6932708 Yamashita et al. Aug 2005 B2
6934394 Anderson Aug 2005 B1
6934684 Alpdemir et al. Aug 2005 B2
6934756 Maes Aug 2005 B2
6934812 Robbin et al. Aug 2005 B1
6937975 Elworthy Aug 2005 B1
6937986 Denenberg et al. Aug 2005 B2
6944593 Kuzunuki et al. Sep 2005 B2
6948094 Schultz et al. Sep 2005 B2
6950087 Knox et al. Sep 2005 B2
6950502 Jenkins Sep 2005 B1
6954755 Reisman Oct 2005 B2
6954899 Anderson Oct 2005 B1
6956845 Baker et al. Oct 2005 B2
6957076 Hunzinger Oct 2005 B2
6960734 Park Nov 2005 B1
6961699 Kahn et al. Nov 2005 B1
6963841 Handal et al. Nov 2005 B2
6964023 Maes et al. Nov 2005 B2
6965376 Tani et al. Nov 2005 B2
6968311 Knockeart et al. Nov 2005 B2
6970820 Junqua et al. Nov 2005 B2
6970881 Mohan et al. Nov 2005 B1
6970915 Partovi et al. Nov 2005 B1
6970935 Maes Nov 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6978127 Bulthuis et al. Dec 2005 B1
6978239 Chu et al. Dec 2005 B2
6980949 Ford Dec 2005 B2
6980955 Okutani et al. Dec 2005 B2
6983251 Umemoto et al. Jan 2006 B1
6985858 Frey et al. Jan 2006 B2
6985865 Packingham et al. Jan 2006 B1
6988071 Gazdzinski Jan 2006 B1
6990450 Case et al. Jan 2006 B2
6996520 Levin Feb 2006 B2
6996531 Korall et al. Feb 2006 B2
6996575 Cox et al. Feb 2006 B2
6999066 Litwiller Feb 2006 B2
6999914 Boerner et al. Feb 2006 B1
6999925 Fischer et al. Feb 2006 B2
6999927 Mozer et al. Feb 2006 B2
7000189 Dutta et al. Feb 2006 B2
7003099 Zhang et al. Feb 2006 B1
7003463 Maes et al. Feb 2006 B1
7007239 Hawkins et al. Feb 2006 B1
7010581 Brown et al. Mar 2006 B2
7013289 Horn et al. Mar 2006 B2
7013429 Fujimoto et al. Mar 2006 B2
7020685 Chen et al. Mar 2006 B1
7024363 Comerford et al. Apr 2006 B1
7024364 Guerra et al. Apr 2006 B2
7024366 Deyoe et al. Apr 2006 B1
7024460 Koopmas et al. Apr 2006 B2
7027568 Simpson et al. Apr 2006 B1
7027974 Busch et al. Apr 2006 B1
7027990 Sussman Apr 2006 B2
7028252 Baru et al. Apr 2006 B1
7031530 Driggs et al. Apr 2006 B2
7031909 Mao et al. Apr 2006 B2
7035794 Sirivara Apr 2006 B2
7035801 Jimenez-Feltstrom Apr 2006 B2
7035807 Brittain et al. Apr 2006 B1
7036128 Julia et al. Apr 2006 B1
7038659 Rajkowski May 2006 B2
7039588 Okutani et al. May 2006 B2
7043420 Ratnaparkhi May 2006 B2
7043422 Gao et al. May 2006 B2
7046230 Zadesky et al. May 2006 B2
7046850 Braspenning et al. May 2006 B2
7047193 Bellegarda May 2006 B1
7050977 Bennett May 2006 B1
7051096 Krawiec et al. May 2006 B1
7054419 Culliss May 2006 B2
7054888 Lachapelle et al. May 2006 B2
7057607 Mayoraz et al. Jun 2006 B2
7058569 Coorman et al. Jun 2006 B2
7058888 Gjerstad et al. Jun 2006 B1
7058889 Trovato et al. Jun 2006 B2
7062223 Gerber et al. Jun 2006 B2
7062225 White Jun 2006 B2
7062428 Hogenhout et al. Jun 2006 B2
7062438 Kobayashi et al. Jun 2006 B2
7065185 Koch Jun 2006 B1
7065485 Chong-White et al. Jun 2006 B1
7069213 Thompson Jun 2006 B2
7069220 Coffman et al. Jun 2006 B2
7069560 Cheyer et al. Jun 2006 B1
7072686 Schrager Jul 2006 B1
7072941 Griffin et al. Jul 2006 B2
7076527 Bellegarda et al. Jul 2006 B2
7082322 Harano Jul 2006 B2
7084758 Cole Aug 2006 B1
7084856 Huppi Aug 2006 B2
7085723 Ross et al. Aug 2006 B2
7085960 Bouat et al. Aug 2006 B2
7092370 Jiang et al. Aug 2006 B2
7092887 Mozer et al. Aug 2006 B2
7092928 Elad et al. Aug 2006 B1
7092950 Wong et al. Aug 2006 B2
7093693 Gazdzinski Aug 2006 B1
7095733 Yarlagadda et al. Aug 2006 B1
7096183 Junqua Aug 2006 B2
7103548 Squibbs et al. Sep 2006 B2
7107204 Liu et al. Sep 2006 B1
7111248 Mulvey et al. Sep 2006 B2
7113803 Dehlin Sep 2006 B2
7113943 Bradford et al. Sep 2006 B2
7115035 Tanaka Oct 2006 B2
7117231 Fischer et al. Oct 2006 B2
7123696 Lowe Oct 2006 B2
7124081 Bellegarda Oct 2006 B1
7124082 Freedman Oct 2006 B2
7124164 Chemtob Oct 2006 B1
7127046 Smith et al. Oct 2006 B1
7127396 Chu et al. Oct 2006 B2
7127403 Saylor et al. Oct 2006 B1
7133900 Szeto Nov 2006 B1
7136710 Hoffberg et al. Nov 2006 B1
7136818 Cosatto et al. Nov 2006 B1
7137126 Coffman et al. Nov 2006 B1
7139697 Häkkinen et al. Nov 2006 B2
7139714 Bennett et al. Nov 2006 B2
7139722 Perrella et al. Nov 2006 B2
7143028 Hillis et al. Nov 2006 B2
7143038 Katae Nov 2006 B2
7143040 Durston et al. Nov 2006 B2
7146437 Robbin et al. Dec 2006 B2
7149319 Roeck Dec 2006 B2
7149695 Bellegarda Dec 2006 B1
7149964 Cottrille et al. Dec 2006 B1
7152070 Musick et al. Dec 2006 B1
7152093 Ludwig et al. Dec 2006 B2
7154526 Foote et al. Dec 2006 B2
7155668 Holland et al. Dec 2006 B2
7158647 Azima et al. Jan 2007 B2
7159174 Johnson et al. Jan 2007 B2
7162412 Yamada et al. Jan 2007 B2
7162482 Dunning Jan 2007 B1
7165073 Vandersluis Jan 2007 B2
7166791 Robbin et al. Jan 2007 B2
7174295 Kivimaki Feb 2007 B1
7174297 Guerra et al. Feb 2007 B2
7177794 Mani et al. Feb 2007 B2
7177798 Hsu et al. Feb 2007 B2
7177817 Khosla et al. Feb 2007 B1
7181386 Mohri et al. Feb 2007 B2
7181388 Tian Feb 2007 B2
7185276 Keswa Feb 2007 B2
7188085 Pelletier Mar 2007 B2
7190794 Hinde Mar 2007 B2
7191118 Bellegarda Mar 2007 B2
7191131 Nagao Mar 2007 B1
7193615 Kim et al. Mar 2007 B2
7194186 Strub et al. Mar 2007 B1
7194413 Mahoney et al. Mar 2007 B2
7194471 Nagatsuka et al. Mar 2007 B1
7194611 Bear et al. Mar 2007 B2
7194699 Thomson et al. Mar 2007 B2
7197120 Luehrig et al. Mar 2007 B2
7197460 Gupta et al. Mar 2007 B1
7200550 Menezes et al. Apr 2007 B2
7200558 Kato et al. Apr 2007 B2
7200559 Wang Apr 2007 B2
7203646 Bennett Apr 2007 B2
7206809 Ludwig et al. Apr 2007 B2
7216008 Sakata May 2007 B2
7216073 Lavi et al. May 2007 B2
7216080 Tsiao et al. May 2007 B2
7218920 Hyon May 2007 B2
7218943 Klassen et al. May 2007 B2
7219063 Schalk et al. May 2007 B2
7219123 Fiechter et al. May 2007 B1
7225125 Bennett et al. May 2007 B2
7228278 Nguyen et al. Jun 2007 B2
7231343 Treadgold et al. Jun 2007 B1
7233790 Kjellberg et al. Jun 2007 B2
7233904 Luisi Jun 2007 B2
7234026 Robbin et al. Jun 2007 B2
7236932 Grajski Jun 2007 B1
7243305 Schabes et al. Jul 2007 B2
7246151 Isaacs et al. Jul 2007 B2
7251454 White Jul 2007 B2
7254773 Bates et al. Aug 2007 B2
7260529 Lengen Aug 2007 B1
7263373 Mattisson Aug 2007 B2
7266189 Day Sep 2007 B1
7266496 Wang et al. Sep 2007 B2
7266499 Surace et al. Sep 2007 B2
7269544 Simske Sep 2007 B2
7269556 Kiss et al. Sep 2007 B2
7275063 Horn Sep 2007 B2
7277088 Robinson et al. Oct 2007 B2
7277854 Bennett et al. Oct 2007 B2
7277855 Acker et al. Oct 2007 B1
7280958 Pavlov et al. Oct 2007 B2
7283072 Plachta et al. Oct 2007 B1
7290039 Lisitsa et al. Oct 2007 B1
7292579 Morris Nov 2007 B2
7292979 Karas et al. Nov 2007 B2
7299033 Kjellberg et al. Nov 2007 B2
7302392 Thenthiruperai et al. Nov 2007 B1
7302686 Togawa Nov 2007 B2
7308408 Stifelman et al. Dec 2007 B1
7310329 Vieri et al. Dec 2007 B2
7310600 Garner et al. Dec 2007 B1
7310605 Janakiraman et al. Dec 2007 B2
7313523 Bellegarda et al. Dec 2007 B1
7315818 Stevens et al. Jan 2008 B2
7319957 Robinson et al. Jan 2008 B2
7321783 Kim Jan 2008 B2
7324833 White et al. Jan 2008 B2
7324947 Jordan et al. Jan 2008 B2
7328155 Endo et al. Feb 2008 B2
7349953 Lisitsa et al. Mar 2008 B2
7353139 Burrell et al. Apr 2008 B1
7359493 Wang et al. Apr 2008 B1
7359671 Richenstein et al. Apr 2008 B2
7359851 Tong et al. Apr 2008 B2
7362738 Taube et al. Apr 2008 B2
7363227 Mapes-Riordan et al. Apr 2008 B2
7365260 Kawashima Apr 2008 B2
7366461 Brown Apr 2008 B1
7373612 Risch et al. May 2008 B2
7376556 Bennett May 2008 B2
7376632 Sadek et al. May 2008 B1
7376645 Bernard May 2008 B2
7378963 Begault et al. May 2008 B1
7379874 Schmid et al. May 2008 B2
7380203 Keely et al. May 2008 B2
7383170 Mills et al. Jun 2008 B2
7386449 Sun et al. Jun 2008 B2
7386799 Clanton et al. Jun 2008 B1
7389224 Elworthy Jun 2008 B1
7389225 Jensen et al. Jun 2008 B1
7392185 Bennett Jun 2008 B2
7394947 Li et al. Jul 2008 B2
7398209 Kennewick et al. Jul 2008 B2
7401300 Nurmi Jul 2008 B2
7403938 Harrison et al. Jul 2008 B2
7404143 Freelander et al. Jul 2008 B2
7409337 Potter et al. Aug 2008 B1
7409347 Bellegarda Aug 2008 B1
7412470 Masuno et al. Aug 2008 B2
7415100 Cooper et al. Aug 2008 B2
7418389 Chu et al. Aug 2008 B2
7418392 Mozer et al. Aug 2008 B1
7426467 Nashida et al. Sep 2008 B2
7427024 Gazdzinski et al. Sep 2008 B1
7428541 Houle Sep 2008 B2
7433869 Gollapudi Oct 2008 B2
7433921 Ludwig et al. Oct 2008 B2
7441184 Frerebeau et al. Oct 2008 B2
7443316 Lim Oct 2008 B2
7447635 Konopka et al. Nov 2008 B1
7454351 Jeschke et al. Nov 2008 B2
7467087 Gillick et al. Dec 2008 B1
7467164 Marsh Dec 2008 B2
7472061 Alewine et al. Dec 2008 B1
7472065 Aaron et al. Dec 2008 B2
7475010 Chao Jan 2009 B2
7475063 Datta et al. Jan 2009 B2
7477238 Fux et al. Jan 2009 B2
7477240 Yanagisawa Jan 2009 B2
7478037 Strong Jan 2009 B2
7478091 Mojsilovic et al. Jan 2009 B2
7478129 Chemtob Jan 2009 B1
7483832 Tischer Jan 2009 B2
7483894 Cao Jan 2009 B2
7487089 Mozer Feb 2009 B2
7487093 Mutsuno et al. Feb 2009 B2
7490034 Finnigan et al. Feb 2009 B2
7496498 Chu et al. Feb 2009 B2
7496512 Zhao et al. Feb 2009 B2
7499923 Kawatani Mar 2009 B2
7502738 Kennewick et al. Mar 2009 B2
7505795 Lim et al. Mar 2009 B1
7508324 Suraqui Mar 2009 B2
7508373 Lin et al. Mar 2009 B2
7516123 Betz et al. Apr 2009 B2
7519327 White Apr 2009 B2
7522927 Fitch et al. Apr 2009 B2
7523036 Akabane et al. Apr 2009 B2
7523108 Cao Apr 2009 B2
7526466 Au Apr 2009 B2
7526738 Ording et al. Apr 2009 B2
7528713 Singh et al. May 2009 B2
7529671 Rockenbeck et al. May 2009 B2
7529676 Koyama May 2009 B2
7535997 McQuaide, Jr. et al. May 2009 B1
7536029 Choi et al. May 2009 B2
7536565 Girish et al. May 2009 B2
7538685 Cooper et al. May 2009 B1
7539619 Seligman et al. May 2009 B1
7539656 Fratkina et al. May 2009 B2
7541940 Upton Jun 2009 B2
7542967 Hurst-Hiller et al. Jun 2009 B2
7543232 Easton, Jr. et al. Jun 2009 B2
7546382 Healey et al. Jun 2009 B2
7546529 Reynar et al. Jun 2009 B2
7548895 Pulsipher Jun 2009 B2
7552045 Barliga et al. Jun 2009 B2
7552055 Lecoeuche Jun 2009 B2
7555431 Bennett Jun 2009 B2
7555496 Lantrip et al. Jun 2009 B1
7558381 Ali et al. Jul 2009 B1
7558730 Davis et al. Jul 2009 B2
7559026 Girish et al. Jul 2009 B2
7561069 Horstemeyer Jul 2009 B2
7562007 Hwang Jul 2009 B2
7565104 Brown et al. Jul 2009 B1
7565380 Venkatachary Jul 2009 B1
7571106 Cao et al. Aug 2009 B2
7577522 Rosenberg Aug 2009 B2
7580551 Srihari et al. Aug 2009 B1
7580576 Wang et al. Aug 2009 B2
7580839 Tamura et al. Aug 2009 B2
7584093 Potter et al. Sep 2009 B2
7593868 Margiloff et al. Sep 2009 B2
7596499 Anguera et al. Sep 2009 B2
7599918 Shen et al. Oct 2009 B2
7603381 Burke et al. Oct 2009 B2
7609179 Diaz-Gutierrez et al. Oct 2009 B2
7613264 Wells et al. Nov 2009 B2
7617094 Aoki et al. Nov 2009 B2
7620407 Donald et al. Nov 2009 B1
7620549 Di Cristo et al. Nov 2009 B2
7624007 Bennett Nov 2009 B2
7627481 Kuo et al. Dec 2009 B1
7630901 Omi Dec 2009 B2
7634409 Kennewick et al. Dec 2009 B2
7634413 Kuo et al. Dec 2009 B1
7636657 Ju et al. Dec 2009 B2
7640160 Di Cristo et al. Dec 2009 B2
7643990 Bellegarda Jan 2010 B1
7647225 Bennett et al. Jan 2010 B2
7649454 Singh et al. Jan 2010 B2
7649877 Vieri et al. Jan 2010 B2
7656393 King et al. Feb 2010 B2
7657424 Bennett Feb 2010 B2
7664558 Lindahl et al. Feb 2010 B2
7664638 Cooper et al. Feb 2010 B2
7669134 Christie et al. Feb 2010 B1
7672841 Bennett Mar 2010 B2
7672952 Isaacson et al. Mar 2010 B2
7673238 Girish et al. Mar 2010 B2
7673340 Cohen et al. Mar 2010 B1
7676026 Baxter, Jr. Mar 2010 B1
7676365 Hwang et al. Mar 2010 B2
7676463 Thompson et al. Mar 2010 B2
7679534 Kay et al. Mar 2010 B2
7680649 Park Mar 2010 B2
7681126 Roose Mar 2010 B2
7683886 Willey Mar 2010 B2
7684985 Dominach et al. Mar 2010 B2
7684990 Caskey et al. Mar 2010 B2
7684991 Stohr et al. Mar 2010 B2
7689408 Chen et al. Mar 2010 B2
7689409 Heinecke Mar 2010 B2
7689421 Li et al. Mar 2010 B2
7693715 Hwang et al. Apr 2010 B2
7693717 Kahn et al. Apr 2010 B2
7693719 Chu et al. Apr 2010 B2
7693720 Kennewick et al. Apr 2010 B2
7698131 Bennett Apr 2010 B2
7702500 Blaedow Apr 2010 B2
7702508 Bennett Apr 2010 B2
7706510 Ng Apr 2010 B2
7707026 Liu Apr 2010 B2
7707027 Balchandran et al. Apr 2010 B2
7707032 Wang et al. Apr 2010 B2
7707221 Dunning et al. Apr 2010 B1
7707267 Lisitsa et al. Apr 2010 B2
7710262 Ruha May 2010 B2
7711129 Lindahl et al. May 2010 B2
7711565 Gazdzinski May 2010 B1
7711672 Au May 2010 B2
7712053 Bradford et al. May 2010 B2
7716056 Weng et al. May 2010 B2
7720674 Kaiser et al. May 2010 B2
7720683 Vermeulen et al. May 2010 B1
7721301 Wong et al. May 2010 B2
7725307 Bennett May 2010 B2
7725318 Gavalda et al. May 2010 B2
7725320 Bennett May 2010 B2
7725321 Bennett May 2010 B2
7725838 Williams May 2010 B2
7729904 Bennett Jun 2010 B2
7729916 Coffman et al. Jun 2010 B2
7734461 Kwak et al. Jun 2010 B2
7743188 Haitani et al. Jun 2010 B2
7747616 Yamada et al. Jun 2010 B2
7752152 Paek et al. Jul 2010 B2
7756868 Lee Jul 2010 B2
7757182 Elliott et al. Jul 2010 B2
7763842 Hsu et al. Jul 2010 B2
7774204 Mozer et al. Aug 2010 B2
7774388 Runchey Aug 2010 B1
7778432 Larsen Aug 2010 B2
7778595 White et al. Aug 2010 B2
7778632 Kurlander et al. Aug 2010 B2
7779353 Grigoriu et al. Aug 2010 B2
7783283 Kuusinen et al. Aug 2010 B2
7783486 Rosser et al. Aug 2010 B2
7797265 Brinker et al. Sep 2010 B2
7797269 Rieman et al. Sep 2010 B2
7801721 Rosart et al. Sep 2010 B2
7801728 Ben-David et al. Sep 2010 B2
7801729 Mozer Sep 2010 B2
7809565 Coifman Oct 2010 B2
7809569 Attwater et al. Oct 2010 B2
7809570 Kennewick et al. Oct 2010 B2
7809610 Cao Oct 2010 B2
7809744 Nevidomski et al. Oct 2010 B2
7818165 Carlgren et al. Oct 2010 B2
7818176 Freeman et al. Oct 2010 B2
7818291 Ferguson et al. Oct 2010 B2
7822608 Cross, Jr. et al. Oct 2010 B2
7823123 Sabbouh Oct 2010 B2
7826945 Zhang et al. Nov 2010 B2
7827047 Anderson et al. Nov 2010 B2
7831423 Schubert Nov 2010 B2
7831426 Bennett Nov 2010 B2
7831432 Bodin et al. Nov 2010 B2
7840400 Lavi et al. Nov 2010 B2
7840447 Kleinrock et al. Nov 2010 B2
7840581 Ross et al. Nov 2010 B2
7848924 Nurminen et al. Dec 2010 B2
7853444 Wang et al. Dec 2010 B2
7853445 Bachenko et al. Dec 2010 B2
7853574 Kraenzel et al. Dec 2010 B2
7853577 Sundaresan et al. Dec 2010 B2
7853664 Wang et al. Dec 2010 B1
7869999 Amato et al. Jan 2011 B2
7870118 Jiang et al. Jan 2011 B2
7873519 Bennett Jan 2011 B2
7873654 Bernard Jan 2011 B2
7877705 Chambers et al. Jan 2011 B2
7880730 Robinson et al. Feb 2011 B2
7881936 Longé et al. Feb 2011 B2
7885844 Cohen et al. Feb 2011 B1
7890330 Ozkaragoz et al. Feb 2011 B2
7890652 Bull et al. Feb 2011 B2
7899666 Varone Mar 2011 B2
7908287 Katragadda Mar 2011 B1
7912702 Bennett Mar 2011 B2
7917367 Di Cristo et al. Mar 2011 B2
7917497 Harrison et al. Mar 2011 B2
7920678 Cooper et al. Apr 2011 B2
7920682 Byrne et al. Apr 2011 B2
7920857 Lau et al. Apr 2011 B2
7925525 Chin Apr 2011 B2
7929805 Wang et al. Apr 2011 B2
7930168 Weng et al. Apr 2011 B2
7930183 Odell et al. Apr 2011 B2
7930197 Ozzie et al. Apr 2011 B2
7941009 Li et al. May 2011 B2
7949529 Weider et al. May 2011 B2
7949534 Davis et al. May 2011 B2
7953679 Chidlovskii et al. May 2011 B2
7962179 Huang Jun 2011 B2
7974844 Sumita Jul 2011 B2
7974972 Cao Jul 2011 B2
7983915 Knight et al. Jul 2011 B2
7983917 Kennewick et al. Jul 2011 B2
7983919 Conkie Jul 2011 B2
7983997 Allen et al. Jul 2011 B2
7984062 Dunning et al. Jul 2011 B2
7986431 Emori et al. Jul 2011 B2
7987151 Schott et al. Jul 2011 B2
7987244 Lewis et al. Jul 2011 B1
7996228 Miller et al. Aug 2011 B2
7999669 Singh et al. Aug 2011 B2
8000453 Cooper et al. Aug 2011 B2
8005664 Hanumanthappa Aug 2011 B2
8005679 Jordan et al. Aug 2011 B2
8006180 Tunning et al. Aug 2011 B2
8015006 Kennewick et al. Sep 2011 B2
8015011 Nagano et al. Sep 2011 B2
8015144 Zheng et al. Sep 2011 B2
8019271 Izdepski Sep 2011 B1
8024195 Mozer et al. Sep 2011 B2
8027836 Baker et al. Sep 2011 B2
8032383 Bhardwaj et al. Oct 2011 B1
8036901 Mozer Oct 2011 B2
8037034 Plachta et al. Oct 2011 B2
8041557 Liu Oct 2011 B2
8041570 Mirkovic et al. Oct 2011 B2
8041611 Kleinrock et al. Oct 2011 B2
8046363 Cha et al. Oct 2011 B2
8050500 Batty et al. Nov 2011 B1
8055502 Clark et al. Nov 2011 B2
8055708 Chitsaz et al. Nov 2011 B2
8065143 Yanagihara Nov 2011 B2
8065155 Gazdzinski Nov 2011 B1
8065156 Gazdzinski Nov 2011 B2
8069046 Kennewick et al. Nov 2011 B2
8069422 Sheshagiri et al. Nov 2011 B2
8073681 Baldwin et al. Dec 2011 B2
8078473 Gazdzinski Dec 2011 B1
8082153 Coffman et al. Dec 2011 B2
8082498 Salamon et al. Dec 2011 B2
8090571 Elshishiny et al. Jan 2012 B2
8095364 Longé et al. Jan 2012 B2
8099289 Mozer et al. Jan 2012 B2
8099418 Inoue et al. Jan 2012 B2
8103510 Sato Jan 2012 B2
8107401 John et al. Jan 2012 B2
8112275 Kennewick et al. Feb 2012 B2
8112280 Lu Feb 2012 B2
8117037 Gazdzinski Feb 2012 B2
8122353 Bouta Feb 2012 B2
8131557 Davis et al. Mar 2012 B2
8135115 Hogg, Jr. et al. Mar 2012 B1
8138912 Singh et al. Mar 2012 B2
8140335 Kennewick et al. Mar 2012 B2
8140567 Padovitz et al. Mar 2012 B2
8150700 Shin et al. Apr 2012 B2
8156005 Vieri Apr 2012 B2
8165321 Paquier et al. Apr 2012 B2
8165886 Gagnon et al. Apr 2012 B1
8166019 Lee et al. Apr 2012 B1
8170790 Lee et al. May 2012 B2
8179370 Yamasani et al. May 2012 B1
8188856 Singh et al. May 2012 B2
8190359 Bourne May 2012 B2
8195467 Mozer et al. Jun 2012 B2
8204238 Mozer Jun 2012 B2
8205788 Gazdzinski et al. Jun 2012 B1
8219406 Yu et al. Jul 2012 B2
8219407 Roy et al. Jul 2012 B1
8219608 Alsafadi et al. Jul 2012 B2
8224649 Chaudhari et al. Jul 2012 B2
8239207 Seligman et al. Aug 2012 B2
8255217 Stent et al. Aug 2012 B2
8275621 Alewine et al. Sep 2012 B2
8285546 Reich Oct 2012 B2
8285551 Gazdzinski Oct 2012 B2
8285553 Gazdzinski Oct 2012 B2
8290777 Nguyen et al. Oct 2012 B1
8290778 Gazdzinski Oct 2012 B2
8290781 Gazdzinski Oct 2012 B2
8296146 Gazdzinski Oct 2012 B2
8296153 Gazdzinski Oct 2012 B2
8296383 Lindahl Oct 2012 B2
8301456 Gazdzinski Oct 2012 B2
8311834 Gazdzinski Nov 2012 B1
8345665 Vieri et al. Jan 2013 B2
8352268 Naik et al. Jan 2013 B2
8352272 Rogers et al. Jan 2013 B2
8355919 Silverman et al. Jan 2013 B2
8359234 Vieri Jan 2013 B2
8370158 Gazdzinski Feb 2013 B2
8371503 Gazdzinski Feb 2013 B2
8374871 Ehsani et al. Feb 2013 B2
8380504 Peden et al. Feb 2013 B1
8381107 Rottler et al. Feb 2013 B2
8396714 Rogers et al. Mar 2013 B2
8428758 Naik et al. Apr 2013 B2
8447612 Gazdzinski May 2013 B2
8498857 Kopparapu et al. Jul 2013 B2
8521513 Millett et al. Aug 2013 B2
8595004 Koshinaka Nov 2013 B2
20010005859 Okuyama et al. Jun 2001 A1
20010020259 Sekiguchi et al. Sep 2001 A1
20010027396 Sato Oct 2001 A1
20010029455 Chin et al. Oct 2001 A1
20010030660 Zainoulline Oct 2001 A1
20010032080 Fukada Oct 2001 A1
20010041021 Boyle et al. Nov 2001 A1
20010042107 Palm Nov 2001 A1
20010044724 Hon et al. Nov 2001 A1
20010047264 Roundtree Nov 2001 A1
20010056342 Piehn et al. Dec 2001 A1
20010056347 Chazan et al. Dec 2001 A1
20020001395 Davis et al. Jan 2002 A1
20020002039 Qureshey et al. Jan 2002 A1
20020002413 Tokue Jan 2002 A1
20020002461 Tetsumoto Jan 2002 A1
20020004703 Gaspard, II Jan 2002 A1
20020010581 Euler et al. Jan 2002 A1
20020010584 Schultz et al. Jan 2002 A1
20020010726 Rogson Jan 2002 A1
20020010798 Ben-Shaul et al. Jan 2002 A1
20020013784 Swanson Jan 2002 A1
20020013852 Janik Jan 2002 A1
20020015064 Robotham et al. Feb 2002 A1
20020021278 Hinckley et al. Feb 2002 A1
20020026315 Miranda Feb 2002 A1
20020026456 Bradford Feb 2002 A1
20020031254 Lantrip et al. Mar 2002 A1
20020031262 Imagawa et al. Mar 2002 A1
20020032564 Ehsani et al. Mar 2002 A1
20020032751 Bharadwaj Mar 2002 A1
20020035467 Morimoto et al. Mar 2002 A1
20020035469 Holzapfel Mar 2002 A1
20020035474 Alpdemir Mar 2002 A1
20020040359 Green et al. Apr 2002 A1
20020042707 Zhao et al. Apr 2002 A1
20020045438 Tagawa et al. Apr 2002 A1
20020045961 Gibbs et al. Apr 2002 A1
20020046025 Hain Apr 2002 A1
20020046315 Miller et al. Apr 2002 A1
20020052730 Nakao May 2002 A1
20020052740 Charlesworth et al. May 2002 A1
20020052747 Sarukkai May 2002 A1
20020054094 Matsuda May 2002 A1
20020055934 Lipscomb et al. May 2002 A1
20020059066 O'hagan May 2002 A1
20020059068 Rose et al. May 2002 A1
20020065659 Isono et al. May 2002 A1
20020067308 Robertson Jun 2002 A1
20020069063 Buchner et al. Jun 2002 A1
20020069220 Tran Jun 2002 A1
20020072816 Shdema et al. Jun 2002 A1
20020072908 Case et al. Jun 2002 A1
20020077082 Cruickshank Jun 2002 A1
20020077817 Atal Jun 2002 A1
20020078041 Wu Jun 2002 A1
20020080163 Morey Jun 2002 A1
20020085037 Leavitt et al. Jul 2002 A1
20020087508 Hull et al. Jul 2002 A1
20020091511 Hellwig et al. Jul 2002 A1
20020095286 Ross et al. Jul 2002 A1
20020099547 Chu et al. Jul 2002 A1
20020099552 Rubin et al. Jul 2002 A1
20020103641 Kuo et al. Aug 2002 A1
20020103646 Kochanski et al. Aug 2002 A1
20020107684 Gao Aug 2002 A1
20020109709 Sagar Aug 2002 A1
20020111810 Khan et al. Aug 2002 A1
20020116082 Gudorf Aug 2002 A1
20020116171 Russell Aug 2002 A1
20020116185 Cooper et al. Aug 2002 A1
20020116189 Yeh et al. Aug 2002 A1
20020120697 Generous et al. Aug 2002 A1
20020120925 Logan Aug 2002 A1
20020122053 Dutta et al. Sep 2002 A1
20020123894 Woodward Sep 2002 A1
20020126097 Savolainen Sep 2002 A1
20020128827 Bu et al. Sep 2002 A1
20020128840 Hinde et al. Sep 2002 A1
20020133347 Schoneburg et al. Sep 2002 A1
20020133348 Pearson et al. Sep 2002 A1
20020135565 Gordon et al. Sep 2002 A1
20020138254 Isaka et al. Sep 2002 A1
20020138265 Stevens et al. Sep 2002 A1
20020138270 Bellegarda et al. Sep 2002 A1
20020138616 Basson et al. Sep 2002 A1
20020140679 Wen Oct 2002 A1
20020143533 Lucas et al. Oct 2002 A1
20020143542 Eide Oct 2002 A1
20020143551 Sharma et al. Oct 2002 A1
20020143826 Day et al. Oct 2002 A1
20020151297 Remboski et al. Oct 2002 A1
20020152045 Dowling et al. Oct 2002 A1
20020152255 Smith et al. Oct 2002 A1
20020154160 Hosokawa Oct 2002 A1
20020161865 Nguyen Oct 2002 A1
20020164000 Cohen et al. Nov 2002 A1
20020165918 Bettis Nov 2002 A1
20020169592 Aityan Nov 2002 A1
20020169605 Damiba et al. Nov 2002 A1
20020173273 Spurgat et al. Nov 2002 A1
20020173889 Odinak et al. Nov 2002 A1
20020173961 Guerra Nov 2002 A1
20020173962 Tang et al. Nov 2002 A1
20020173966 Henton Nov 2002 A1
20020177993 Veditz et al. Nov 2002 A1
20020184189 Hay et al. Dec 2002 A1
20020189426 Hirade et al. Dec 2002 A1
20020191029 Gillespie et al. Dec 2002 A1
20020193996 Squibbs et al. Dec 2002 A1
20020198714 Zhou Dec 2002 A1
20020198715 Belrose Dec 2002 A1
20030001881 Mannheimer et al. Jan 2003 A1
20030002632 Bhogal et al. Jan 2003 A1
20030016770 Trans et al. Jan 2003 A1
20030020760 Takatsu et al. Jan 2003 A1
20030026402 Clapper Feb 2003 A1
20030028380 Freeland et al. Feb 2003 A1
20030033153 Olson et al. Feb 2003 A1
20030033214 Mikkelsen et al. Feb 2003 A1
20030037073 Tokuda et al. Feb 2003 A1
20030037254 Fischer et al. Feb 2003 A1
20030040908 Yang et al. Feb 2003 A1
20030046401 Abbott et al. Mar 2003 A1
20030046434 Flanagin et al. Mar 2003 A1
20030050781 Tamura et al. Mar 2003 A1
20030051136 Curtis et al. Mar 2003 A1
20030061317 Brown et al. Mar 2003 A1
20030074198 Sussman Apr 2003 A1
20030074457 Kluth Apr 2003 A1
20030076301 Tsuk et al. Apr 2003 A1
20030078766 Appelt et al. Apr 2003 A1
20030078780 Kochanski et al. Apr 2003 A1
20030078969 Sprague et al. Apr 2003 A1
20030079024 Hough et al. Apr 2003 A1
20030079038 Robbin et al. Apr 2003 A1
20030080991 Crow et al. May 2003 A1
20030083878 Lee et al. May 2003 A1
20030083884 Odinak et al. May 2003 A1
20030088414 Huang et al. May 2003 A1
20030090467 Hohl et al. May 2003 A1
20030090474 Schaefer May 2003 A1
20030095096 Robbin et al. May 2003 A1
20030097210 Horst et al. May 2003 A1
20030097379 Ireton May 2003 A1
20030097408 Kageyama et al. May 2003 A1
20030098892 Hiipakka May 2003 A1
20030099335 Tanaka et al. May 2003 A1
20030101045 Moffatt et al. May 2003 A1
20030115060 Junqua et al. Jun 2003 A1
20030115064 Gusler et al. Jun 2003 A1
20030115186 Wilkinson et al. Jun 2003 A1
20030115552 Jahnke et al. Jun 2003 A1
20030117365 Shteyn Jun 2003 A1
20030120494 Jost et al. Jun 2003 A1
20030122787 Zimmerman et al. Jul 2003 A1
20030125927 Seme Jul 2003 A1
20030126559 Fuhrmann Jul 2003 A1
20030128819 Lee et al. Jul 2003 A1
20030133694 Yeo Jul 2003 A1
20030134678 Tanaka Jul 2003 A1
20030135740 Talmor et al. Jul 2003 A1
20030144846 Denenberg et al. Jul 2003 A1
20030145285 Miyahira et al. Jul 2003 A1
20030147512 Abburi Aug 2003 A1
20030149557 Cox et al. Aug 2003 A1
20030149567 Schmitz et al. Aug 2003 A1
20030149978 Plotnick Aug 2003 A1
20030152203 Berger et al. Aug 2003 A1
20030154081 Chu et al. Aug 2003 A1
20030157968 Boman et al. Aug 2003 A1
20030158735 Yamada et al. Aug 2003 A1
20030158737 Csicsatka Aug 2003 A1
20030160702 Tanaka Aug 2003 A1
20030163316 Addison et al. Aug 2003 A1
20030164848 Dutta et al. Sep 2003 A1
20030167318 Robbin et al. Sep 2003 A1
20030167335 Alexander Sep 2003 A1
20030171928 Falcon et al. Sep 2003 A1
20030171936 Sall et al. Sep 2003 A1
20030187655 Dunsmuir Oct 2003 A1
20030187844 Li et al. Oct 2003 A1
20030187925 Inala et al. Oct 2003 A1
20030190074 Loudon et al. Oct 2003 A1
20030191645 Zhou Oct 2003 A1
20030193481 Sokolsky Oct 2003 A1
20030195741 Mani et al. Oct 2003 A1
20030197736 Murphy Oct 2003 A1
20030197744 Irvine Oct 2003 A1
20030200858 Xie Oct 2003 A1
20030204392 Finnigan et al. Oct 2003 A1
20030204492 Wolf et al. Oct 2003 A1
20030208756 Macrae et al. Nov 2003 A1
20030210266 Cragun et al. Nov 2003 A1
20030212961 Soin et al. Nov 2003 A1
20030214519 Smith et al. Nov 2003 A1
20030224760 Day Dec 2003 A1
20030228863 Vander Veen et al. Dec 2003 A1
20030228909 Tanaka et al. Dec 2003 A1
20030229490 Etter Dec 2003 A1
20030229616 Wong Dec 2003 A1
20030233230 Ammicht et al. Dec 2003 A1
20030233237 Garside et al. Dec 2003 A1
20030233240 Kaatrasalo Dec 2003 A1
20030234824 Litwiller Dec 2003 A1
20030236663 Dimitrova et al. Dec 2003 A1
20040001396 Keller et al. Jan 2004 A1
20040006467 Anisimovich et al. Jan 2004 A1
20040012556 Yong et al. Jan 2004 A1
20040013252 Craner Jan 2004 A1
20040021676 Chen et al. Feb 2004 A1
20040022373 Suder et al. Feb 2004 A1
20040023643 Vander Veen et al. Feb 2004 A1
20040030556 Bennett Feb 2004 A1
20040030996 Van Liempd et al. Feb 2004 A1
20040036715 Warren Feb 2004 A1
20040048627 Olvera-Hernandez Mar 2004 A1
20040049391 Polanyi et al. Mar 2004 A1
20040051729 Borden, IV Mar 2004 A1
20040052338 Celi, Jr. et al. Mar 2004 A1
20040054534 Junqua Mar 2004 A1
20040054535 Mackie et al. Mar 2004 A1
20040054541 Kryze et al. Mar 2004 A1
20040054690 Hillerbrand et al. Mar 2004 A1
20040055446 Robbin et al. Mar 2004 A1
20040056899 Sinclair, II et al. Mar 2004 A1
20040059577 Pickering Mar 2004 A1
20040059790 Austin-Lane et al. Mar 2004 A1
20040061717 Menon et al. Apr 2004 A1
20040062367 Fellenstein et al. Apr 2004 A1
20040064593 Sinclair et al. Apr 2004 A1
20040069122 Wilson Apr 2004 A1
20040070567 Longe et al. Apr 2004 A1
20040070612 Sinclair et al. Apr 2004 A1
20040073427 Moore Apr 2004 A1
20040073428 Zlokarnik et al. Apr 2004 A1
20040076086 Keller et al. Apr 2004 A1
20040078382 Mercer et al. Apr 2004 A1
20040085162 Agarwal et al. May 2004 A1
20040086120 Akins, III et al. May 2004 A1
20040093213 Conkie May 2004 A1
20040093215 Gupta et al. May 2004 A1
20040094018 Ueshima et al. May 2004 A1
20040100479 Nakano et al. May 2004 A1
20040106432 Kanamori et al. Jun 2004 A1
20040107169 Lowe Jun 2004 A1
20040111266 Coorman et al. Jun 2004 A1
20040111332 Baar et al. Jun 2004 A1
20040114731 Gillett et al. Jun 2004 A1
20040122656 Abir Jun 2004 A1
20040124583 Landis Jul 2004 A1
20040125088 Zimmerman et al. Jul 2004 A1
20040125922 Specht Jul 2004 A1
20040127198 Roskind et al. Jul 2004 A1
20040127241 Shostak Jul 2004 A1
20040128137 Bush et al. Jul 2004 A1
20040133817 Choi Jul 2004 A1
20040135701 Yasuda et al. Jul 2004 A1
20040135774 La Monica Jul 2004 A1
20040136510 Vander Veen Jul 2004 A1
20040138869 Heinecke Jul 2004 A1
20040145607 Alderson Jul 2004 A1
20040153306 Tanner et al. Aug 2004 A1
20040160419 Padgitt Aug 2004 A1
20040162741 Flaxer et al. Aug 2004 A1
20040176958 Salmenkaita et al. Sep 2004 A1
20040177319 Horn Sep 2004 A1
20040178994 Kairls, Jr. Sep 2004 A1
20040183833 Chua Sep 2004 A1
20040186713 Gomas et al. Sep 2004 A1
20040186714 Baker Sep 2004 A1
20040186777 Margiloff et al. Sep 2004 A1
20040193398 Chu et al. Sep 2004 A1
20040193420 Kennewick et al. Sep 2004 A1
20040193421 Blass Sep 2004 A1
20040193426 Maddux et al. Sep 2004 A1
20040196256 Wobbrock et al. Oct 2004 A1
20040198436 Alden Oct 2004 A1
20040199375 Ehsani et al. Oct 2004 A1
20040199387 Wang et al. Oct 2004 A1
20040199663 Horvitz et al. Oct 2004 A1
20040203520 Schirtzinger et al. Oct 2004 A1
20040205151 Sprigg et al. Oct 2004 A1
20040205671 Sukehiro et al. Oct 2004 A1
20040208302 Urban et al. Oct 2004 A1
20040210634 Ferrer et al. Oct 2004 A1
20040215731 Tzann-en Szeto Oct 2004 A1
20040218451 Said et al. Nov 2004 A1
20040220798 Chi et al. Nov 2004 A1
20040223485 Arellano et al. Nov 2004 A1
20040224638 Fadell et al. Nov 2004 A1
20040225746 Niell et al. Nov 2004 A1
20040236778 Junqua et al. Nov 2004 A1
20040242286 Benco et al. Dec 2004 A1
20040243419 Wang Dec 2004 A1
20040249667 Oon Dec 2004 A1
20040252119 Hunleth et al. Dec 2004 A1
20040252604 Johnson et al. Dec 2004 A1
20040252966 Holloway et al. Dec 2004 A1
20040254792 Busayapongchai et al. Dec 2004 A1
20040257432 Girish et al. Dec 2004 A1
20040259536 Keskar et al. Dec 2004 A1
20040263636 Cutler et al. Dec 2004 A1
20040267825 Novak et al. Dec 2004 A1
20040268262 Gupta et al. Dec 2004 A1
20050002507 Timmins et al. Jan 2005 A1
20050015254 Beaman Jan 2005 A1
20050015772 Saare et al. Jan 2005 A1
20050022114 Shanahan et al. Jan 2005 A1
20050024341 Gillespie et al. Feb 2005 A1
20050024345 Eastty et al. Feb 2005 A1
20050027385 Yueh Feb 2005 A1
20050030175 Wolfe Feb 2005 A1
20050031106 Henderson Feb 2005 A1
20050033582 Gadd et al. Feb 2005 A1
20050033771 Schmitter et al. Feb 2005 A1
20050044569 Marcus Feb 2005 A1
20050045373 Born Mar 2005 A1
20050049880 Roth et al. Mar 2005 A1
20050055403 Brittan Mar 2005 A1
20050058438 Hayashi Mar 2005 A1
20050060155 Chu et al. Mar 2005 A1
20050071165 Hofstader et al. Mar 2005 A1
20050071332 Ortega et al. Mar 2005 A1
20050071437 Bear et al. Mar 2005 A1
20050074113 Mathew et al. Apr 2005 A1
20050080613 Colledge et al. Apr 2005 A1
20050080625 Bennett et al. Apr 2005 A1
20050080632 Endo et al. Apr 2005 A1
20050080780 Colledge et al. Apr 2005 A1
20050086059 Bennett Apr 2005 A1
20050086605 Ferrer et al. Apr 2005 A1
20050091118 Fano Apr 2005 A1
20050099398 Garside et al. May 2005 A1
20050100214 Zhang et al. May 2005 A1
20050102144 Rapoport May 2005 A1
20050102614 Brockett et al. May 2005 A1
20050102625 Lee et al. May 2005 A1
20050108001 Aarskog May 2005 A1
20050108074 Bloechl et al. May 2005 A1
20050108338 Simske et al. May 2005 A1
20050108344 Tafoya et al. May 2005 A1
20050114124 Liu et al. May 2005 A1
20050114140 Brackett et al. May 2005 A1
20050119890 Hirose Jun 2005 A1
20050119897 Bennett et al. Jun 2005 A1
20050125216 Chitrapura et al. Jun 2005 A1
20050125235 Lazay et al. Jun 2005 A1
20050131951 Zhang et al. Jun 2005 A1
20050132301 Ikeda Jun 2005 A1
20050136949 Barnes Jun 2005 A1
20050138305 Zellner Jun 2005 A1
20050140504 Marshall et al. Jun 2005 A1
20050143972 Gopalakrishnan et al. Jun 2005 A1
20050144003 Iso-Sipila Jun 2005 A1
20050144070 Cheshire Jun 2005 A1
20050144568 Gruen et al. Jun 2005 A1
20050148356 Ferguson et al. Jul 2005 A1
20050149214 Yoo et al. Jul 2005 A1
20050149330 Katae Jul 2005 A1
20050149332 Kuzunuki et al. Jul 2005 A1
20050149510 Shafrir Jul 2005 A1
20050152558 Van Tassel Jul 2005 A1
20050152602 Chen et al. Jul 2005 A1
20050154578 Tong et al. Jul 2005 A1
20050162395 Unruh Jul 2005 A1
20050165607 DiFabbrizio et al. Jul 2005 A1
20050166153 Eytchison et al. Jul 2005 A1
20050177445 Church Aug 2005 A1
20050181770 Helferich Aug 2005 A1
20050182616 Kotipalli Aug 2005 A1
20050182627 Tanaka et al. Aug 2005 A1
20050182628 Choi Aug 2005 A1
20050182629 Coorman et al. Aug 2005 A1
20050182630 Miro et al. Aug 2005 A1
20050187773 Filoche et al. Aug 2005 A1
20050190970 Griffin Sep 2005 A1
20050192801 Lewis et al. Sep 2005 A1
20050195429 Archbold Sep 2005 A1
20050196733 Budra et al. Sep 2005 A1
20050201572 Lindahl et al. Sep 2005 A1
20050203747 Lecoeuche Sep 2005 A1
20050203991 Kawamura et al. Sep 2005 A1
20050209848 Ishii Sep 2005 A1
20050210394 Crandall et al. Sep 2005 A1
20050216331 Ahrens et al. Sep 2005 A1
20050222843 Kahn et al. Oct 2005 A1
20050222973 Kaiser Oct 2005 A1
20050228665 Kobayashi et al. Oct 2005 A1
20050245243 Zuniga Nov 2005 A1
20050246350 Canaran Nov 2005 A1
20050246365 Lowles et al. Nov 2005 A1
20050271216 Lashkari Dec 2005 A1
20050273337 Erell et al. Dec 2005 A1
20050273626 Pearson et al. Dec 2005 A1
20050278297 Nelson Dec 2005 A1
20050278643 Ukai et al. Dec 2005 A1
20050278647 Leavitt et al. Dec 2005 A1
20050283364 Longe et al. Dec 2005 A1
20050283726 Lunati Dec 2005 A1
20050288934 Omi Dec 2005 A1
20050288936 Busayapongchai et al. Dec 2005 A1
20050289463 Wu et al. Dec 2005 A1
20060001652 Chiu et al. Jan 2006 A1
20060004570 Ju et al. Jan 2006 A1
20060004744 Nevidomski et al. Jan 2006 A1
20060007174 Shen Jan 2006 A1
20060009973 Nguyen et al. Jan 2006 A1
20060013414 Shih Jan 2006 A1
20060015819 Hawkins et al. Jan 2006 A1
20060018446 Schmandt et al. Jan 2006 A1
20060018492 Chiu et al. Jan 2006 A1
20060026233 Tenembaum et al. Feb 2006 A1
20060026521 Hotelling et al. Feb 2006 A1
20060026535 Hotelling et al. Feb 2006 A1
20060033724 Chaudhri et al. Feb 2006 A1
20060041424 Todhunter et al. Feb 2006 A1
20060041431 Maes Feb 2006 A1
20060047632 Zhang Mar 2006 A1
20060050865 Kortum et al. Mar 2006 A1
20060053379 Henderson et al. Mar 2006 A1
20060061488 Dunton Mar 2006 A1
20060067535 Culbert et al. Mar 2006 A1
20060067536 Culbert et al. Mar 2006 A1
20060069567 Tischer et al. Mar 2006 A1
20060072248 Watanabe et al. Apr 2006 A1
20060072716 Pham Apr 2006 A1
20060074660 Waters et al. Apr 2006 A1
20060074674 Zhang et al. Apr 2006 A1
20060074750 Clark et al. Apr 2006 A1
20060074898 Gavalda et al. Apr 2006 A1
20060077055 Basir Apr 2006 A1
20060085187 Barquilla Apr 2006 A1
20060085465 Nori et al. Apr 2006 A1
20060095265 Chu et al. May 2006 A1
20060095846 Nurmi May 2006 A1
20060095848 Naik May 2006 A1
20060100848 Cozzi et al. May 2006 A1
20060100849 Chan May 2006 A1
20060106592 Brockett et al. May 2006 A1
20060106594 Brockett et al. May 2006 A1
20060106595 Brockett et al. May 2006 A1
20060111906 Cross et al. May 2006 A1
20060116874 Samuelsson et al. Jun 2006 A1
20060117002 Swen Jun 2006 A1
20060119582 Ng et al. Jun 2006 A1
20060122834 Bennett Jun 2006 A1
20060122836 Cross et al. Jun 2006 A1
20060129929 Weber et al. Jun 2006 A1
20060143007 Koh et al. Jun 2006 A1
20060143576 Gupta et al. Jun 2006 A1
20060152496 Knaven Jul 2006 A1
20060153040 Girish et al. Jul 2006 A1
20060156252 Sheshagiri et al. Jul 2006 A1
20060161872 Rytivaara et al. Jul 2006 A1
20060167676 Plumb Jul 2006 A1
20060168150 Naik et al. Jul 2006 A1
20060168507 Hansen Jul 2006 A1
20060168539 Hawkins et al. Jul 2006 A1
20060174207 Deshpande Aug 2006 A1
20060184886 Chung et al. Aug 2006 A1
20060187073 Lin et al. Aug 2006 A1
20060190269 Tessel et al. Aug 2006 A1
20060190577 Yamada Aug 2006 A1
20060193518 Dong Aug 2006 A1
20060195206 Moon et al. Aug 2006 A1
20060197753 Hotelling Sep 2006 A1
20060197755 Bawany Sep 2006 A1
20060200253 Hoffberg et al. Sep 2006 A1
20060200342 Corston-Oliver et al. Sep 2006 A1
20060205432 Hawkins et al. Sep 2006 A1
20060206454 Forstall et al. Sep 2006 A1
20060212415 Backer et al. Sep 2006 A1
20060217967 Goertzen et al. Sep 2006 A1
20060221788 Lindahl et al. Oct 2006 A1
20060229870 Kobal Oct 2006 A1
20060229876 Aaron et al. Oct 2006 A1
20060234680 Doulton Oct 2006 A1
20060235550 Csicsatka et al. Oct 2006 A1
20060235700 Wong et al. Oct 2006 A1
20060235841 Betz et al. Oct 2006 A1
20060236262 Bathiche et al. Oct 2006 A1
20060239419 Joseph et al. Oct 2006 A1
20060239471 Mao et al. Oct 2006 A1
20060240866 Eilts Oct 2006 A1
20060242190 Wnek Oct 2006 A1
20060246955 Nirhamo et al. Nov 2006 A1
20060247931 Caskey et al. Nov 2006 A1
20060252457 Schrager Nov 2006 A1
20060253210 Rosenberg Nov 2006 A1
20060253787 Fogg Nov 2006 A1
20060256934 Mazor Nov 2006 A1
20060262876 LaDue Nov 2006 A1
20060265208 Assadollahi Nov 2006 A1
20060265503 Jones et al. Nov 2006 A1
20060265648 Rainisto et al. Nov 2006 A1
20060274051 Longe et al. Dec 2006 A1
20060274905 Lindahl et al. Dec 2006 A1
20060277058 J'maev et al. Dec 2006 A1
20060282264 Denny et al. Dec 2006 A1
20060282415 Shibata et al. Dec 2006 A1
20060288024 Braica Dec 2006 A1
20060293876 Kamatani et al. Dec 2006 A1
20060293880 Elshishiny et al. Dec 2006 A1
20060293886 Odell et al. Dec 2006 A1
20070003026 Hodge et al. Jan 2007 A1
20070004451 C. Anderson Jan 2007 A1
20070005849 Oliver Jan 2007 A1
20070006098 Krumm et al. Jan 2007 A1
20070011154 Musgrove et al. Jan 2007 A1
20070016563 Omoigui Jan 2007 A1
20070016865 Johnson et al. Jan 2007 A1
20070021956 Qu et al. Jan 2007 A1
20070025704 Tsukazaki et al. Feb 2007 A1
20070026852 Logan et al. Feb 2007 A1
20070027732 Hudgens Feb 2007 A1
20070028009 Robbin et al. Feb 2007 A1
20070032247 Shaffer et al. Feb 2007 A1
20070033003 Morris Feb 2007 A1
20070038436 Cristo et al. Feb 2007 A1
20070038609 Wu Feb 2007 A1
20070040813 Kushler et al. Feb 2007 A1
20070041361 Iso-Sipila Feb 2007 A1
20070043568 Dhanakshirur et al. Feb 2007 A1
20070044038 Horentrup et al. Feb 2007 A1
20070046641 Lim Mar 2007 A1
20070047719 Dhawan et al. Mar 2007 A1
20070050184 Drucker et al. Mar 2007 A1
20070050191 Weider et al. Mar 2007 A1
20070050393 Vogel et al. Mar 2007 A1
20070050712 Hull et al. Mar 2007 A1
20070052586 Horstemeyer Mar 2007 A1
20070055493 Lee Mar 2007 A1
20070055514 Beattie et al. Mar 2007 A1
20070055525 Kennewick et al. Mar 2007 A1
20070055529 Kanevsky et al. Mar 2007 A1
20070058832 Hug et al. Mar 2007 A1
20070061487 Moore et al. Mar 2007 A1
20070061754 Ardhanari et al. Mar 2007 A1
20070067272 Flynt et al. Mar 2007 A1
20070073540 Hirakawa et al. Mar 2007 A1
20070073541 Tian Mar 2007 A1
20070080936 Tsuk et al. Apr 2007 A1
20070083467 Lindahl et al. Apr 2007 A1
20070083623 Nishimura et al. Apr 2007 A1
20070088556 Andrew Apr 2007 A1
20070089132 Qureshey et al. Apr 2007 A1
20070089135 Qureshey et al. Apr 2007 A1
20070093277 Cavacuiti et al. Apr 2007 A1
20070094026 Ativanichayaphong et al. Apr 2007 A1
20070098195 Holmes May 2007 A1
20070100206 Lin et al. May 2007 A1
20070100602 Kim May 2007 A1
20070100635 Mahajan et al. May 2007 A1
20070100790 Cheyer et al. May 2007 A1
20070100883 Rose et al. May 2007 A1
20070106513 Boillot et al. May 2007 A1
20070106674 Agrawal et al. May 2007 A1
20070116195 Thompson et al. May 2007 A1
20070118377 Badino et al. May 2007 A1
20070118378 Skuratovsky May 2007 A1
20070121846 Altberg et al. May 2007 A1
20070124149 Shen et al. May 2007 A1
20070124676 Amundsen et al. May 2007 A1
20070127888 Hayashi et al. Jun 2007 A1
20070128777 Yin et al. Jun 2007 A1
20070129059 Nadarajah et al. Jun 2007 A1
20070130014 Altberg et al. Jun 2007 A1
20070130128 Garg et al. Jun 2007 A1
20070132738 Lowles et al. Jun 2007 A1
20070135949 Snover et al. Jun 2007 A1
20070136064 Carroll Jun 2007 A1
20070136778 Birger et al. Jun 2007 A1
20070152978 Kocienda et al. Jul 2007 A1
20070155346 Mijatovic et al. Jul 2007 A1
20070156410 Stohr et al. Jul 2007 A1
20070157268 Girish et al. Jul 2007 A1
20070162296 Altberg et al. Jul 2007 A1
20070162414 Horowitz et al. Jul 2007 A1
20070173233 Vander Veen et al. Jul 2007 A1
20070173267 Klassen et al. Jul 2007 A1
20070174188 Fish Jul 2007 A1
20070174396 Kumar et al. Jul 2007 A1
20070180383 Naik Aug 2007 A1
20070182595 Ghasabian Aug 2007 A1
20070185551 Meadows et al. Aug 2007 A1
20070185754 Schmidt Aug 2007 A1
20070185831 Churcher Aug 2007 A1
20070185917 Prahlad et al. Aug 2007 A1
20070188901 Heckerman et al. Aug 2007 A1
20070192027 Lee et al. Aug 2007 A1
20070192105 Neeracher et al. Aug 2007 A1
20070192293 Swen Aug 2007 A1
20070192403 Heine et al. Aug 2007 A1
20070192744 Reponen Aug 2007 A1
20070198269 Braho et al. Aug 2007 A1
20070198273 Hennecke Aug 2007 A1
20070198566 Sustik Aug 2007 A1
20070207785 Chatterjee et al. Sep 2007 A1
20070208569 Subramanian et al. Sep 2007 A1
20070208579 Peterson Sep 2007 A1
20070208726 Krishnaprasad et al. Sep 2007 A1
20070211071 Slotznick et al. Sep 2007 A1
20070213099 Bast Sep 2007 A1
20070213857 Bodin et al. Sep 2007 A1
20070219777 Chu et al. Sep 2007 A1
20070219803 Chiu et al. Sep 2007 A1
20070225980 Sumita Sep 2007 A1
20070225984 Milstein et al. Sep 2007 A1
20070226652 Kikuchi et al. Sep 2007 A1
20070229323 Plachta et al. Oct 2007 A1
20070233490 Yao Oct 2007 A1
20070238520 Kacmarcik Oct 2007 A1
20070239429 Johnson et al. Oct 2007 A1
20070244702 Kahn et al. Oct 2007 A1
20070255435 Cohen et al. Nov 2007 A1
20070255979 Deily et al. Nov 2007 A1
20070260460 Hyatt Nov 2007 A1
20070260595 Beatty et al. Nov 2007 A1
20070260822 Adams Nov 2007 A1
20070261080 Saetti Nov 2007 A1
20070265831 Dinur et al. Nov 2007 A1
20070271510 Grigoriu et al. Nov 2007 A1
20070274468 Cai Nov 2007 A1
20070276651 Bliss et al. Nov 2007 A1
20070276714 Beringer Nov 2007 A1
20070276810 Rosen Nov 2007 A1
20070282595 Tunning et al. Dec 2007 A1
20070285958 Platchta et al. Dec 2007 A1
20070286363 Burg et al. Dec 2007 A1
20070288241 Cross et al. Dec 2007 A1
20070288449 Datta et al. Dec 2007 A1
20070291108 Huber et al. Dec 2007 A1
20070294077 Narayanan et al. Dec 2007 A1
20070294263 Punj et al. Dec 2007 A1
20070299664 Peters et al. Dec 2007 A1
20080010355 Vieri et al. Jan 2008 A1
20080012950 Lee et al. Jan 2008 A1
20080013751 Hiselius Jan 2008 A1
20080015864 Ross et al. Jan 2008 A1
20080016575 Vincent et al. Jan 2008 A1
20080021708 Bennett et al. Jan 2008 A1
20080022208 Morse Jan 2008 A1
20080031475 Goldstein Feb 2008 A1
20080034032 Healey et al. Feb 2008 A1
20080034044 Bhakta et al. Feb 2008 A1
20080040339 Zhou et al. Feb 2008 A1
20080042970 Liang et al. Feb 2008 A1
20080043936 Liebermann Feb 2008 A1
20080043943 Sipher et al. Feb 2008 A1
20080046239 Boo Feb 2008 A1
20080046422 Lee et al. Feb 2008 A1
20080046948 Verosub Feb 2008 A1
20080048908 Sato Feb 2008 A1
20080052063 Bennett et al. Feb 2008 A1
20080052073 Goto et al. Feb 2008 A1
20080052077 Bennett et al. Feb 2008 A1
20080056459 Vallier et al. Mar 2008 A1
20080056579 Guha Mar 2008 A1
20080059190 Chu et al. Mar 2008 A1
20080059200 Puli Mar 2008 A1
20080059876 Hantler et al. Mar 2008 A1
20080065382 Gerl et al. Mar 2008 A1
20080071529 Silverman et al. Mar 2008 A1
20080071544 Beaufays et al. Mar 2008 A1
20080075296 Lindahl et al. Mar 2008 A1
20080077384 Agapi et al. Mar 2008 A1
20080077393 Gao et al. Mar 2008 A1
20080077406 Ganong, III Mar 2008 A1
20080077859 Schabes et al. Mar 2008 A1
20080079566 Singh et al. Apr 2008 A1
20080082332 Mallett et al. Apr 2008 A1
20080082338 O'Neil et al. Apr 2008 A1
20080082390 Hawkins et al. Apr 2008 A1
20080082576 Bodin et al. Apr 2008 A1
20080082651 Singh et al. Apr 2008 A1
20080091406 Baldwin et al. Apr 2008 A1
20080091426 Rempel et al. Apr 2008 A1
20080091443 Strope et al. Apr 2008 A1
20080096726 Riley et al. Apr 2008 A1
20080097937 Hadjarian Apr 2008 A1
20080098302 Roose Apr 2008 A1
20080100579 Robinson et al. May 2008 A1
20080109222 Liu May 2008 A1
20080114480 Harb May 2008 A1
20080114598 Prieto et al. May 2008 A1
20080114841 Lambert May 2008 A1
20080118143 Gordon et al. May 2008 A1
20080120102 Rao May 2008 A1
20080120112 Jordan et al. May 2008 A1
20080120342 Reed et al. May 2008 A1
20080126100 Grost et al. May 2008 A1
20080129520 Lee Jun 2008 A1
20080130867 Bowen Jun 2008 A1
20080131006 Oliver Jun 2008 A1
20080133215 Sarukkai Jun 2008 A1
20080133228 Rao Jun 2008 A1
20080133241 Baker et al. Jun 2008 A1
20080140413 Millman et al. Jun 2008 A1
20080140416 Shostak Jun 2008 A1
20080140652 Millman et al. Jun 2008 A1
20080140657 Azvine et al. Jun 2008 A1
20080141180 Reed et al. Jun 2008 A1
20080146290 Sreeram et al. Jun 2008 A1
20080147408 Da Palma et al. Jun 2008 A1
20080147411 Dames et al. Jun 2008 A1
20080154612 Evermann et al. Jun 2008 A1
20080157867 Krah Jul 2008 A1
20080163131 Hirai et al. Jul 2008 A1
20080165144 Forstall et al. Jul 2008 A1
20080165980 Pavlovic et al. Jul 2008 A1
20080165994 Caren et al. Jul 2008 A1
20080167013 Novick et al. Jul 2008 A1
20080167858 Christie et al. Jul 2008 A1
20080168366 Kocienda et al. Jul 2008 A1
20080183473 Nagano et al. Jul 2008 A1
20080189099 Friedman et al. Aug 2008 A1
20080189106 Low et al. Aug 2008 A1
20080189110 Freeman et al. Aug 2008 A1
20080189114 Fail et al. Aug 2008 A1
20080189606 Rybak Aug 2008 A1
20080195601 Ntoulas et al. Aug 2008 A1
20080195940 Gail et al. Aug 2008 A1
20080201375 Khedouri et al. Aug 2008 A1
20080204379 Perez-Noguera Aug 2008 A1
20080207176 Brackbill et al. Aug 2008 A1
20080208585 Ativanichayaphong et al. Aug 2008 A1
20080208587 Ben-david et al. Aug 2008 A1
20080212796 Denda Sep 2008 A1
20080221866 Katragadda et al. Sep 2008 A1
20080221880 Cerra et al. Sep 2008 A1
20080221889 Cerra et al. Sep 2008 A1
20080221903 Kanevsky et al. Sep 2008 A1
20080222118 Scian et al. Sep 2008 A1
20080228463 Mori et al. Sep 2008 A1
20080228485 Owen Sep 2008 A1
20080228490 Fischer et al. Sep 2008 A1
20080228496 Yu et al. Sep 2008 A1
20080228928 Donelli et al. Sep 2008 A1
20080229185 Lynch Sep 2008 A1
20080235024 Goldberg et al. Sep 2008 A1
20080240569 Tonouchi Oct 2008 A1
20080242280 Shapiro et al. Oct 2008 A1
20080244390 Fux et al. Oct 2008 A1
20080247519 Abella et al. Oct 2008 A1
20080248797 Freeman et al. Oct 2008 A1
20080249770 Kim et al. Oct 2008 A1
20080253577 Eppolito Oct 2008 A1
20080255845 Bennett Oct 2008 A1
20080256613 Grover Oct 2008 A1
20080259022 Mansfield et al. Oct 2008 A1
20080262838 Nurminen et al. Oct 2008 A1
20080262846 Burns et al. Oct 2008 A1
20080270118 Kuo et al. Oct 2008 A1
20080270138 Knight et al. Oct 2008 A1
20080270139 Shi et al. Oct 2008 A1
20080270140 Hertz et al. Oct 2008 A1
20080281510 Shahine Nov 2008 A1
20080292112 Valenzuela et al. Nov 2008 A1
20080294651 Masuyama et al. Nov 2008 A1
20080298766 Wen et al. Dec 2008 A1
20080300871 Gilbert Dec 2008 A1
20080300878 Bennett Dec 2008 A1
20080306727 Thurmair et al. Dec 2008 A1
20080312909 Hermansen et al. Dec 2008 A1
20080313335 Jung et al. Dec 2008 A1
20080319753 Hancock Dec 2008 A1
20080319763 Di Fabbrizio et al. Dec 2008 A1
20090003115 Lindahl et al. Jan 2009 A1
20090005012 Van Heugten Jan 2009 A1
20090005891 Batson et al. Jan 2009 A1
20090006097 Etezadi et al. Jan 2009 A1
20090006100 Badger et al. Jan 2009 A1
20090006343 Platt et al. Jan 2009 A1
20090006488 Lindahl et al. Jan 2009 A1
20090006671 Batson et al. Jan 2009 A1
20090007001 Morin et al. Jan 2009 A1
20090011709 Akasaka et al. Jan 2009 A1
20090012748 Beish et al. Jan 2009 A1
20090012775 El Hady et al. Jan 2009 A1
20090018828 Nakadai et al. Jan 2009 A1
20090018835 Cooper et al. Jan 2009 A1
20090018840 Lutz et al. Jan 2009 A1
20090022329 Mahowald Jan 2009 A1
20090028435 Wu et al. Jan 2009 A1
20090030800 Grois Jan 2009 A1
20090030978 Johnson et al. Jan 2009 A1
20090043583 Agapi et al. Feb 2009 A1
20090048821 Yam et al. Feb 2009 A1
20090048845 Burckart et al. Feb 2009 A1
20090049067 Murray Feb 2009 A1
20090055179 Cho et al. Feb 2009 A1
20090055186 Lance et al. Feb 2009 A1
20090058823 Kocienda Mar 2009 A1
20090060472 Bull et al. Mar 2009 A1
20090063974 Bull et al. Mar 2009 A1
20090064031 Bull et al. Mar 2009 A1
20090070097 Wu et al. Mar 2009 A1
20090070102 Maegawa Mar 2009 A1
20090070114 Staszak Mar 2009 A1
20090074214 Bradford et al. Mar 2009 A1
20090076792 Lawson-Tancred Mar 2009 A1
20090076796 Daraselia Mar 2009 A1
20090076819 Wouters et al. Mar 2009 A1
20090076821 Brenner et al. Mar 2009 A1
20090076825 Bradford et al. Mar 2009 A1
20090077165 Rhodes et al. Mar 2009 A1
20090083035 Huang et al. Mar 2009 A1
20090083036 Zhao et al. Mar 2009 A1
20090083037 Gleason et al. Mar 2009 A1
20090083047 Lindahl et al. Mar 2009 A1
20090092260 Powers Apr 2009 A1
20090092261 Bard Apr 2009 A1
20090092262 Costa et al. Apr 2009 A1
20090094029 Koch et al. Apr 2009 A1
20090094033 Mozer et al. Apr 2009 A1
20090100049 Cao Apr 2009 A1
20090100454 Weber Apr 2009 A1
20090106026 Ferrieux Apr 2009 A1
20090106376 Tom et al. Apr 2009 A1
20090106397 O'Keefe Apr 2009 A1
20090112572 Thorn Apr 2009 A1
20090112677 Rhett Apr 2009 A1
20090112892 Cardie et al. Apr 2009 A1
20090123021 Jung et al. May 2009 A1
20090123071 Iwasaki May 2009 A1
20090125477 Lu et al. May 2009 A1
20090137286 Luke et al. May 2009 A1
20090138736 Chin May 2009 A1
20090138828 Schultz et al. May 2009 A1
20090144049 Haddad et al. Jun 2009 A1
20090144609 Liang et al. Jun 2009 A1
20090146848 Ghassabian Jun 2009 A1
20090150147 Jacoby et al. Jun 2009 A1
20090150156 Kennewick et al. Jun 2009 A1
20090154669 Wood et al. Jun 2009 A1
20090157382 Bar Jun 2009 A1
20090157384 Toutanova et al. Jun 2009 A1
20090157401 Bennett Jun 2009 A1
20090158423 Orlassino et al. Jun 2009 A1
20090164441 Cheyer Jun 2009 A1
20090164655 Pettersson et al. Jun 2009 A1
20090167508 Fadell et al. Jul 2009 A1
20090167509 Fadell et al. Jul 2009 A1
20090171664 Kennewick et al. Jul 2009 A1
20090172542 Girish et al. Jul 2009 A1
20090174667 Kocienda et al. Jul 2009 A1
20090177461 Ehsani et al. Jul 2009 A1
20090182445 Girish et al. Jul 2009 A1
20090187577 Reznik et al. Jul 2009 A1
20090191895 Singh et al. Jul 2009 A1
20090192782 Drewes Jul 2009 A1
20090198497 Kwon Aug 2009 A1
20090204409 Mozer et al. Aug 2009 A1
20090213134 Stephanick et al. Aug 2009 A1
20090216704 Zheng et al. Aug 2009 A1
20090222488 Boerries et al. Sep 2009 A1
20090228273 Wang et al. Sep 2009 A1
20090228281 Singleton et al. Sep 2009 A1
20090234655 Kwon Sep 2009 A1
20090239552 Churchill et al. Sep 2009 A1
20090240485 Dalal et al. Sep 2009 A1
20090241760 Georges Oct 2009 A1
20090247237 Mittleman et al. Oct 2009 A1
20090248182 Logan et al. Oct 2009 A1
20090249198 Davis et al. Oct 2009 A1
20090252350 Seguin Oct 2009 A1
20090253457 Seguin Oct 2009 A1
20090253463 Shin et al. Oct 2009 A1
20090254339 Seguin Oct 2009 A1
20090254345 Fleizach et al. Oct 2009 A1
20090271109 Lee et al. Oct 2009 A1
20090271175 Bodin et al. Oct 2009 A1
20090271176 Bodin et al. Oct 2009 A1
20090271178 Bodin et al. Oct 2009 A1
20090274315 Carnes et al. Nov 2009 A1
20090281789 Waibel et al. Nov 2009 A1
20090287583 Holmes Nov 2009 A1
20090290718 Kahn et al. Nov 2009 A1
20090296552 Hicks et al. Dec 2009 A1
20090299745 Kennewick et al. Dec 2009 A1
20090299849 Cao et al. Dec 2009 A1
20090300488 Salamon et al. Dec 2009 A1
20090304198 Herre et al. Dec 2009 A1
20090306967 Nicolov et al. Dec 2009 A1
20090306980 Shin Dec 2009 A1
20090306981 Cromack et al. Dec 2009 A1
20090306985 Roberts et al. Dec 2009 A1
20090306989 Kaji Dec 2009 A1
20090307162 Bui et al. Dec 2009 A1
20090307201 Dunning et al. Dec 2009 A1
20090313026 Coffman et al. Dec 2009 A1
20090313544 Wood et al. Dec 2009 A1
20090313564 Rottler et al. Dec 2009 A1
20090316943 Frigola Munoz et al. Dec 2009 A1
20090319266 Brown et al. Dec 2009 A1
20090326936 Nagashima Dec 2009 A1
20090326938 Marila et al. Dec 2009 A1
20090327977 Bachfischer et al. Dec 2009 A1
20100005081 Bennett Jan 2010 A1
20100023318 Lemoine Jan 2010 A1
20100023320 Di Cristo et al. Jan 2010 A1
20100030928 Conroy et al. Feb 2010 A1
20100031143 Rao et al. Feb 2010 A1
20100036655 Cecil et al. Feb 2010 A1
20100036660 Bennett Feb 2010 A1
20100042400 Block et al. Feb 2010 A1
20100049514 Kennewick et al. Feb 2010 A1
20100054512 Solum Mar 2010 A1
20100057457 Ogata et al. Mar 2010 A1
20100060646 Unsal et al. Mar 2010 A1
20100063804 Sato et al. Mar 2010 A1
20100063825 Williams et al. Mar 2010 A1
20100063961 Guiheneuf et al. Mar 2010 A1
20100064113 Lindahl et al. Mar 2010 A1
20100067723 Bergmann et al. Mar 2010 A1
20100070899 Hunt et al. Mar 2010 A1
20100076760 Kraenzel et al. Mar 2010 A1
20100080398 Waldmann Apr 2010 A1
20100080470 Deluca et al. Apr 2010 A1
20100081456 Singh et al. Apr 2010 A1
20100081487 Chen et al. Apr 2010 A1
20100082327 Rogers et al. Apr 2010 A1
20100082328 Rogers et al. Apr 2010 A1
20100082329 Silverman et al. Apr 2010 A1
20100082346 Rogers et al. Apr 2010 A1
20100082347 Rogers et al. Apr 2010 A1
20100082348 Silverman et al. Apr 2010 A1
20100082349 Bellegarda et al. Apr 2010 A1
20100082970 Lindahl et al. Apr 2010 A1
20100086152 Rank et al. Apr 2010 A1
20100086153 Hagen et al. Apr 2010 A1
20100086156 Rank et al. Apr 2010 A1
20100088020 Sano et al. Apr 2010 A1
20100088093 Lee et al. Apr 2010 A1
20100088100 Lindahl Apr 2010 A1
20100100212 Lindahl et al. Apr 2010 A1
20100100384 Ju et al. Apr 2010 A1
20100103776 Chan Apr 2010 A1
20100106500 Mckee et al. Apr 2010 A1
20100125460 Mellott et al. May 2010 A1
20100131273 Aley-Raz et al. May 2010 A1
20100138215 Williams Jun 2010 A1
20100138224 Bedingfield, Sr. Jun 2010 A1
20100138416 Bellotti Jun 2010 A1
20100142740 Roerup Jun 2010 A1
20100145694 Ju et al. Jun 2010 A1
20100145700 Kennewick et al. Jun 2010 A1
20100146442 Nagasaka et al. Jun 2010 A1
20100161313 Karttunen Jun 2010 A1
20100161554 Datuashvili et al. Jun 2010 A1
20100164897 Morin et al. Jul 2010 A1
20100169075 Raffa et al. Jul 2010 A1
20100169097 Nachman et al. Jul 2010 A1
20100179991 Lorch et al. Jul 2010 A1
20100185448 Meisel Jul 2010 A1
20100204986 Kennewick et al. Aug 2010 A1
20100211199 Naik et al. Aug 2010 A1
20100217604 Baldwin et al. Aug 2010 A1
20100222098 Garg Sep 2010 A1
20100228540 Bennett Sep 2010 A1
20100228691 Yang et al. Sep 2010 A1
20100231474 Yamagajo et al. Sep 2010 A1
20100235167 Bourdon Sep 2010 A1
20100235341 Bennett Sep 2010 A1
20100250542 Fujimaki Sep 2010 A1
20100250599 Schmidt et al. Sep 2010 A1
20100257160 Cao Oct 2010 A1
20100257478 Longe et al. Oct 2010 A1
20100262599 Nitz Oct 2010 A1
20100268539 Xu et al. Oct 2010 A1
20100274753 Liberty et al. Oct 2010 A1
20100277579 Cho et al. Nov 2010 A1
20100278320 Arsenault et al. Nov 2010 A1
20100278453 King Nov 2010 A1
20100280983 Cho et al. Nov 2010 A1
20100281034 Petrou et al. Nov 2010 A1
20100286985 Kennewick et al. Nov 2010 A1
20100299133 Kopparapu et al. Nov 2010 A1
20100299142 Freeman et al. Nov 2010 A1
20100302056 Dutton et al. Dec 2010 A1
20100305807 Basir et al. Dec 2010 A1
20100312547 van Os et al. Dec 2010 A1
20100312566 Odinak et al. Dec 2010 A1
20100318576 Kim Dec 2010 A1
20100322438 Siotis Dec 2010 A1
20100324905 Kurzweil et al. Dec 2010 A1
20100325588 Reddy et al. Dec 2010 A1
20100332224 Mäkelä et al. Dec 2010 A1
20100332235 David Dec 2010 A1
20100332280 Bradley et al. Dec 2010 A1
20100332348 Cao Dec 2010 A1
20100332976 Fux et al. Dec 2010 A1
20110002487 Panther et al. Jan 2011 A1
20110010178 Lee et al. Jan 2011 A1
20110022292 Shen et al. Jan 2011 A1
20110022952 Wu et al. Jan 2011 A1
20110033064 Johnson et al. Feb 2011 A1
20110038489 Visser et al. Feb 2011 A1
20110047072 Ciurea Feb 2011 A1
20110047161 Myaeng et al. Feb 2011 A1
20110054901 Qin et al. Mar 2011 A1
20110060584 Ferrucci et al. Mar 2011 A1
20110060807 Martin et al. Mar 2011 A1
20110076994 Kim et al. Mar 2011 A1
20110082688 Kim et al. Apr 2011 A1
20110083079 Farrell et al. Apr 2011 A1
20110087491 Wittenstein et al. Apr 2011 A1
20110090078 Kim et al. Apr 2011 A1
20110093261 Angott Apr 2011 A1
20110099000 Rai et al. Apr 2011 A1
20110103682 Chidlovskii et al. May 2011 A1
20110106736 Aharonson et al. May 2011 A1
20110112827 Kennewick et al. May 2011 A1
20110112921 Kennewick et al. May 2011 A1
20110119049 Ylonen May 2011 A1
20110119051 Li et al. May 2011 A1
20110125540 Jang et al. May 2011 A1
20110130958 Stahl et al. Jun 2011 A1
20110131036 Di Cristo et al. Jun 2011 A1
20110131038 Oyaizu et al. Jun 2011 A1
20110131045 Cristo et al. Jun 2011 A1
20110143811 Rodriguez Jun 2011 A1
20110144973 Bocchieri et al. Jun 2011 A1
20110144999 Jang et al. Jun 2011 A1
20110161076 Davis et al. Jun 2011 A1
20110161309 Lung et al. Jun 2011 A1
20110175810 Markovic et al. Jul 2011 A1
20110179002 Dumitru et al. Jul 2011 A1
20110179372 Moore et al. Jul 2011 A1
20110184721 Subramanian et al. Jul 2011 A1
20110184730 LeBeau et al. Jul 2011 A1
20110191271 Baker et al. Aug 2011 A1
20110191344 Jin et al. Aug 2011 A1
20110195758 Damale et al. Aug 2011 A1
20110201387 Paek et al. Aug 2011 A1
20110218855 Cao et al. Sep 2011 A1
20110224972 Millett et al. Sep 2011 A1
20110231182 Weider et al. Sep 2011 A1
20110231188 Kennewick et al. Sep 2011 A1
20110231474 Locker et al. Sep 2011 A1
20110238408 Larcheveque et al. Sep 2011 A1
20110260861 Singh et al. Oct 2011 A1
20110264643 Cao Oct 2011 A1
20110274303 Filson et al. Nov 2011 A1
20110276598 Kozempel Nov 2011 A1
20110279368 Klein et al. Nov 2011 A1
20110288861 Kurzweil et al. Nov 2011 A1
20110298585 Barry Dec 2011 A1
20110306426 Novak et al. Dec 2011 A1
20110314404 Kotler et al. Dec 2011 A1
20120002820 Leichter Jan 2012 A1
20120011138 Dunning et al. Jan 2012 A1
20120016678 Gruber et al. Jan 2012 A1
20120020490 Leichter Jan 2012 A1
20120022787 LeBeau et al. Jan 2012 A1
20120022857 Baldwin et al. Jan 2012 A1
20120022860 Lloyd et al. Jan 2012 A1
20120022868 LeBeau et al. Jan 2012 A1
20120022869 Lloyd et al. Jan 2012 A1
20120022870 Kristjansson et al. Jan 2012 A1
20120022872 Gruber et al. Jan 2012 A1
20120022874 Lloyd et al. Jan 2012 A1
20120022876 LeBeau et al. Jan 2012 A1
20120023088 Cheng et al. Jan 2012 A1
20120034904 LeBeau et al. Feb 2012 A1
20120035908 LeBeau et al. Feb 2012 A1
20120035924 Jitkoff et al. Feb 2012 A1
20120035931 LeBeau et al. Feb 2012 A1
20120035932 Jitkoff et al. Feb 2012 A1
20120042343 Laligand et al. Feb 2012 A1
20120053815 Montanari et al. Mar 2012 A1
20120078627 Wagner Mar 2012 A1
20120082317 Pance et al. Apr 2012 A1
20120084086 Gilbert et al. Apr 2012 A1
20120108221 Thomas et al. May 2012 A1
20120136572 Norton May 2012 A1
20120137367 Dupont et al. May 2012 A1
20120149394 Singh et al. Jun 2012 A1
20120150580 Norton Jun 2012 A1
20120173464 Tur et al. Jul 2012 A1
20120185237 Gajic et al. Jul 2012 A1
20120197998 Kessel et al. Aug 2012 A1
20120214517 Singh et al. Aug 2012 A1
20120221339 Wang et al. Aug 2012 A1
20120245719 Story, Jr. et al. Sep 2012 A1
20120245944 Gruber et al. Sep 2012 A1
20120265528 Gruber et al. Oct 2012 A1
20120271625 Bernard Oct 2012 A1
20120271635 Ljolje Oct 2012 A1
20120271676 Aravamudan et al. Oct 2012 A1
20120284027 Mallett et al. Nov 2012 A1
20120296649 Bansal et al. Nov 2012 A1
20120309363 Gruber et al. Dec 2012 A1
20120310642 Cao et al. Dec 2012 A1
20120310649 Cannistraro et al. Dec 2012 A1
20120311583 Gruber et al. Dec 2012 A1
20120311584 Gruber et al. Dec 2012 A1
20120311585 Gruber et al. Dec 2012 A1
20120330660 Jaiswal Dec 2012 A1
20120330661 Lindahl Dec 2012 A1
20130006638 Lindahl Jan 2013 A1
20130110505 Gruber et al. May 2013 A1
20130110515 Guzzoni et al. May 2013 A1
20130110518 Gruber et al. May 2013 A1
20130110519 Cheyer et al. May 2013 A1
20130110520 Cheyer et al. May 2013 A1
20130111348 Gruber et al. May 2013 A1
20130111487 Cheyer et al. May 2013 A1
20130115927 Gruber et al. May 2013 A1
20130117022 Chen et al. May 2013 A1
20130185074 Gruber et al. Jul 2013 A1
20130185081 Cheyer et al. Jul 2013 A1
20130325443 Begeja et al. Dec 2013 A1
Foreign Referenced Citations (239)
Number Date Country
681573 Apr 1993 CH
1673939 Sep 2005 CN
1864204 Nov 2006 CN
3837590 May 1990 DE
4126902 Feb 1992 DE
4334773 Apr 1994 DE
4445023 Jun 1996 DE
102004029203 Dec 2005 DE
198 41 541 Dec 2007 DE
0030390 Jun 1981 EP
0057514 Aug 1982 EP
0138061 Sep 1984 EP
0138061 Apr 1985 EP
0218859 Apr 1987 EP
0262938 Apr 1988 EP
0283995 Sep 1988 EP
0293259 Nov 1988 EP
0299572 Jan 1989 EP
0313975 May 1989 EP
0314908 May 1989 EP
0327408 Aug 1989 EP
0389271 Sep 1990 EP
0411675 Feb 1991 EP
441089 Aug 1991 EP
0464712 Jan 1992 EP
0476972 Mar 1992 EP
558312 Sep 1993 EP
0559349 Sep 1993 EP
0559349 Sep 1993 EP
0570660 Nov 1993 EP
0575146 Dec 1993 EP
0578604 Jan 1994 EP
0586996 Mar 1994 EP
0609030 Aug 1994 EP
0651543 May 1995 EP
0679005 Oct 1995 EP
0795811 Sep 1997 EP
0476972 May 1998 EP
0845894 Jun 1998 EP
0863453 Sep 1998 EP
0863469 Sep 1998 EP
0867860 Sep 1998 EP
0869697 Oct 1998 EP
889626 Jan 1999 EP
0917077 May 1999 EP
691023 Sep 1999 EP
0946032 Sep 1999 EP
981236 Feb 2000 EP
0982732 Mar 2000 EP
1001588 May 2000 EP
1014277 Jun 2000 EP
1028425 Aug 2000 EP
1028426 Aug 2000 EP
1047251 Oct 2000 EP
1076302 Feb 2001 EP
1091615 Apr 2001 EP
1229496 Aug 2002 EP
1233600 Aug 2002 EP
1245023 Oct 2002 EP
1311102 May 2003 EP
1315084 May 2003 EP
1315086 May 2003 EP
1347361 Sep 2003 EP
1379061 Jan 2004 EP
1432219 Jun 2004 EP
1517228 Mar 2005 EP
1536612 Jun 2005 EP
1566948 Aug 2005 EP
1693829 Aug 2006 EP
1818786 Aug 2007 EP
1892700 Feb 2008 EP
1912205 Apr 2008 EP
1939860 Jul 2008 EP
0651543 Sep 2008 EP
1909263 Jan 2009 EP
1335620 Mar 2009 EP
2094032 Aug 2009 EP
2109295 Oct 2009 EP
1720375 Jul 2010 EP
2205010 Jul 2010 EP
2400373 Dec 2011 EP
2431842 Mar 2012 EP
2293667 Apr 1996 GB
2310559 Aug 1997 GB
2342802 Apr 2000 GB
2384399 Jul 2003 GB
2402855 Dec 2004 GB
FI20010199 Apr 2003 IT
57-41731 Mar 1982 JP
59-57336 Apr 1984 JP
2-86397 Mar 1990 JP
2-153415 Jun 1990 JP
3-113578 May 1991 JP
4-236624 Aug 1992 JP
5-79951 Mar 1993 JP
5-165459 Jul 1993 JP
5-293126 Nov 1993 JP
06 019965 Jan 1994 JP
6-69954 Mar 1994 JP
6-274586 Sep 1994 JP
6-332617 Dec 1994 JP
7199379 Aug 1995 JP
7-320051 Dec 1995 JP
7-320079 Dec 1995 JP
8-63330 Mar 1996 JP
8-185265 Jul 1996 JP
8-227341 Sep 1996 JP
9-18585 Jan 1997 JP
9-55792 Feb 1997 JP
9-259063 Oct 1997 JP
10-105324 Apr 1998 JP
11-6743 Jan 1999 JP
11-45241 Feb 1999 JP
2000-134407 May 2000 JP
2000-339137 Dec 2000 JP
2001-56233 Feb 2001 JP
2001 125896 May 2001 JP
2001-148899 May 2001 JP
200-2014954 Jan 2002 JP
2002 024212 Jan 2002 JP
2003-84877 Mar 2003 JP
2003 517158 May 2003 JP
2003-233568 Aug 2003 JP
2004-48804 Feb 2004 JP
2004-505525 Feb 2004 JP
2004-152063 May 2004 JP
2005-86624 Mar 2005 JP
2005-92441 Apr 2005 JP
2005-181386 Jul 2005 JP
2005-311864 Nov 2005 JP
2007-004633 Jan 2007 JP
2008-26381 Feb 2008 JP
2008-97003 Apr 2008 JP
2008-236448 Oct 2008 JP
2008-271481 Nov 2008 JP
2009 036999 Feb 2009 JP
2009-294913 Dec 2009 JP
2010-535377 Nov 2010 JP
10-1999-0073234 Oct 1999 KR
10-2002-0069952 Sep 2002 KR
10-2003-0016993 Mar 2003 KR
10-2005-0083561 Aug 2005 KR
10-2006-0012730 Feb 2006 KR
10-2007-0057496 Jun 2007 KR
10-2007-0071675 Jul 2007 KR
10-0776800 Nov 2007 KR
10-2008-001227 Feb 2008 KR
10-0810500 Mar 2008 KR
10-2008-0049647 Jun 2008 KR
10 2008 109322 Dec 2008 KR
10 2009 086805 Aug 2009 KR
10-0920267 Oct 2009 KR
10-2010-0032792 Apr 2010 KR
10-2010-0119519 Nov 2010 KR
10 2011 0113414 Oct 2011 KR
1014847 Oct 2001 NL
9320640 Oct 1993 WO
9429788 Dec 1994 WO
WO 9502221 Jan 1995 WO
9516950 Jun 1995 WO
9710586 Mar 1997 WO
WO 9726612 Jul 1997 WO
9729614 Aug 1997 WO
9738488 Oct 1997 WO
9809270 Mar 1998 WO
9833111 Jul 1998 WO
WO 9841956 Sep 1998 WO
WO 9901834 Jan 1999 WO
WO 9908238 Feb 1999 WO
9916181 Apr 1999 WO
WO 9956227 Nov 1999 WO
0019697 Apr 2000 WO
0022820 Apr 2000 WO
0029964 May 2000 WO
0030070 May 2000 WO
0038041 Jun 2000 WO
0044173 Jul 2000 WO
0063766 Oct 2000 WO
WO 0060435 Oct 2000 WO
WO 0060435 Oct 2000 WO
0068936 Nov 2000 WO
0106489 Jan 2001 WO
0130046 Apr 2001 WO
0133569 May 2001 WO
0135391 May 2001 WO
0146946 Jun 2001 WO
0165413 Sep 2001 WO
0167753 Sep 2001 WO
0225610 Mar 2002 WO
0231814 Apr 2002 WO
0237469 May 2002 WO
WO 02073603 Sep 2002 WO
03003152 Jan 2003 WO
03003765 Jan 2003 WO
03023786 Mar 2003 WO
03041364 May 2003 WO
03049494 Jun 2003 WO
03056789 Jul 2003 WO
03067202 Aug 2003 WO
03084196 Oct 2003 WO
2004008801 Jan 2004 WO
2004025938 Mar 2004 WO
2004047415 Jun 2004 WO
2004055637 Jul 2004 WO
2004057486 Jul 2004 WO
2004061850 Jul 2004 WO
2004084413 Sep 2004 WO
2005003920 Jan 2005 WO
2005008505 Jan 2005 WO
2005008899 Jan 2005 WO
2005010725 Feb 2005 WO
2005027472 Mar 2005 WO
2005027485 Mar 2005 WO
2005031737 Apr 2005 WO
2005034085 Apr 2005 WO
2005041455 May 2005 WO
2005059895 Jun 2005 WO
2006020305 Feb 2006 WO
2006056822 Jun 2006 WO
2006078246 Jul 2006 WO
2006101649 Sep 2006 WO
2006133571 Dec 2006 WO
WO 2006129967 Dec 2006 WO
2007002753 Jan 2007 WO
2007083894 Jul 2007 WO
WO 2007080559 Jul 2007 WO
2008071231 Jun 2008 WO
WO 2008085742 Jul 2008 WO
WO 2008109835 Sep 2008 WO
2008153639 Dec 2008 WO
2009009240 Jan 2009 WO
2009017280 Feb 2009 WO
2009156438 Dec 2009 WO
2010075623 Jul 2010 WO
2011057346 May 2011 WO
WO 2011088053 Jul 2011 WO
2011133543 Oct 2011 WO
2011150730 Dec 2011 WO
WO 2012167168 Dec 2012 WO
Non-Patent Literature Citations (965)
Entry
Xu et al.,, Speech-based interactive games for language learning: reading, translation and question-answer, 2009.
Car Working Group, “Bluetooth Doc Hands-Free Profile 1.5 HFP1.5—SPEC,” Nov. 25, 2005, www.bluetooth.org, 84 pages.
Cohen, Michael H., et al., “Voice User Interface Design,” excerpts from Chapter 1 and Chapter 10, Addison-Wesley ISBN:0-321-18576-5, 2004, 36 pages.
Gong, J., et al., “Guidelines for Handheld Mobile Device Interface Design,” Proceedings of DSI 2004 Annual Meeting, pp. 3751-3756.
Horvitz, E., “Handsfree Decision Support: Toward a Non-invasive Human-Computer Interface,” Proceedings of the Symposium on Computer Applications in Medical Care, IEEE Computer Society Press, Nov. 1995, 1 page.
Horvitz, E., “In Pursuit of Effective Handsfree Decision Support: Coupling Bayesian Inference, Speech Understanding, and User Models,” 1995, 8 pages.
“Top 10 Best Practices for Voice User Interface Design,” Nov. 1, 2002, http://www.developer.com/voice/article.php/1567051/Top-10-Best-Practices-for-Voice-User-Interface-Design.htm, 4 pages.
GB Patent Act 1977: Combined Search Report and Examination Report under Sections 17 and 18(3) for Application No. GB1009318.5, report dated Oct. 8, 2010, 5 pages.
GB Patent Act 1977: Combined Search Report and Examination Report under Sections 17 and 18(3) for Application No. GB1217449.6, report dated Jan. 17, 2013, 6 pages.
Australian Office Action dated Dec. 7, 2012 for Application No. 2010254812, 8 pages.
Australian Office Action dated Nov. 27, 2012 for Application No. 2012101471, 6 pages.
Australian Office Action dated Nov. 22, 2012 for Application No. 2012101466, 6 pages.
Australian Office Action dated Nov. 14, 2012 for Application No. 2012101473, 6 pages.
Australian Office Action dated Nov. 19, 2012 for Application No. 2012101470, 5 pages.
Australian Office Action dated Nov. 28, 2012 for Application No. 2012101468, 5 pages.
Australian Office Action dated Nov. 19, 2012 for Application No. 2012101472, 5 pages.
Australian Office Action dated Nov. 19, 2012 for Application No. 2012101469, 6 pages.
Australian Office Action dated Nov. 15, 2012 for Application No. 2012101465, 6 pages.
Australian Office Action dated Nov. 30, 2012 for Application No. 2012101467, 6 pages.
Current claims of PCT Application No. PCT/US11/20861 dated Jan. 11, 2011, 17 pages.
Final Office Action dated Jun. 19, 2012, received in U.S. Appl. No. 12/479,477, 46 pages (van Os).
Office Action dated Sep. 29, 2011, received in U.S. Appl. No. 12/479,477, 32 pages (van Os).
Office Action dated Jan. 31, 2013, received in U.S. Appl. No. 13/251,088, 38 pages (Gruber).
Office Action dated Nov. 28, 2012, received in U.S. Appl. No. 13/251,104, 49 pages (Gruber).
Office Action dated Dec. 7, 2012, received in U.S. Appl. No. 13/251,118, 52 pages (Gruber).
Final Office Action dated Mar. 25, 2013, received in U.S. Appl. No. 13/251,127, 53 pages (Gruber).
Office Action dated Nov. 8, 2012, received in U.S. Appl. No. 13/251,127, 35 pages (Gruber).
Office Action dated Apr. 16, 2013, received in U.S. Appl. No. 13/725,550, 8 pages (Cheyer).
Office Action dated Mar. 27, 2013, received in U.S. Appl. No. 13/725,656, 22 pages (Gruber).
Office Action dated Mar. 14, 2013, received in U.S. Appl. No. 12/987,982, 59 pages (Gruber).
Russian Office Action dated Nov. 8, 2012 for Application No. 2012144647, 7 pages.
Russian Office Action dated Dec. 6, 2012 for Application No. 2012144605, 6 pages.
International Search Report and Written Opinion dated Aug. 25, 2010, received in International Application No. PCT/US2010/037378, which corresponds to U.S. Appl. No. 12/479,477, 16 pages (Apple Inc.).
International Search Report and Written Opinion dated Nov. 16, 2012, received in International Application No. PCT/US2012/040571, which corresponds to U.S. Appl. No. 13/251,088 14 pages (Apple Inc.).
International Search Report and Written Opinion dated Dec. 20, 2012, received in International Application No. PCT/US2012/056382, which corresponds to U.S. Appl. No. 13/250,947, 11 pages (Gruber).
Ambite, JL., et al., “Design and Implementation of the CALO Query Manager,” Copyright © 2006, American Association for Artificial Intelligence, (www.aaai.org), 8 pages.
Ambite, JL., et al., “Integration of Heterogeneous Knowledge Sources in the CALO Query Manager,” 2005, The 4th International Conference on Ontologies, DataBases, and Applications of Semantics (ODBASE), Agia Napa, Cyprus, ttp://www.isi.edu/people/ambite/publications/integration—heterogeneous—knowledge—sources—calo—query—manager, 18 pages.
Belvin, R. et al., “Development of the HRL Route Navigation Dialogue System,” 2001, In Proceedings of the First International Conference on Human Language Technology Research, Paper, Copyright © 2001 HRL Laboratories, LLC, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6538, 5 pages.
Berry, P. M., et al. “PTIME: Personalized Assistance for Calendaring,” ACM Transactions on Intelligent Systems and Technology, vol. 2, No. 4, Article 40, Publication date: Jul. 2011, 40:1-22, 22 pages.
Bussler, C., et al., “Web Service Execution Environment (WSMX),” Jun. 3, 2005, W3C Member Submission, http://www.w3.org/Submission/WSMX, 29 pages.
Butcher, M., “EVI arrives in town to go toe-to-toe with Siri,” Jan. 23, 2012, http://techcrunch.com/2012/01/23/evi-arrives-in-town-to-go-toe-to-toe-with-siri/, 2 pages.
Chen, Y., “Multimedia Siri Finds and Plays Whatever You Ask For,” Feb. 9, 2012, http://www.psfk.com/2012/02/multimedia-siri.html, 9 pages.
Cheyer, A., “About Adam Cheyer,” Sep. 17, 2012, http://www.adam.cheyer.com/about.html, 2 pages.
Cheyer, A., “A Perspective on AI & Agent Technologies for SCM,” VerticalNet, 2001 presentation, 22 pages.
Cheyer, A. et al., “Spoken Language and Multimodal Applications for Electronic Realties,” © Springer-Verlag London Ltd, Virtual Reality 1999, 3:1-15, 15 pages.
Cutkosky, M. R. et al., “PACT: An Experiment in Integrating Concurrent Engineering Systems,” Journal, Computer, vol. 26 Issue 1, Jan. 1993, IEEE Computer Society Press Los Alamitos, CA, USA, http://dl.acm.org/citation.cfm?id=165320, 14 pages.
Domingue, J., et al., “Web Service Modeling Ontology (WSMO)—An Ontology for Semantic Web Services,” Jun. 9-10, 2005, position paper at the W3C Workshop on Frameworks for Semantics in Web Services, Innsbruck, Austria, 6 pages.
Elio, R. et al., “On Abstract Task Models and Conversation Policies,” http://webdocs.cs.ualberta.ca/˜ree/publications/papers2/ATS.AA99.pdf, May 1999, 10 pages.
Ericsson, S. et al., “Software illustrating a unified approach to multimodality and multilinguality in the in-home domain,” Dec. 22, 2006, Talk and Look: Tools for Ambient Linguistic Knowledge, http://www.talk-project.eurice.eu/fileadmin/talk/publications—public/deliverables—public/D1—6.pdf, 127 pages.
Evi, “Meet Evi: the one mobile app that provides solutions for your everyday problems,” Feb. 8, 2012, http://www.evi.com/, 3 pages.
Feigenbaum, E., et al., “Computer-assisted Semantic Annotation of Scientific Life Works,” 2007, http://tomgruber.org/writing/stanford-cs300.pdf, 22 pages.
Gannes, L., “Alfred App Gives Personalized Restaurant Recommendations,” allthingsd.com, Jul. 18, 2011, http://allthingsd.com/20110718/alfred-app-gives-personalized-restaurant-recommendations/, 3 pages.
Gautier, P. O., et al. “Generating Explanations of Device Behavior Using Compositional Modeling and Causal Ordering,” 1993, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8394, 9 pages.
Gervasio, M. T., et al., Active Preference Learning for Personalized Calendar Scheduling Assistancae, Copyright © 2005, http://www.ai.sri.com/˜gervasio/pubs/gervasio-iui05.pdf, 8 pages.
Glass, A., “Explaining Preference Learning,” 2006, http://cs229.stanford.edu/proj2006/Glass-ExplainingPreferenceLearning.pdf, 5 pages.
Glass, J., et al., “Multilingual Spoken-Language Understanding in the MIT Voyager System,” Aug. 1995, http://groups.csail.mit.edu/sls/publications/1995/speechcomm95-voyager.pdf, 29 pages.
Goddeau, D., et al., “A Form-Based Dialogue Manager for Spoken Language Applications,” Oct. 1996, http://phasedance.com/pdf/icslp96.pdf, 4 pages.
Goddeau, D., et al., “Galaxy: A Human-Language Interface to On-Line Travel Information,” 1994 International Conference on Spoken Language Processing, Sep. 18-22, 1994, Pacific Convention Plaza Yokohama, Japan, 6 pages.
Gruber, T. R., et al., “An Ontology for Engineering Mathematics,” In Jon Doyle, Piero Torasso, & Erik Sandewall, Eds., Fourth International Conference on Principles of Knowledge Representation and Reasoning, Gustav Stresemann Institut, Bonn, Germany, Morgan Kaufmann, 1994, http://www-ksl.stanford.edu/knowledge-sharing/papers/engmath.html, 22 pages.
Gruber, T. R., “A Translation Approach to Portable Ontology Specifications,” Knowledge Systems Laboratory, Stanford University, Sep. 1992, Technical Report KSL 92-71, Revised Apr. 1993, 27 pages.
Gruber, T. R., “Automated Knowledge Acquisition for Strategic Knowledge,” Knowledge Systems Laboratory, Machine Learning, 4, 293-336 (1989), 44 pages.
Gruber, T. R., “(Avoiding) the Travesty of the Commons,” Presentation at NPUC 2006, New Paradigms for User Computing, IBM Almaden Research Center, Jul. 24, 2006. http://tomgruber.org/writing/avoiding-travestry.htm, 52 pages.
Gruber, T. R., “Big Think Small Screen: How semantic computing in the cloud will revolutionize the consumer experience on the phone,” Keynote presentation at Web 3.0 conference, Jan. 27, 2010, http://tomgruber.org/writing/web30jan2010.htm, 41 pages.
Gruber, T. R., “Collaborating around Shared Content on the WWW,” W3C Workshop on WWW and Collaboration, Cambridge, MA, Sep. 11, 1995, http://www.w3.org/Collaboration/VVorkshop/Proceedings/P9.html, 1 page.
Gruber, T. R., “Collective Knowledge Systems: Where the Social Web meets the Semantic Web,” Web Semantics: Science, Services and Agents on the World Wide Web (2007), doi:10.1016/j.websem.2007.11.011, keynote presentation given at the 5th International Semantic Web Conference, Nov. 7, 2006, 19 pages.
Gruber, T. R., “Where the Social Web meets the Semantic Web,” Presentation at the 5th International Semantic Web Conference, Nov. 7, 2006, 38 pages.
Gruber, T. R., “Despite our Best Efforts, Ontologies are not the Problem,” AAAI Spring Symposium, Mar. 2008, http://tomgruber.org/writing/aaai-ss08.htm, 40 pages.
Gruber, T. R., “Enterprise Collaboration Management with Intraspect,” Intraspect Software, Inc., Instraspect Technical White Paper Jul. 2001, 24 pages.
Gruber, T. R., “Every ontology is a treaty—a social agreement—among people with some common motive in sharing,” Interview by Dr. Miltiadis D. Lytras, Official Quarterly Bulletin of AIS Special Interest Group on Semantic Web and Information Systems, vol. 1, Issue 3, 2004, http://www.sigsemis.org 1, 5 pages.
Gruber, T. R., et al., “Generative Design Rationale: Beyond the Record and Replay Paradigm,” Knowledge Systems Laboratory, Stanford University, Dec. 1991, Technical Report KSL 92-59, Updated Feb. 1993, 24 pages.
Gruber, T. R., “Helping Organizations Collaborate, Communicate, and Learn,” Presentation to NASA Ames Research, Mountain View, CA, Mar. 2003, http://tomgruber.org/writing/organizational-intelligence-talk.htm, 30 pages.
Gruber, T. R., “Intelligence at the Interface: Semantic Technology and the Consumer Internet Experience,” Presentation at Semantic Technologies conference (SemTech08), May 20, 2008, http://tomgruber.org/writing.htm, 40 pages.
Gruber, T. R., Interactive Acquisition of Justifications: Learning “Why” by Being Told “What” Knowledge Systems Laboratory, Stanford University, Oct. 1990, Technical Report KSL 91-17, Revised Feb. 1991, 24 pages.
Gruber, T. R., “It Is What It Does: The Pragmatics of Ontology for Knowledge Sharing,” (c) 2000, 2003, http://www.cidoc-crm.org/docs/symposium—presentations/gruber—cidoc-ontology-2003.pdf, 21 pages.
Gruber, T. R., et al., “Machine-generated Explanations of Engineering Models: A Compositional Modeling Approach,” (1993) In Proc. International Joint Conference on Artificial Intelligence, http://citeseerx.ist.psu.edu/viewdoc/sunmary?doi=10.1.1.34.930, 7 pages.
Gruber, T. R., “2021: Mass Collaboration and the Really New Economy,” TNTY Futures, the newsletter of The Next Twenty Years series, vol. 1, Issue 6, Aug. 2001, http://www.tnty.com/newsletter/futures/archive/v01-05business.html, 5 pages.
Gruber, T. R., et al.,“NIKE: A National Infrastructure for Knowledge Exchange,” Oct. 1994, http://www.eit.com/papers/nike/nike.html and nike.ps, 10 pages.
Gruber, T. R., “Ontologies, Web 2.0 and Beyond,” Apr. 24, 2007, Ontology Summit 2007, http://tomgruber.org/writing/ontolog-social-web-keynote.pdf, 17 pages.
Gruber, T. R., “Ontology of Folksonomy: A Mash-up of Apples and Oranges,” Originally published to the web in 2005, Int'l Journal on Semantic Web & Information Systems, 3(2), 2007, 7 pages.
Gruber, T. R., “Siri, a Virtual Personal Assistant—Bringing Intelligence to the Interface,” Jun. 16, 2009, Keynote presentation at Semantic Technologies conference, Jun. 2009. http://tomgruber.org/writing/semtech09.htm, 22 pages.
Gruber, T. R., “TagOntology,” Presentation to Tag Camp, www.tagcamp.org, Oct. 29, 2005, 20 pages.
Gruber, T. R., et al., “Toward a Knowledge Medium for Collaborative Product Development,” In Artificial Intelligence in Design 1992, from Proceedings of the Second International Conference on Artificial Intelligence in Design, Pittsburgh, USA, Jun. 22-25, 1992, 19 pages.
Gruber, T. R., “Toward Principles for the Design of Ontologies Used for Knowledge Sharing,” In International Journal Human-Computer Studies 43, p. 907-928, substantial revision of paper presented at the International Workshop on Formal Ontology, Mar. 1993, Padova, Italy, available as Technical Report KSL 93-04, Knowledge Systems Laboratory, Stanford University, further revised Aug. 23, 1993, 23 pages.
Guzzoni, D., et al., “Active, A Platform for Building Intelligent Operating Rooms,” Surgetica 2007 Computer-Aided Medical Interventions: tools and applications, pp. 191-198, Paris, 2007, Sauramps Médical, http://lsro.epfl.ch/page-68384-en.html, 8 pages.
Guzzoni, D., et al., “Active, A Tool for Building Intelligent User Interfaces,” ASC 2007, Palma de Mallorca, http://lsro.epfl.ch/page-34241.html, 6 pages.
Guzzoni, D., et al., “A Unified Platform for Building Intelligent Web Interaction Assistants,” Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Computer Society, 4 pages.
Guzzoni, D., et al., “Modeling Human-Agent Interaction with Active Ontologies,” 2007, AAAI Spring Symposium, Interaction Challenges for Intelligent Assistants, Stanford University, Palo Alto, California, 8 pages.
Hardawar, D., “Driving app Waze builds its own Siri for hands-free voice control,” Feb. 9, 2012, http://venturebeat.com/2012/02/09/driving-app-waze-builds-its-own-siri-for-hands-free-voice-control/, 4 pages.
Intraspect Software, “The Intraspect Knowledge Management Solution: Technical Overview,” http://tomgruber.org/writing/intraspect-whitepaper-1998.pdf, 18 pages.
Julia, L., et al., Un éditeur interactif de tableaux dessinés à main levée (An Interactive Editor for Hand-Sketched Tables), Traitement du Signal 1995, vol. 12, No. 6, 8 pages. No English Translation Available.
Karp, P. D., “A Generic Knowledge-Base Access Protocol,” May 12, 1994, http://lecture.cs.buu.ac.th/˜f50353/Document/gfp.pdf, 66 pages.
Lemon, O., et al., “Multithreaded Context for Robust Conversational Interfaces: Context-Sensitive Speech Recognition and Interpretation of Corrective Fragments,” Sep. 2004, ACM Transactions on Computer-Human Interaction, vol. 11, No. 3, 27 pages.
Leong, L., et al., “CASIS: A Context-Aware Speech Interface System,” IUI'05, Jan. 9-12, 2005, Proceedings of the 10th international conference on Intelligent user interfaces, San Diego, California, USA, 8 pages.
Lieberman, H., et al., “Out of context: Computer systems that adapt to, and learn from, context,” 2000, IBM Systems Journal, vol. 39, Nos. 3/4, 2000, 16 pages.
Lin, B., et al., “A Distributed Architecture for Cooperative Spoken Dialogue Agents with Coherent Dialogue State and History,” 1999, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.272, 4 pages.
Martin, D., et al., “The Open Agent Architecture: A Framework for building distributed software systems,” Jan.-Mar. 1999, Applied Artificial Intelligence: An International Journal, vol. 13, No. 1-2, http://adam.cheyer.com/papers/oaa.pdf, 38 pages.
McGuire, J., et al., “SHADE: Technology for Knowledge-Based Collaborative Engineering,” 1993, Journal of Concurrent Engineering: Applications and Research (CERA), 18 pages.
Meng, H., et al., “Wheels: A Conversational System in the Automobile Classified Domain,” Oct. 1996, httphttp://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3022, 4 pages.
Milward, D., et al., “D2.2: Dynamic Multimodal Interface Reconfiguration, Talk and Look: Tools for Ambient Linguistic Knowledge,” Aug. 8, 2006, http://www.ihmc.us/users/nblaylock/Pubs/Files/talk—d2.2.pdf, 69 pages.
Mitra, P., et al., “A Graph-Oriented Model for Articulation of Ontology Interdependencies,” 2000, http://ilpubs.stanford.edu:8090/442/1/2000-20.pdf, 15 pages.
Moran, D. B., et al., “Multimodal User Interfaces in the Open Agent Architecture,” Proc. of the 1997 International Conference on Intelligent User Interfaces (IUI97), 8 pages.
Mozer, M., “An Intelligent Environment Must be Adaptive,” Mar./Apr. 1999, IEEE Intelligent Systems, 3 pages.
Mühlhäuser, M., “Context Aware Voice User Interfaces for Workflow Support,” Darmstadt 2007, http://tuprints.ulb.tu-darmstadt.de/876/1/PhD.pdf, 254 pages.
Naone, E., “TR10: Intelligent Software Assistant,” Mar.-Apr. 2009, Technology Review, http://www.technologyreview.com/printer—friendly—article.aspx?id=22117; 2 pages.
Neches, R., “Enabling Technology for Knowledge Sharing,” Fall 1991, AI Magazine, pp. 37-56, (21 pages).
Nöth, E., et al., “Verbmobil: The Use of Prosody in the Linguistic Components of a Speech Understanding System,” IEEE Transactions on Speech and Audio Processing, vol. 8, No. 5, Sep. 2000, 14 pages.
Notice of Allowance dated Feb. 29, 2012, received in U.S. Appl. No. 11/518,292, 29 pages (Cheyer).
Final Office Action dated May 10, 2011, received in U.S. Appl. No. 11/518,292, 14 pages (Cheyer).
Office Action dated Nov. 24, 2010, received in U.S. Appl. No. 11/518,292, 12 pages (Cheyer).
Office Action dated Nov. 9, 2009, received in U.S. Appl. No. 11/518,292, 10 pages (Cheyer).
Australian Office Action dated Nov. 13, 2012 for Application No. 2011205426, 7 pages.
Australian Office Action dated Oct. 31, 2012 for Application No. 2012101191, 6 pages.
EP Communication under Rule-161(2) and 162 EPC for Application No. 117079392.2-2201, 4 pages.
Phoenix Solutions, Inc. v. West Interactive Corp., Document 40, Declaration of Christopher Schmandt Regarding the MIT Galaxy System dated Jul. 2, 2010, 162 pages.
Rice, J., et al., “Monthly Program: Nov. 14, 1995,” The San Francisco Bay Area Chapter of ACM SIGCHI, http://www.baychi.org/calendar/19951114/, 2 pages.
Rice, J., et al., “Using the Web Instead of a Window System,” Knowledge Systems Laboratory, Stanford University, (http://tomgruber.org/writing/ksl-95-69.pdf, Sep. 1995.) CHI '96 Proceedings: Conference on Human Factors in Computing Systems, Apr. 13-18, 1996, Vancouver, BC, Canada, 14 pages.
Rivlin, Z., et al., “Maestro: Conductor of Multimedia Analysis Technologies,” 1999 SRI International, Communications of the Association for Computing Machinery (CACM), 7 pages.
Roddy, D., et al., “Communication and Collaboration in a Landscape of B2B eMarketplaces,” VerticalNet Solutions, white paper, Jun. 15, 2000, 23 pages.
Seneff, S., et al., “A New Restaurant Guide Conversational System: Issues in Rapid Prototyping for Specialized Domains,” Oct. 1996, citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.16 . . . rep . . . , 4 pages.
Sheth, A., et al., “Relationships at the Heart of Semantic Web: Modeling, Discovering, and Exploiting Complex Semantic Relationships,” Oct. 13, 2002, Enhancing the Power of the Internet: Studies in Fuzziness and Soft Computing, SpringerVerlag, 38 pages.
Simonite, T., “One Easy Way to Make Siri Smarter,” Oct. 18, 2011, Technology Review, http://www.technologyreview.com/printer—friendly—article.aspx?id=38915, 2 pages.
Stent, A., et al., “The CommandTalk Spoken Dialogue System,” 1999, http://acl.ldc.upenn.edu/P/P99/P99-1024.pdf, 8 pages.
Tofel, K., et al., “SpeakTolt: A personal assistant for older iPhones, iPads,” Feb. 9, 2012, http://gigaom.com/apple/speaktoit-siri-for-older-iphones-ipads/, 7 pages.
Tucker, J., “Too lazy to grab your TV remote? Use Siri instead,” Nov. 30, 2011, http://www.engadget.com/2011/11/30/too-lazy-to-grab-your-tv-remote-use-siri-instead/, 8 pages.
Tur, G., et al., “The CALO Meeting Speech Recognition and Understanding System,” 2008, Proc. IEEE Spoken Language Technology Workshop, 4 pages.
Tur, G., et al., “The-CALO-Meeting-Assistant System,” IEEE Transactions on Audio, Speech, and Language Processing, vol. 18, No. 6, Aug. 2010, 11 pages.
Vlingo InCar, “Distracted Driving Solution with Vlingo InCar,” 2:38 minute video uploaded to YouTube by Vlingo Voice on Oct. 6, 2010, http://www.youtube.com/watch?v=Vqs8XfXxgz4, 2 pages.
Vlingo, “Vlingo Launches Voice Enablement Application on Apple App Store,” Vlingo press release dated Dec. 3, 2008, 2 pages.
YouTube, “Knowledge Navigator,” 5:34 minute video uploaded to YouTube by Knownav on Apr. 29, 2008, http://www.youtube.com/watch?v=QRH8eimU—20, 1 page.
YouTube,“Send Text, Listen to and Send E-Mail ‘by Voice’ www.voiceassist.com,” 2:11 minute video uploaded to YouTube by VoiceAssist on Jul. 30, 2009, http://www.youtube.com/watch?v=0tEU61nHHA4, 1 page.
YouTube,“Text'nDrive App Demo—Listen and Reply to your Messages by Voice while Driving!,” 1:57 minute video uploaded to YouTube by TextnDrive on Apr. 27, 2010, http://www.youtube.com/watch?v=WaGfzoHsAMw, 1 page.
YouTube, “Voice on the Go (BlackBerry),” 2:51 minute video uploaded to YouTube by VoiceOnTheGo on Jul. 27, 2009, http://www.youtube.com/watch?v=pJqpWgQS98w, 1 page.
Zue, V., “Conversational Interfaces: Advances and Challenges,” Sep. 1997, http://www.cs.cmu.edu/˜dod/papers/zue97.pdf, 10 pages.
Zue, V. W., “Toward Systems that Understand Spoken Language,” Feb. 1994, ARPA Strategic Computing Institute, © 1994 IEEE, 9 pages.
International Search Report and Written Opinion dated Nov. 29, 2011, received in International Application No. PCT/US2011/20861, which corresponds to U.S. Appl. No. 12/987,982, 15 pages (Thomas Robert Gruber).
Acero, A., et al., “Environmental Robustness in Automatic Speech Recognition,” International Conference on Acoustics, Speech, and Signal Processing (ICASSP'90), Apr. 3-6, 1990, 4 pages.
Acero, A., et al., “Robust Speech Recognition by Normalization of the Acoustic Space,” International Conference on Acoustics, Speech, and Signal Processing, 1991, 4 pages.
Ahlbom, G., et al., “Modeling Spectral Speech Transitions Using Temporal Decomposition Techniques,” IEEE International Conference of Acoustics, Speech, and Signal Processing (ICASSP'87), Apr. 1987, vol. 12, 4 pages.
Aikawa, K., “Speech Recognition Using Time-Warping Neural Networks,” Proceedings of the 1991 IEEE Workshop on Neural Networks for Signal Processing, Sep. 30 to Oct. 1, 1991, 10 pages.
Anastasakos, A., et al., “Duration Modeling in Large Vocabulary Speech Recognition,” International Conference on Acoustics, Speech, and Signal Processing (ICASSP'95), May 9-12, 1995, 4 pages.
Anderson, R. H., “Syntax-Directed Recognition of Hand-Printed Two-Dimensional Mathematics,” In Proceedings of Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium, © 1967, 12 pages.
Ansari, R., et al., “Pitch Modification of Speech using a Low-Sensitivity Inverse Filter Approach,” IEEE Signal Processing Letters, vol. 5, No. 3, Mar. 1998, 3 pages.
Anthony, N. J., et al., “Supervised Adaption for Signature Verification System,” Jun. 1, 1978, IBM Technical Disclosure, 3 pages.
Apple Computer, “Guide Maker User's Guide,” © Apple Computer, Inc., Apr. 27, 1994, 8 pages.
Apple Computer, “Introduction to Apple Guide,” © Apple Computer, Inc., Apr. 28, 1994, 20 pages.
Asanović, K., et al., “Experimental Determination of Precision Requirements for Back-Propagation Training of Artificial Neural Networks,” In Proceedings of the 2nd International Conference of Microelectronics for Neural Networks, 1991, www.ICSI.Berkeley.EDU, 7 pages.
Atal, B. S., “Efficient Coding of LPC Parameters by Temporal Decomposition,” IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'83), Apr. 1983, 4 pages.
Bahl, L. R., et al., “Acoustic Markov Models Used in the Tangora Speech Recognition System,” In Proceeding of International Conference on Acoustics, Speech, and Signal Processing (ICASSP'88), Apr. 11-14, 1988, vol. 1, 4 pages.
Bahl, L. R., et al., “A Maximum Likelihood Approach to Continuous Speech Recognition,” IEEE Transaction on Pattern Analysis and Machine Intelligence, vol. PAMI-5, No. 2, Mar. 1983, 13 pages.
Bahl, L. R., et al., “A Tree-Based Statistical Language Model for Natural Language Speech Recognition,” IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 37, Issue 7, Jul. 1989, 8 pages.
Bahl, L. R., et al., “Large Vocabulary Natural Language Continuous Speech Recognition,” In Proceedings of 1989 International Conference on Acoustics, Speech, and Signal Processing, May 23-26, 1989, vol. 1, 6 pages.
Bahl, L. R., et al, “Multonic Markov Word Models for Large Vocabulary Continuous Speech Recognition,” IEEE Transactions on Speech and Audio Processing, vol. 1, No. 3, Jul. 1993, 11 pages.
Bahl, L. R., et al., “Speech Recognition with Continuous-Parameter Hidden Markov Models,” In Proceeding of International Conference on Acoustics, Speech, and Signal Processing (ICASSP'88), Apr. 11-14, 1988, vol. 1, 8 pages.
Banbrook, M., “Nonlinear Analysis of Speech from a Synthesis Perspective,” A thesis submitted for the degree of Doctor of Philosophy, The University of Edinburgh, Oct. 15, 1996, 35 pages.
Belaid, A., et al., “A Syntactic Approach for Handwritten Mathematical Formula Recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-6, No. 1, Jan. 1984, 7 pages.
Bellegarda, E. J., et al., “On-Line Handwriting Recognition Using Statistical Mixtures,” Advances in Handwriting and Drawings: A Multidisciplinary Approach, Europia, 6th International IGS Conference on Handwriting and Drawing, Paris-France, Jul. 1993, 11 pages.
Bellegarda, J. R., “A Latent Semantic Analysis Framework for Large-Span Language Modeling,” 5th European Conference on Speech, Communication and Technology, (EUROSPEECH'97), Sep. 22-25, 1997, 4 pages.
Bellegarda, J. R., “A Multispan Language Modeling Framework for Large Vocabulary Speech Recognition,” IEEE Transactions on Speech and Audio Processing, vol. 6, No. 5, Sep. 1998, 12 pages.
Bellegarda, J. R., et al., “A Novel Word Clustering Algorithm Based on Latent Semantic Analysis,” In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'96), vol. 1, 4 pages.
Bellegarda, J. R., et al., “Experiments Using Data Augmentation for Speaker Adaptation,” International Conference on Acoustics, Speech, and Signal Processing (ICASSP'95), May 9-12, 1995, 4 pages.
Bellegarda, J. R., “Exploiting Both Local and Global Constraints for Multi-Span Statistical Language Modeling,” Proceeding of the 1998 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'98), vol. 2, May 12-15, 1998, 5 pages.
Bellegarda, J. R., “Exploiting Latent Semantic Information in Statistical Language Modeling,” In Proceedings of the IEEE, Aug. 2000, vol. 88, No. 8, 18 pages.
Bellegarda, J. R., “Interaction-Driven Speech Input—A Data-Driven Approach to the Capture of Both Local and Global Language Constraints,” 1992, 7 pages, available at http://old.sigchi.org/bulletin/1998.2/bellegarda.html.
Bellegarda, J. R., “Large Vocabulary Speech Recognition with Multispan Statistical Language Models,” IEEE Transactions on Speech and Audio Processing, vol. 8, No. 1, Jan. 2000, 9 pages.
Bellegarda, J. R., et al., “Performance of the IBM Large Vocabulary Continuous Speech Recognition System on the ARPA Wall Street Journal Task,” Signal Processing VII: Theories and Applications, © 1994 European Association for Signal Processing, 4 pages.
Bellegarda, J. R., et al., “The Metamorphic Algorithm: A Speaker Mapping Approach to Data Augmentation,” IEEE Transactions on Speech and Audio Processing, vol. 2, No. 3, Jul. 1994, 8 pages.
Black, A. W., et al., “Automatically Clustering Similar Units for Unit Selection in Speech Synthesis,” In Proceedings of Eurospeech 1997, vol. 2, 4 pages.
Blair, D. C., et al., “An Evaluation of Retrieval Effectiveness for a Full-Text Document-Retrieval System,” Communications of the ACM, vol. 28, No. 3, Mar. 1985, 11 pages.
Briner, L. L., “Identifying Keywords in Text Data Processing,” In Zelkowitz, Marvin V., Ed, Directions and Challenges, 15th Annual Technical Symposium, Jun. 17, 1976, Gaithersbury, Maryland, 7 pages.
Bulyko, I., et al., “Joint Prosody Prediction and Unit Selection for Concatenative Speech Synthesis,” Electrical Engineering Department, University of Washington, Seattle, 2001, 4 pages.
Bussey, H. E., et al., “Service Architecture, Prototype Description, and Network Implications of a Personalized Information Grazing Service,” INFOCOM'90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies, Jun. 3-7, 1990, http://slrohall.com/publications/, 8 pages.
Buzo, A., et al., “Speech Coding Based Upon Vector Quantization,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. Assp-28, No. 5, Oct. 1980, 13 pages.
Caminero-Gil, J., et al., “Data-Driven Discourse Modeling for Semantic Interpretation,” In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, May 7-10, 1996, 6 pages.
Cawley, G. C., “The Application of Neural Networks to Phonetic Modelling,” PhD Thesis, University of Essex, Mar. 1996, 13 pages.
Chang, S., et al., “A Segment-based Speech Recognition System for Isolated Mandarin Syllables,” Proceedings TENCON '93, IEEE Region 10 conference on Computer, Communication, Control and Power Engineering, Oct. 19-21, 1993, vol. 3, 6 pages.
Conklin, J., “Hypertext: An Introduction and Survey,” Computer Magazine, Sep. 1987, 25 pages.
Connolly, F. T., et al., “Fast Algorithms for Complex Matrix Multiplication Using Surrogates,” IEEE Transactions on Acoustics, Speech, and Signal Processing, Jun. 1989, vol. 37, No. 6, 13 pages.
Deerwester, S., et al., “Indexing by Latent Semantic Analysis,” Journal of the American Society for Information Science, vol. 41, No. 6, Sep. 1990, 19 pages.
Deller, Jr., J. R., et al., “Discrete-Time Processing of Speech Signals,” © 1987 Prentice Hall, ISBN: 0-02-328301-7, 14 pages.
Digital Equipment Corporation, “Open VMS Software Overview,” Dec. 1995, software manual, 159 pages.
Donovan, R. E., “A New Distance Measure for Costing Spectral Discontinuities in Concatenative Speech Synthesisers,” 2001, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.6398, 4 pages.
Frisse, M. E., “Searching for Information in a Hypertext Medical Handbook,” Communications of the ACM, vol. 31, No. 7, Jul. 1988, 8 pages.
Goldberg, D., et al., “Using Collaborative Filtering to Weave an Information Tapestry,” Communications of the ACM, vol. 35, No. 12, Dec. 1992, 10 pages.
Gorin, A. L., et al., “On Adaptive Acquisition of Language,” International Conference on Acoustics, Speech, and Signal Processing (ICASSP'90), vol. 1, Apr. 3-6, 1990, 5 pages.
Gotoh, Y., et al., “Document Space Models Using Latent Semantic Analysis,” In Proceedings of Eurospeech, 1997, 4 pages.
Gray, R. M., “Vector Quantization,” IEEE ASSP Magazine, Apr. 1984, 26 pages.
Harris, F. J., “On the Use of Windows for Harmonic Analysis with the Discrete Fourier Transform,” In Proceedings of the IEEE, vol. 66, No. 1, Jan. 1978, 34 pages.
Helm, R., et al., “Building Visual Language Parsers,” In Proceedings of CHI'91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 8 pages.
Hermansky, H., “Perceptual Linear Predictive (PLP) Analysis of Speech,” Journal of the Acoustical Society of America, vol. 87, No. 4, Apr. 1990, 15 pages.
Hermansky, H., “Recognition of Speech in Additive and Convolutional Noise Based on Rasta Spectral Processing,” In proceedings of IEEE International Conference on Acoustics, speech, and Signal Processing (ICASSP'93), Apr. 27-30, 1993, 4 pages.
Hoehfeld M., et al., “Learning with Limited Numerical Precision Using the Cascade-Correlation Algorithm,” IEEE Transactions on Neural Networks, vol. 3, No. 4, Jul. 1992, 18 pages.
Holmes, J. N., “Speech Synthesis and Recognition—Stochastic Models for Word Recognition,” Speech Synthesis and Recognition, Published by Chapman & Hall, London, ISBN 0 412 534304, © 1998 J. N. Holmes, 7 pages.
Hon, H.W., et al., “CMU Robust Vocabulary-Independent Speech Recognition System,” IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-91), Apr. 14-17, 1991, 4 pages.
IBM Technical Disclosure Bulletin, “Speech Editor,” vol. 29, No. 10, Mar. 10, 1987, 3 pages.
IBM Technical Disclosure Bulletin, “Integrated Audio-Graphics User Interface,” vol. 33, No. 11, Apr. 1991, 4 pages.
IBM Technical Disclosure Bulletin, “Speech Recognition with Hidden Markov Models of Speech Waveforms,” vol. 34, No. 1, Jun. 1991, 10 pages.
Iowegian International, “FIR Filter Properties, dspGuro, Digital Signal Processing Central,” http://www.dspguru.com/dsp/taqs/fir/properties, downloaded on Jul. 28, 2010, 6 pages.
Jacobs, P. S., et al., “Scisor: Extracting Information from On-Line News,” Communications of the ACM, vol. 33, No. 11, Nov. 1990, 10 pages.
Jelinek, F., “Self-Organized Language Modeling for Speech Recognition,” Readings in Speech Recognition, edited by Alex Waibel and Kai-Fu Lee, May 15, 1990, © 1990 Morgan Kaufmann Publishers, Inc., ISBN: 1-55860-124-4, 63 pages.
Jennings, A., et al., “A Personal News Service Based on a User Model Neural Network,” IEICE Transactions on Information and Systems, vol. E75-D, No. 2, Mar. 1992, Tokyo, JP, 12 pages.
Ji, T., et al., “A Method for Chinese Syllables Recognition based upon Sub-syllable Hidden Markov Model,” 1994 International Symposium on Speech, Image Processing and Neural Networks, Apr. 13-16, 1994, Hong Kong, 4 pages.
Jones, J., “Speech Recognition for Cyclone,” Apple Computer, Inc., E.R.S., Revision 2.9, Sep. 10, 1992, 93 pages.
Katz, S. M., “Estimation of Probabilities from Sparse Data for the Language Model Component of a Speech Recognizer,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-35, No. 3, Mar. 1987, 3 pages.
Kitano, H., “PhiDM-Dialog, An Experimental Speech-to-Speech Dialog Translation System,” Jun. 1991 Computer, vol. 24, No. 6, 13 pages.
Klabbers, E., et al., “Reducing Audible Spectral Discontinuities,” IEEE Transactions on Speech and Audio Processing, vol. 9, No. 1, Jan. 2001, 13 pages.
Klatt, D. H., “Linguistic Uses of Segmental Duration in English: Acoustic and Perpetual Evidence,” Journal of the Acoustical Society of America, vol. 59, No. 5, May 1976, 16 pages.
Kominek, J., et al., “Impact of Durational Outlier Removal from Unit Selection Catalogs,” 5th ISCA Speech Synthesis Workshop, Jun. 14-16, 2004, 6 pages.
Kubala, F., et al., “Speaker Adaptation from a Speaker-Independent Training Corpus,” International Conference on Acoustics, Speech, and Signal Processing (ICASSP'90), Apr. 3-6, 1990, 4 pages.
Kubala, F., et al., “The Hub and Spoke Paradigm for CSR Evaluation,” Proceedings of the Spoken Language Technology Workshop, Mar. 6-8, 1994, 9 pages.
Lee, K.F., “Large-Vocabulary Speaker-Independent Continuous Speech Recognition: The Sphinx System,” Apr. 18, 1988, Partial fulfillment of the requirements for the degree of Doctor of Philosophy, Computer Science Department, Carnegie Mellon University, 195 pages.
Lee, L., et al., “A Real-Time Mandarin Dictation Machine for Chinese Language with Unlimited Texts and Very Large Vocabulary,” International Conference on Acoustics, Speech and Signal Processing, vol. 1, Apr. 3-6, 1990, 5 pages.
Lee, L, et al., “Golden Mandarin(II)—An Improved Single-Chip Real-Time Mandarin Dictation Machine for Chinese Language with Very Large Vocabulary,” 0-7803-0946-4/93 © 1993IEEE, 4 pages.
Lee, L, et al., “Golden Mandarin(II)—An Intelligent Mandarin Dictation Machine for Chinese Character Input with Adaptation/Learning Functions,” International Symposium on Speech, Image Processing and Neural Networks, Apr. 13-16, 1994, Hong Kong, 5 pages.
Lee, L., et al., “System Description of Golden Mandarin (I) Voice Input for Unlimited Chinese Characters,” International Conference on Computer Processing of Chinese & Oriental Languages, vol. 5, Nos. 3 & 4, Nov. 1991, 16 pages.
Lin, C.H., et al., “A New Framework for Recognition of Mandarin Syllables With Tones Using Sub-syllabic Unites,” IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-93), Apr. 27-30, 1993, 4 pages.
Linde, Y., et al., “An Algorithm for Vector Quantizer Design,” IEEE Transactions on Communications, vol. 28, No. 1, Jan. 1980, 12 pages.
Liu, F.H., et al., “Efficient Joint Compensation of Speech for the Effects of Additive Noise and Linear Filtering,” IEEE International Conference of Acoustics, Speech, and Signal Processing, ICASSP-92, Mar. 23-26, 1992, 4 pages.
Logan, B., “Mel Frequency Cepstral Coefficients for Music Modeling,” In International Symposium on Music Information Retrieval, 2000, 2 pages.
Lowerre, B. T., “The-HARPY Speech Recognition System,” Doctoral Dissertation, Department of Computer Science, Carnegie Mellon University, Apr. 1976, 20 pages.
Maghbouleh, A., “An Empirical Comparison of Automatic Decision Tree and Linear Regression Models for Vowel Durations,” Revised version of a paper presented at the Computational Phonology in Speech Technology workshop, 1996 annual meeting of the Association for Computational Linguistics in Santa Cruz, California, 7 pages.
Markel, J. D., et al., “Linear Prediction of Speech,” Springer-Verlag, Berlin Heidelberg New York 1976, 12 pages.
Morgan, B., “Business Objects,” (Business Objects for Windows) Business Objects Inc., DBMS Sep. 1992, vol. 5, No. 10, 3 pages.
Mountford, S. J., et al., “Talking and Listening to Computers,” The Art of Human-Computer Interface Design, Copyright © 1990 Apple Computer, Inc. Addison-Wesley Publishing Company, Inc., 17 pages.
Murty, K. S. R., et al., “Combining Evidence from Residual Phase and MFCC Features for Speaker Recognition,” IEEE Signal Processing Letters, vol. 13, No. 1, Jan. 2006, 4 pages.
Murveit H. et al., “Integrating Natural Language Constraints into HMM-based Speech Recognition,” 1990 International Conference on Acoustics, Speech, and Signal Processing, Apr. 3-6, 1990, 5 pages.
Nakagawa, S., et al., “Speaker Recognition by Combining MFCC and Phase Information,” IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), Mar. 14-19, 2010, 4 pages.
Niesler, T. R., et al., “A Variable-Length Category-Based N-Gram Language Model,” IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'96), vol. 1, May 7-10, 1996, 6 pages.
Papadimitriou, C. H., et al., “Latent Semantic Indexing: A Probabilistic Analysis,” Nov. 14, 1997, http://citeseerx.ist.psu.edu/messages/downloadsexceeded.html, 21 pages.
Parsons, T. W., “Voice and Speech Processing,” Linguistics and Technical Fundamentals, Articulatory Phonetics and Phonemics, © 1987 McGraw-Hill, Inc., ISBN: 0-07-0485541-0, 5 pages.
Parsons, T. W., “Voice and Speech Processing,” Pitch and Formant Estimation, © 1987 McGraw-Hill, Inc., ISBN: 0-07-0485541-0, 15 pages.
Picone, J., “Continuous Speech Recognition Using Hidden Markov Models,” IEEE ASSP Magazine, vol. 7, No. 3, Jul. 1990, 16 pages.
Rabiner, L. R., et al., “Fundamental of Speech Recognition,” © 1993 AT&T, Published by Prentice-Hall, Inc., ISBN: 0-13-285826-6, 17 pages.
Rabiner, L. R., et al., “Note on the Properties of a Vector Quantizer for LPC Coefficients,” The Bell System Technical Journal, vol. 62, No. 8, Oct. 1983, 9 pages.
Ratcliffe, M., “ClearAccess 2.0 allows SQL searches off-line,” (Structured Query Language), ClearAcess Corp., MacWeek Nov. 16, 1992, vol. 6, No. 41, 2 pages.
Remde, J. R., et al., “SuperBook: An Automatic Tool for Information Exploration-Hypertext?,” In Proceedings of Hypertext'87 papers, Nov. 13-15, 1987, 14 pages.
Reynolds, C. F., “On-Line Reviews: A New Application of the HICOM Conferencing System,” IEE Colloquium on Human Factors in Electronic Mail and Conferencing Systems, Feb. 3, 1989, 4 pages.
Rigoll, G., “Speaker Adaptation for Large Vocabulary Speech Recognition Systems Using Speaker Markov Models,” International Conference on Acoustics, Speech, and Signal Processing (ICASSP'89), May 23-26, 1989, 4 pages.
Riley, M. D., “Tree-Based Modelling of Segmental Durations,” Talking Machines Theories, Models, and Designs, 1992 © Elsevier Science Publishers B.V., North-Holland, ISBN: 08-444-89115.3, 15 pages.
Rivoira, S., et al., “Syntax and Semantics in a Word-Sequence Recognition System,” IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'79), Apr. 1979, 5 pages.
Rosenfeld, R., “A Maximum Entropy Approach to Adaptive Statistical Language Modelling,” Computer Speech and Language, vol. 10, No. 3, Jul. 1996, 25 pages.
Roszkiewicz, A., “Extending your Apple,” Back Talk—Lip Service, A+ Magazine, The Independent Guide for Apple Computing, vol. 2, No. 2, Feb. 1984, 5 pages.
Sakoe, H., et al., “Dynamic Programming Algorithm Optimization for Spoken Word Recognition,” IEEE Transactins on Acoustics, Speech, and Signal Processing, Feb. 1978, vol. ASSP-26 No. 1, 8 pages.
Salton, G., et al., “On the Application of Syntactic Methodologies in Automatic Text Analysis,” Information Processing and Management, vol. 26, No. 1, Great Britain 1990, 22 pages.
Savoy, J., “Searching Information in Hypertext Systems Using Multiple Sources of Evidence,” International Journal of Man-Machine Studies, vol. 38, No. 6, Jun. 1993, 15 pages.
Scagliola, C., “Language Models and Search Algorithms for Real-Time Speech Recognition,” International Journal of Man-Machine Studies, vol. 22, No. 5, 1985, 25 pages.
Schmandt, C., et al., “Augmenting a Window System with Speech Input,” IEEE Computer Society, Computer Aug. 1990, vol. 23, No. 8, 8 pages.
Schütze, H., “Dimensions of Meaning,” Proceedings of Supercomputing'92 Conference, Nov. 16-20, 1992, 10 pages.
Sheth B., et al., “Evolving Agents for Personalized Information Filtering,” In Proceedings of the Ninth Conference on Artificial Intelligence for Applications, Mar. 1-5, 1993, 9 pages.
Shikano, K., et al., “Speaker Adaptation Through Vector Quantization,” IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'86), vol. 11, Apr. 1986, 4 pages.
Sigurdsson, S., et al., “Mel Frequency Cepstral Coefficients: An Evaluation of Robustness of MP3 Encoded Music,” In Proceedings of the 7th International Conference on Music Information Retrieval (ISMIR), 2006, 4 pages.
Silverman, K. E. A., et al., “Using a Sigmoid Transformation for Improved Modeling of Phoneme Duration,” Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Mar. 15-19, 1999, 5 pages.
Tenenbaum, A.M., et al., “Data Structure Using Pascal,” 1981 Prentice-Hall, Inc., 34 pages.
Tsai, W.H., et al., “Attributed Grammar—A Tool for Combining Syntactic and Statistical Approaches to Pattern Recognition,” IEEE Transactions on Systems, Man, and Cybernetics, vol. SMC-10, No. 12, Dec. 1980, 13 pages.
Udell, J., “Computer Telephony,” BYTE, vol. 19, No. 7, Jul. 1, 1994, 9 pages.
van Santen, J. P. H., “Contextual Effects on Vowel Duration,” Journal Speech Communication, vol. 11, No. 6, Dec. 1992, 34 pages.
Vepa, J., et al., “New Objective Distance Measures for Spectral Discontinuities in Concatenative Speech Synthesis,” In Proceedings of the IEEE 2002 Workshop on Speech Synthesis, 4 pages.
Verschelde, J., “MATLAB Lecture 8. Special Matrices in MATLAB,” Nov. 23, 2005, UIC Dept. of Math., Stat.. & C.S., MCS 320, Introduction to Symbolic Computation, 4 pages.
Vingron, M. “Near-Optimal Sequence Alignment,” Deutsches Krebsforschungszentrum (DKFZ), Abteilung Theoretische Bioinformatik, Heidelberg, Germany, Jun. 1996, 20 pages.
Werner, S., et al., “Prosodic Aspects of Speech,” Université de Lausanne, Switzerland, 1994, Fundamentals of Speech Synthesis and Speech Recognition: Basic Concepts, State of the Art, and Future Challenges, 18 pages.
Wikipedia, “Mel Scale,” Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/Mel—scale, 2 pages.
Wikipedia, “Minimum Phase,” Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/Minimum—phase, 8 pages.
Wolff, M., “Poststructuralism and the ARTFUL Database: Some Theoretical Considerations,” Information Technology and Libraries, vol. 13, No. 1, Mar. 1994, 10 pages.
Wu, M., “Digital Speech Processing and Coding,” ENEE408G Capstone-Multimedia Signal Processing, Spring 2003, Lecture-2 course presentation, University of Maryland, College Park, 8 pages.
Wu, M., “Speech Recognition, Synthesis, and H.C.I.,” ENEE408G Capstone-Multimedia Signal Processing, Spring 2003, Lecture-3 course presentation, University of Maryland, College Park, 11 pages.
Wyle, M. F., “A Wide Area Network Information Filter,” In Proceedings of First International Conference on Artificial Intelligence on Wall Street, Oct. 9-11, 1991, 6 pages.
Yankelovich, N., et al., “Intermedia: The Concept and the Construction of a Seamless Information Environment,” Computer Magazine, Jan. 1988, © 1988 IEEE, 16 pages.
Yoon, K., et al., “Letter-to-Sound Rules for Korean,” Department of Linguistics, The Ohio State University, 2002, 4 pages.
Zhao, Y., “An Acoustic-Phonetic-Based Speaker Adaptation Technique for Improving Speaker-Independent Continuous Speech Recognition,” IEEE Transactions on Speech and Audio Processing, vol. 2, No. 3, Jul. 1994, 15 pages.
Zovato, E., et al., “Towards Emotional Speech Synthesis: A Rule Based Approach,” 2 pages.
International Search Report dated Nov. 9, 1994, received in International Application No. PCT/US1993/12666, which corresponds to U.S. Appl. No. 07/999,302, 8 pages (Robert Don Strong).
International Preliminary Examination Report dated Mar. 1, 1995, received in International Application No. PCT/US1993/12666, which corresponds to U.S. Appl. No. 07/999,302, 5 pages (Robert Don Strong).
International Preliminary Examination Report dated Apr. 10, 1995, received in International Application No. PCT/US1993/12637, which corresponds to U.S. Appl. No. 07/999,354, 7 pages (Alejandro Acero).
International Search Report dated Feb. 8, 1995, received in International Application No. PCT/US1994/11011, which corresponds to U.S. Appl. No. 08/129,679, 7 pages (Yen-Lu Chow).
International Preliminary Examination Report dated Feb. 28, 1996, received in International Application No. PCT/US1994/11011, which corresponds to U.S. Appl. No. 08/129,679, 4 pages (Yen-Lu Chow).
Written Opinion dated Aug. 21, 1995, received in International Application No. PCT/US1994/11011, which corresponds to U.S. Appl. No. 08/129,679, 4 pages (Yen-Lu Chow).
International Search Report dated Nov. 8, 1995, received in International Application No. PCT/US1995/08369, which corresponds to U.S. Appl. No. 08/271,639, 6 pages (Peter V. De Souza).
International Preliminary Examination Report dated Oct. 9, 1996, received in International Application No. PCT/US1995/08369, which corresponds to U.S. Appl. No. 08/271,639, 4 pages (Peter V. De Souza).
Canadian Office Action dated Mar. 27, 2013 for Application No. 2,793,118, 3 pages.
Office Action dated Mar. 7, 2013, received in U.S. Appl. No. 13/492,809, 26 pages (Gruber).
Agnäs, MS., et al., “Spoken Language Translator: First-Year Report,” Jan. 1994, SICS (ISSN 0283-3638), SRI and Telia Research AB, 161 pages.
Allen, J., “Natural Language Understanding,” 2nd Edition, Copyright © 1995 by The Benjamin/Cummings Publishing Company, Inc., 671 pages.
Alshawi, H., et al., “CLARE: A Contextual Reasoning and Cooperative Response Framework for the Core Language Engine,” Dec. 1992, SRI International, Cambridge Computer Science Research Centre, Cambridge, 273 pages.
Alshawi, H., et al., “Declarative Derivation of Database Queries from Meaning Representations,” Oct. 1991, Proceedings of the BANKAI Workshop on Intelligent Information Access, 12 pages.
Alshawi H., et al., “Logical Forms in the Core Language Engine,” 1989, Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, 8 pages.
Alshawi, H., et al., “Overview of the Core Language Engine,” Sep. 1988, Proceedings of Future Generation Computing Systems, Tokyo, 13 pages.
Alshawi, H., “Translation and Monotonic Interpretation/Generation,” Jul. 1992, SRI International, Cambridge Computer Science Research Centre, Cambridge, 18 pages, http://www.cam.sri.com/tr/crc024/paper.ps.Z—1992.
Appelt, D., et al., “Fastus: A Finite-state Processor for Information Extraction from Real-world Text,” 1993, Proceedings of IJCAI, 8 pages.
Appelt, D., et al., “SRI: Description of the JV-FASTUS System Used for MUC-5,” 1993, SRI International, Artificial Intelligence Center, 19 pages.
Appelt, D., et al., SRI International Fastus System MUC-6 Test Results and Analysis, 1995, SRI International, Menlo Park, California, 12 pages.
Archbold, A., et al., “A Team User's Guide,” Dec. 21, 1981, SRI International, 70 pages.
Bear, J., et al., “A System for Labeling Self-Repairs in Speech,” Feb. 22, 1993, SRI International, 9 pages.
Bear, J., et al., “Detection and Correction of Repairs in Human-Computer Dialog,” May 5, 1992, SRI International, 11 pages.
Bear, J., et al., “Integrating Multiple Knowledge Sources for Detection and Correction of Repairs in Human-Computer Dialog,” 1992, Proceedings of the 30th annual meeting on Association for Computational Linguistics (ACL), 8 pages.
Bear, J., et al., “Using Information Extraction to Improve Document Retrieval,” 1998, SRI International, Menlo Park, California, 11 pages.
Berry, P., et al., “Task Management under Change and Uncertainty Constraint Solving Experience with the CALO Project,” 2005, Proceedings of CP'05 Workshop on Constraint Solving under Change, 5 pages.
Bobrow, R. et al., “Knowledge Representation for Syntactic/Semantic Processing,” From: AAA-80 Proceedings. Copyright © 1980, AAAI, 8 pages.
Bouchou, B., et al., “Using Transducers in Natural Language Database Query,” Jun. 17-19, 1999, Proceedings of 4th International Conference on Applications of Natural Language to Information Systems, Austria, 17 pages.
Bratt, H., et al., “The SRI Telephone-based ATIS System,” 1995, Proceedings of ARPA Workshop on Spoken Language Technology, 3 pages.
Bulyko, I. et al., “Error-Correction Detection and Response Generation in a Spoken Dialogue System,” © 2004 Elsevier B.V., specom. 2004.09.009, 18 pages.
Burke, R., et al., “Question Answering from Frequently Asked Question Files,” 1997, AI Magazine, vol. 18, No. 2, 10 pages.
Burns, A., et al., “Development of a Web-Based Intelligent Agent for the Fashion Selection and Purchasing Process via Electronic Commerce,” Dec. 31, 1998, Proceedings of the Americas Conference on Information system (AMCIS), 4 pages.
Carter, D., “Lexical Acquisition in the Core Language Engine,” 1989, Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics, 8 pages.
Carter, D., et al., “The Speech-Language Interface in the Spoken Language Translator,” Nov. 23, 1994, SRI International, 9 pages.
Chai, J., et al., “Comparative Evaluation of a Natural Language Dialog Based System and a Menu Driven System for Information Access: a Case Study,” Apr. 2000, Proceedings of the International Conference on Multimedia Information Retrieval (RIAO), Paris, 11 pages.
Cheyer, A., et al., “Multimodal Maps: An Agent-based Approach,” International Conference on Cooperative Multimodal Communication, 1995, 15 pages.
Cheyer, A., et al., “The Open Agent Architecture,” Autonomous Agents and Multi-Agent systems, vol. 4, Mar. 1, 2001, 6 pages.
Cheyer, A., et al., “The Open Agent Architecture: Building communities of distributed software agents” Feb. 21, 1998, Artificial Intelligence Center SRI International, Power Point presentation, downloaded from http://www.ai.sri.com/˜oaa/, 25 pages.
Codd, E. F., “Databases: Improving Usability and Responsiveness—‘How About Recently’,” Copyright © 1978, by Academic Press, Inc., 28 pages.
Cohen, P.R., et al., “An Open Agent Architecture,” 1994, 8 pages. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.480.
Coles, L. S., et al., “Chemistry Question-Answering,” Jun. 1969, SRI International, 15 pages.
Coles, L. S., “Techniques for Information Retrieval Using an Inferential Question-Answering System with Natural-Language Input,” Nov. 1972, SRI International, 198 Pages.
Coles, L. S., “The Application of Theorem Proving to Information Retrieval,” Jan. 1971, SRI International, 21 pages.
Constantinides, P., et al., “A Schema Based Approach to Dialog Control,” 1998, Proceedings of the International Conference on Spoken Language Processing, 4 pages.
Cox, R. V., et al., “Speech and Language Processing for Next-Millennium Communications Services,” Proceedings of the IEEE, vol. 88, No. 8, Aug. 2000, 24 pages.
Craig, J., et al., “Deacon: Direct English Access and Control,” Nov. 7-10, 1966 AFIPS Conference Proceedings, vol. 19, San Francisco, 18 pages.
Dar, S., et al., “DTL's DataSpot: Database Exploration Using Plain Language,” 1998 Proceedings of the 24th VLDB Conference, New York, 5 pages.
Decker, K., et al., “Designing Behaviors for Information Agents,” The Robotics Institute, Carnegie-Mellon University, paper, Jul. 6, 1996, 15 pages.
Decker, K., et al., “Matchmaking and Brokering,” The Robotics Institute, Carnegie-Mellon University, paper, May 16, 1996, 19 pages.
Dowding, J., et al., “Gemini: A Natural Language System for Spoken-Language Understanding,” 1993, Proceedings of the Thirty-First Annual Meeting of the Association for Computational Linguistics, 8 pages.
Dowding, J., et al., “Interleaving Syntax and Semantics in an Efficient Bottom-Up Parser,” 1994, Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, 7 pages.
Epstein, M., et al., “Natural Language Access to a Melanoma Data Base,” Sep. 1978, SRI International, 7 pages.
Exhibit 1, “Natural Language Interface Using Constrained Intermediate Dictionary of Results,” Classes/Subclasses Manually Reviewed for the Search of US Patent No. 7,177,798, Mar. 22, 2013, 1 page.
Exhibit 1, “Natural Language Interface Using Constrained Intermediate Dictionary of Results,” List of Publications Manually reviewed for the Search of US Patent No. 7,177,798, Mar. 22, 2013, 1 page.
Ferguson, G., et al., “TRIPS: An Integrated Intelligent Problem-Solving Assistant,” 1998, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 7 pages.
Fikes, R., et al., “A Network-based knowledge Representation and its Natural Deduction System,” Jul. 1977, SRI International, 43 pages.
Gambäck, B., et al., “The Swedish Core Language Engine,” 1992 NOTEX Conference, 17 pages.
Glass, J., et al., “Multilingual Language Generation Across Multiple Domains,” Sep. 18-22, 1994, International Conference on Spoken Language Processing, Japan, 5 pages.
Green, C. “The Application of Theorem Proving to Question-Answering Systems,” Jun. 1969, SRI Stanford Research Institute, Artificial Intelligence Group, 169 pages.
Gregg, D. G., “DSS Access on the WWW: An Intelligent Agent Prototype,” 1998 Proceedings of the Americas Conference on Information Systems-Association for Information Systems, 3 pages.
Grishman, R., “Computational Linguistics: An Introduction,” © Cambridge University Press 1986, 172 pages.
Grosz, B. et al., “Dialogic: A Core Natural-Language Processing System,” Nov. 9, 1982, SRI International, 17 pages.
Grosz, B. et al., “Research on Natural-Language Processing at SRI,” Nov. 1981, SRI International, 21 pages.
Grosz, B., et al., “TEAM: An Experiment in the Design of Transportable Natural-Language Interfaces,” Artificial Intelligence, vol. 32, 1987, 71 pages.
Grosz, B., “Team: A Transportable Natural-Language Interface System,” 1983, Proceedings of the First Conference on Applied Natural Language Processing, 7 pages.
Guida, G., et al., “NLI: A Robust Interface for Natural Language Person-Machine Communication,” Int. J. Man-Machine Studies, vol. 17, 1982, 17 pages.
Guzzoni, D., et al., “Active, A platform for Building Intelligent Software,” Computational Intelligence 2006, 5 pages. http://www.informatik.uni-trier.de/˜ley/pers/hd/g/Guzzoni:Didier.
Guzzoni, D., “Active: A unified platform for building intelligent assistant applications,” Oct. 25, 2007, 262 pages.
Guzzoni, D., et al., “Many Robots Make Short Work,” 1996 AAAI Robot Contest, SRI International, 9 pages.
Haas, N., et al., “An Approach to Acquiring and Applying Knowledge,” Nov. 1980, SRI International, 22 pages.
Hadidi, R., et al., “Students' Acceptance of Web-Based Course Offerings: An Empirical Assessment,” 1998 Proceedings of the Americas Conference on Information Systems (AMCIS), 4 pages.
Hawkins, J., et al., “Hierarchical Temporal Memory: Concepts, Theory, and Terminology,” Mar. 27, 2007, Numenta, Inc., 20 pages.
He, Q., et al., “Personal Security Agent: KQML-Based PKI,” The Robotics Institute, Carnegie-Mellon University, paper, Oct. 1, 1997, 14 pages.
Hendrix, G. et al., “Developing a Natural Language Interface to Complex Data,” ACM Transactions on Database Systems, vol. 3, No. 2, Jun. 1978, 43 pages.
Hendrix, G., “Human Engineering for Applied Natural Language Processing,” Feb. 1977, SRI International, 27 pages.
Hendrix, G., “Klaus: A System for Managing Information and Computational Resources,” Oct. 1980, SRI International, 34 pages.
Hendrix, G., “Lifer: A Natural Language Interface Facility,” Dec. 1976, SRI Stanford Research Institute, Artificial Intelligence Center, 9 pages.
Hendrix, G., “Natural-Language Interface,” Apr.-Jun. 1982, American Journal of Computational Linguistics, vol. 8, No. 2, 7 pages.
Hendrix, G., “The Lifer Manual: A Guide to Building Practical Natural Language Interfaces,” Feb. 1977, SRI International, 76 pages.
Hendrix, G., et al., “Transportable Natural-Language Interfaces to Databases,” Apr. 30, 1981, SRI International, 18 pages.
Hirschman, L., et al., “Multi-Site Data Collection and Evaluation in Spoken Language Understanding,” 1993, Proceedings of the workshop on Human Language Technology, 6 pages.
Hobbs, J., et al., “Fastus: A System for Extracting Information from Natural-Language Text,” Nov. 19, 1992, SRI International, Artificial Intelligence Center, 26 pages.
Hobbs, J., et al.,“Fastus: Extracting Information from Natural-Language Texts,” 1992, SRI International, Artificial Intelligence Center, 22 pages.
Hobbs, J., “Sublanguage and Knowledge,” Jun. 1984, SRI International, Artificial Intelligence Center, 30 pages.
Hodjat, B., et al., “Iterative Statistical Language Model Generation for Use with an Agent-Oriented Natural Language Interface,” vol. 4 of the Proceedings of HCI International 2003, 7 pages.
Huang, X., et al., “The SPHINX-II Speech Recognition System: An Overview,” Jan. 15, 1992, Computer, Speech and Language, 14 pages.
Issar, S., et al., “CMU's Robust Spoken Language Understanding System,” 1993, Proceedings of EUROSPEECH, 4 pages.
Issar, S., “Estimation of Language Models for New Spoken Language Applications,” Oct. 3-6, 1996, Proceedings of 4th International Conference on Spoken language Processing, Philadelphia, 4 pages.
Janas, J., “The Semantics-Based Natural Language Interface to Relational Databases,” © Springer-Verlag Berlin Heidelberg 1986, Germany, 48 pages.
Johnson, J., “A Data Management Strategy for Transportable Natural Language Interfaces,” Jun. 1989, doctoral thesis submitted to the Department of Computer Science, University of British Columbia, Canada, 285 pages.
Julia, L., et al., “http://www.speech.sri.com/demos/atis.html,” 1997, Proceedings of AAAI, Spring Symposium, 5 pages.
Kahn, M., et al., “CoABS Grid Scalability Experiments,” 2003, Autonomous Agents and Multi-Agent Systems, vol. 7, 8 pages.
Kamel, M., et al., “A Graph Based Knowledge Retrieval System,” © 1990 IEEE, 7 pages.
Katz, B., “Annotating the World Wide Web Using Natural Language,” 1997, Proceedings of the 5th RIAO Conference on Computer Assisted Information Searching on the Internet, 7 pages.
Katz, B., “A Three-Step Procedure for Language Generation,” Dec. 1980, Massachusetts Institute of Technology, Artificial Intelligence Laboratory, 42 pages.
Katz, B., et al., “Exploiting Lexical Regularities in Designing Natural Language Systems,” 1988, Proceedings of the 12th International Conference on Computational Linguistics, Coling'88, Budapest, Hungary, 22 pages.
Katz, B., et al., “REXTOR: A System for Generating Relations from Natural Language,” In Proceedings of the ACL Oct. 2000 Workshop on Natural Language Processing and Information Retrieval (NLP&IR), 11 pages.
Katz, B., “Using English for Indexing and Retrieving,” 1988 Proceedings of the 1st RIAO Conference on User-Oriented Content-Based Text and Image (RIAO'88), 19 pages.
Konolige, K., “A Framework for a Portable Natural-Language Interface to Large Data Bases,” Oct. 12, 1979, SRI International, Artificial Intelligence Center, 54 pages.
Laird, J., et al., “SOAR: An Architecture for General Intelligence,” 1987, Artificial Intelligence vol. 33, 64 pages.
Langly, P., et al.,“A Design for the Icarus Architechture,” SIGART Bulletin, vol. 2, No. 4, 6 pages.
Larks, “Intelligent Software Agents: Larks,” 2006, downloaded on Mar. 15, 2013 from http://www.cs.cmu.edu/larks.html, 2 pages.
Martin, D., et al., “Building Distributed Software Systems with the Open Agent Architecture,” Mar. 23-25, 1998, Proceedings of the Third International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, 23 pages.
Martin, D., et al., “Development Tools for the Open Agent Architecture,” Apr. 1996, Proceedings of the International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, 17 pages.
Martin, D., et al., “Information Brokering in an Agent Architecture,” Apr. 1997, Proceedings of the second International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, 20 pages.
Martin, D., et al., “PAAM '98 Tutorial: Building and Using Practical Agent Applications,” 1998, SRI International, 78 pages.
Martin, P., et al., “Transportability and Generality in a Natural-Language Interface System,” Aug. 8-12, 1983, Proceedings of the Eight International Joint Conference on Artificial Intelligence, West Germany, 21 pages.
Matiasek, J., et al., “Tamic-P: A System for NL Access to Social Insurance Database,” Jun. 17-19, 1999, Proceeding of the 4th International Conference on Applications of Natural Language to Information Systems, Austria, 7 pages.
Michos, S.E., et al., “Towards an adaptive natural language interface to command languages,” Natural Language Engineering 2 (3), © 1994 Cambridge University Press, 19 pages.
Milstead, J., et al., “Metadata: Cataloging by Any Other Name . . . ” Jan. 1999, Online, Copyright © 1999 Information Today, Inc., 18 pages.
Minker, W., et al., “Hidden Understanding Models for Machine Translation,” 1999, Proceedings of ETRW on Interactive Dialogue in Multi-Modal Systems, 4 pages.
Modi, P. J., et al., “CMRadar: A Personal Assistant Agent for Calendar Management,” © 2004, American Association for Artificial Intelligence, Intelligent Systems Demonstrations, 2 pages.
Moore, R., et al., “Combining Linguistic and Statistical Knowledge Sources in Natural-Language Processing for ATIS,” 1995, SRI International, Artificial Intelligence Center, 4 pages.
Moore, R., “Handling Complex Queries in a Distributed Data Base,” Oct. 8, 1979, SRI International, Artificial Intelligence Center, 38 pages.
Moore, R., “Practical Natural-Language Processing by Computer,” Oct. 1981, SRI International, Artificial Intelligence Center, 34 pages.
Moore, R., et al., “SRI's Experience with the ATIS Evaluation,” Jun. 24-27, 1990, Proceedings of a workshop held at Hidden Valley, Pennsylvania, 4 pages.
Moore, et al., “The Information Warefare Advisor: An Architecture for Interacting with Intelligent Agents Across the Web,” Dec. 31, 1998 Proceedings of Americas Conference on Information Systems (AMCIS), 4 pages.
Moore, R., “The Role of Logic in Knowledge Representation and Commonsense Reasoning,” Jun. 1982, SRI International, Artificial Intelligence Center, 19 pages.
Moore, R., “Using Natural-Language Knowledge Sources in Speech Recognition,” Jan. 1999, SRI International, Artificial Intelligence Center, 24 pages.
Moran, D., et al., “Intelligent Agent-based User Interfaces,” Oct. 12-13, 1995, Proceedings of International Workshop on Human Interface Technology, University of Aizu, Japan, 4 pages. http://www.dougmoran.com/dmoran/PAPERS/oaa-iwhit1995.pdf.
Moran, D., “Quantifier Scoping in the SRI Core Language Engine,” 1988, Proceedings of the 26th annual meeting on Association for Computational Linguistics, 8 pages.
Motro, A., “Flex: A Tolerant and Cooperative User Interface to Databases,” IEEE Transactions on Knowledge and Data Engineering, vol. 2, No. 2, Jun. 1990, 16 pages.
Murveit, H., et al., “Speech Recognition in SRI's Resource Management and ATIS Systems,” 1991, Proceedings of the workshop on Speech and Natural Language (HTL'91), 7 pages.
OAA, “The Open Agent Architecture 1.0 Distribution Source Code,” Copyright 1999, SRI International, 2 pages.
Odubiyi, J., et al., “SAIRE—a scalable agent-based information retrieval engine,” 1997 Proceedings of the First International Conference on Autonomous Agents, 12 pages.
Owei, V., et al., “Natural Language Query Filtration in the Conceptual Query Language,” © 1997 IEEE, 11 pages.
Pannu, A., et al., “A Learning Personal Agent for Text Filtering and Notification,” 1996, The Robotics Institute School of Computer Science, Carnegie-Mellon University, 12 pages.
Pereira, “Logic for Natural Language Analysis,” Jan. 1983, SRI International, Artificial Intelligence Center, 194 pages.
Perrault, C.R., et al., “Natural-Language Interfaces,” Aug. 22, 1986, SRI International, 48 pages.
Pulman, S.G., et al., “Clare: A Combined Language and Reasoning Engine,” 1993, Proceedings of JFIT Conference, 8 pages. URL: http://www.cam.sri.com/tr/crc042/paper.ps.Z.
Ravishankar, “Efficient Algorithms for Speech Recognition,” May 15, 1996, Doctoral Thesis submitted to School of Computer Science, Computer Science Division, Carnegie Mellon University, Pittsburg, 146 pages.
Rayner, M., et al., “Adapting the Core Language Engine to French and Spanish,” May 10, 1996, Cornell University Library, 9 pages. http://arxiv.org/abs/cmp-lg/9605015.
Rayner, M., “Abductive Equivalential Translation and its application to Natural Language Database Interfacing,” Sep. 1993 Dissertation paper, SRI International, 163 pages.
Rayner, M., et al., “Deriving Database Queries from Logical Forms by Abductive Definition Expansion,” 1992, Proceedings of the Third Conference on Applied Natural Language Processing, ANLC'92, 8 pages.
Rayner, M., “Linguistic Domain Theories: Natural-Language Database Interfacing from First Principles,” 1993, SRI International, Cambridge, 11 pages.
Rayner, M., et al., “Spoken Language Translation With Mid-90's Technology: A Case Study,” 1993, EUROSPEECH, ISCA, 4 pages. http://dblp.uni-trier.de/db/conf/interspeech/eurospeech1993.html#RaynerBCCDGKKLPPS93.
Rudnicky, A.I., et al., “Creating Natural Dialogs in the Carnegie Mellon Communicator System.”
Russell, S., et al., “Artificial Intelligence, A Modern Approach,” © 1995 Prentice Hall, Inc., 121 pages.
Sacerdoti, E., et al., “A Ladder User's Guide (Revised),” Mar. 1980, SRI International, Artificial Intelligence Center, 39 pages.
Sagalowicz, D., “A D-Ladder User's Guide,” Sep. 1980, SRI International, 42 pages.
Sameshima, Y., et al., “Authorization with security attributes and privilege delegation Access control beyond the ACL,” Computer Communications, vol. 20, 1997, 9 pages.
San-Segundo, R., et al., “Confidence Measures for Dialogue Management in the CU Communicator System,” Jun. 5-9, 2000, Proceedings of Acoustics, Speech, and Signal Processing (ICASSP'00), 4 pages.
Sato, H., “A Data Model, Knowledge Base, and Natural Language Processing for Sharing a Large Statistical Database,” 1989, Statistical and Scientific Database Management, Lecture Notes in Computer Science, vol. 339, 20 pages.
Schnelle, D., “Context Aware Voice User Interfaces for Workflow Support,” Aug. 27, 2007, Dissertation paper, 254 pages.
Sharoff, S., et al., “Register-domain Separation as a Methodology for Development of Natural Language Interfaces to Databases,” 1999, Proceedings of Human-Computer Interaction (INTERACT'99), 7 pages.
Shimazu, H., et al., “CAPIT: Natural Language Interface Design Tool with Keyword Analyzer and Case-Based Parser,” NEC Research & Development, vol. 33, No. 4, Oct. 1992, 11 pages.
Shinkle, L., “Team User's Guide,” Nov. 1984, SRI International, Artificial Intelligence Center, 78 pages.
Shklar, L., et al., “Info Harness: Use of Automatically Generated Metadata for Search and Retrieval of Heterogeneous Information,” 1995 Proceedings of CAiSE'95, Finland.
Singh, N., “Unifying Heterogeneous Information Models,” 1998 Communications of the ACM, 13 pages.
Starr, B., et al., “Knowledge-Intensive Query Processing,” May 31, 1998, Proceedings of the 5th KRDB Workshop, Seattle, 6 pages.
Stern, R., et al. “Multiple Approaches to Robust Speech Recognition,” 1992, Proceedings of Speech and Natural Language Workshop, 6 pages.
Stickel, “A Nonclausal Connection-Graph Resolution Theorem-Proving Program,” 1982, Proceedings of AAAI'82, 5 pages.
Sugumaran, V., “A Distributed Intelligent Agent-Based Spatial Decision Support System,” Dec. 31, 1998, Proceedings of the Americas Conference on Information systems (AMCIS), 4 pages.
Sycara, K., et al., “Coordination of Multiple Intelligent Software Agents,” International Journal of Cooperative Information Systems (IJCIS), vol. 5, Nos. 2 & 3, Jun. & Sep. 1996, 33 pages.
Sycara, K., et al., “Distributed Intelligent Agents,” IEEE Expert, vol. 11, No. 6, Dec. 1996, 32 pages.
Sycara, K., et al., “Dynamic Service Matchmaking Among Agents in Open Information Environments ,” 1999, SIGMOD Record, 7 pages.
Sycara, K., et al., “The RETSINA MAS Infrastructure,” 2003, Autonomous Agents and Multi-Agent Systems, vol. 7, 20 pages.
Tyson, M., et al., “Domain-Independent Task Specification in the TACITUS Natural Language System,” May 1990, SRI International, Artificial Intelligence Center, 16 pages.
Wahlster, W., et al., “Smartkom: multimodal communication with a life-like character,” 2001 EUROSPEECH-Scandinavia, 7th European Conference on Speech Communication and Technology, 5 pages.
Waldinger, R., et al., “Deductive Question Answering from Multiple Resources,” 2003, New Directions in Question Answering, published by AAAI, Menlo Park, 22 pages.
Walker, D., et al., “Natural Language Access to Medical Text,” Mar. 1981, SRI International, Artificial Intelligence Center, 23 pages.
Waltz, D., “An English Language Question Answering System for a Large Relational Database,” © 1978 ACM, vol. 21, No. 7, 14 pages.
Ward, W., et al., “A Class Based Language Model for Speech Recognition,” © 1996 IEEE, 3 pages.
Ward, W., et al., “Recent Improvements in the CMU Spoken Language Understanding System,” 1994, ARPA Human Language Technology Workshop, 4 pages.
Ward, W., “The CMU Air Travel Information Service: Understanding Spontaneous Speech,” 3 pages.
Warren, D.H.D., et al., “An Efficient Easily Adaptable System for Interpreting Natural Language Queries,” Jul.-Dec. 1982, American Journal of Computational Linguistics, vol. 8, No. 3-4, 11 pages.
Weizenbaum, J., “ELIZA—A Computer Program for the Study of Natural Language Communication Between Man and Machine,” Communications of the ACM, vol. 9, No. 1, Jan. 1966, 10 pages.
Winiwarter, W., “Adaptive Natural Language Interfaces to FAQ Knowledge Bases,” Jun. 17-19, 1999, Proceedings of 4th International Conference on Applications of Natural Language to Information Systems, Austria, 22 pages.
Wu, X. et al., “KDA: A Knowledge-based Database Assistant,” Data Engineering, Feb. 6-10, 1989, Proceeding of the Fifth International Conference on Engineering (IEEE Cat. No. 89CH2695-5), 8 pages.
Yang, J., et al., “Smart Sight: A Tourist Assistant System,” 1999 Proceedings of Third International Symposium on Wearable Computers, 6 pages.
Zeng, D., et al., “Cooperative Intelligent Software Agents,” The Robotics Institute, Carnegie-Mellon University, Mar. 1995, 13 pages.
Zhao, L., “Intelligent Agents for Flexible Workflow Systems,” Oct. 31, 1998 Proceedings of the Americas Conference on Information Systems (AMCIS), 4 pages.
Zue, V., et al., “From Interface to Content: Translingual Access and Delivery of On-Line Information,” 1997, EUROSPEECH, 4 pages.
Zue, V., et al., “Jupiter: A Telephone-Based Conversational Interface for Weather Information,” Jan. 2000, IEEE Transactions on Speech and Audio Processing, 13 pages.
Zue, V., et al., “Pegasus: A Spoken Dialogue Interface for On-Line Air Travel Planning,” 1994 Elsevier, Speech Communication 15 (1994), 10 pages.
Zue, V., et al., “The Voyager Speech Understanding System: Preliminary Development and Evaluation,” 1990, Proceedings of IEEE 1990 International Conference on Acoustics, Speech, and Signal Processing, 4 pages.
Australian Office Action dated Jul. 2, 2013 for Application No. 2011205426, 9 pages.
Certificate of Examination dated Apr. 29, 2013 for Australian Patent No. 2012101191, 4 pages.
Certificate of Examination dated May 21, 2013 for Australian Patent No. 2012101471, 5 pages.
Certificate of Examination dated May 10, 2013 for Australian Patent No. 2012101466, 4 pages.
Certificate of Examination dated May 9, 2013 for Australian Patent No. 2012101473, 4 pages.
Certificate of Examination dated May 6, 2013 for Australian Patent No. 2012101470, 5 pages.
Certificate of Examination dated May 2, 2013 for Australian Patent No. 2012101468, 5 pages.
Certificate of Examination dated May 6, 2013 for Australian Patent No. 2012101472, 5 pages.
Certificate of Examination dated May 6, 2013 for Australian Patent No. 2012101469, 4 pages.
Certificate of Examination dated May 13, 2013 for Australian Patent No. 2012101465, 5 pages.
Certificate of Examination dated May 13, 2013 for Australian Patent No. 2012101467, 5 pages.
Notice of Allowance dated Jul. 10, 2013, received in U.S. Appl. No. 13/725,656, 14 pages (Gruber).
Notice of Allowance dated Jun. 12, 2013, received in U.S. Appl. No. 11/518,292, 16 pages (Cheyer).
Final Office Action dated Jun. 13, 2013, received in U.S. Appl. No. 13/251,118, 42 pages (Gruber).
Office Action dated Jul. 26, 2013, received in U.S. Appl. No. 13/725,512, 36 pages (Gruber).
Office Action dated Jul. 11, 2013, received in U.S. Appl. No. 13/784,707, 29 pages (Cheyer).
Office Action dated Jul. 5, 2013, received in U.S. Appl. No. 13/725,713, 34 pages (Guzzoni).
Office Action dated Jul. 2, 2013, received in U.S. Appl. No. 13/725,761, 14 pages (Gruber).
Office Action dated Jun. 28, 2013, received in U.S. Appl. No. 13/725,616, 29 pages (Cheyer).
Office Action dated Jun. 27, 2013, received in U.S. Appl. No. 13/725,742, 29 pages (Cheyer).
Office Action dated Jul. 5, 2013, received in U.S. Appl. No. 13/725,481, 26 pages (Gruber).
Extended European Search Report received for European Patent Application No. 12185276.8, mailed on Dec. 18, 2012, 4 pages.
Extended European Search Report received for European Patent Application No. 12186663.6 mailed on Jul. 16, 2013, 6 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/029810, mailed on Oct. 3, 2013, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/029810, mailed on Aug. 17, 2012, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/040971, mailed on Nov. 12, 2013, 11 pages.
“2004 Chrysler Pacifica: U-Connect Hands-Free Communication System”, The Best and Brightest of 2004, Brief Article, Automotive Industries, Sep. 2003, 1 page.
“2007 Lexus GS 450h 4dr Sedan (3.5L 6cyl Gas/Electric Hybrid CVT)”, available at <http://review.cnet.com/4505-10865—16-31833144.html>, retrieved on Aug. 3, 2006, 10 pages.
“All Music Website”, available at <http://www.allmusic.com/>, retrieved on Mar. 19, 2007, 2 pages.
“BluePhoneElite: About”, available at <http://www.reelintelligence.com/BluePhoneElite>, retrieved on Sep. 25, 2006, 2 pages.
“BluePhoneElite: Features”, available at <http://www.reelintelligence.com/BluePhoneElite/features.shtml,>, retrieved on Sep. 25, 2006, 2 pages.
Yunker, John, “Beyond Borders: Web Globalization Strategies”, New Riders, Aug. 22, 2002, 11 pages.
“Interactive Voice”, available at <http://www.helloivee.com/company/>, retrieved on Feb. 10, 2014, 2 pages.
“Meet Ivee, Your Wi-Fi Voice Activated Assistant”, available at <http://www.helloivee.com/>, retrieved on Feb. 10, 2014, 8 pages.
“What is Fuzzy Logic?”, available at <http://www.cs.cmu.edu>, retrieved on Apr. 15, 1993, 5 pages.
“Speaker Recognition”, Wikipedia, The Free Enclyclopedia, Nov. 2, 2010, pp. 1-4.
Apple Computer, Video Entitled, “Knowledge Navigator”, published by Apple Computer no later than 2008, as depicted in Exemplary Screenshots from video entitled 'Knowledge Navigator', 2008, 7 pages.
Applebaum et al., “Enhancing the Discrimination of Speaker Independent Hidden Markov Models with Corrective Training”, International Conference on Acoustics, Speech, and Signal Processing, May 23, 1989, pp. 302-305.
Bellegarda et al., “Tied Mixture Continuous Parameter Modeling for Speech Recognition”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 38, No. 12, Dec. 1990, pp. 2033-2045.
Bellegarda, Jerome R., “Latent Semantic Mapping”, IEEE Signal Processing Magazine, vol. 22, No. 5, Sep. 2005, pp. 70-80.
Brain, “How MP3 Files Work”, available at <http://www.howstuffworks.com>, retrieved on Mar. 19, 2007.
Chang et al., “Discriminative Training of Dynamic Programming based Speech Recognizers”, IEEE Transactions on Speech and Audio Processing, vol. 1, No. 2, Apr. 1993, pp. 135-143.
Cheyer et al., “Demonstration Video of Multimodal Maps Using an Agent Architecture”, published by SRI International no later than 1996, as depicted in Exemplary Screenshots from video entitled 'Demonstration Video of Multimodal Maps Using an Agent Architecture', 1996, 6 pages.
Cheyer et al., “Demonstration Video of Multimodal Maps Using an Open-Agent Architecture”, published by SRI International no later than 1996, as depicted in Exemplary Screenshots from video entitled 'Demonstratioin Video of Multimodal Maps Using an Open-Agent Architecture', 1996, 6 pages.
Cheyer, A., “Demonstration Video of Vanguard Mobile Portal”, published by SRI International no later than 2004, as depicted in 'Exemplary Screenshots from video entitled Demonstration Video of Vanguard Mobile Portal', 2004, 10 pages.
Choi et al., “Acoustic and Visual Signal based Context Awareness System for Mobile Application”, IEEE Transactions on Consumer Electronics, vol. 57, No. 2, May 2011, pp. 738-746.
Davis et al., “A Personal Handheld Multi-Modal Shopping Assistant”, International Conference on Networking and Services, IEEE, 2006, 9 pages.
Glass et al., “Multilingual Spoken-Language Understanding In the Mit Voyager System”, Speech Communication, vol. 17, No. 1-3, Aug. 1995, pp. 1-29.
Kickstarter, “Ivee Sleek: Wi-Fi Voice-Activated Assistant”, available at <https://www.kickstarter.com/projects/ivee/ivee-sleek-wi-fi-voice-activated-assistant>, retrieved on Feb. 10, 2014, 13 pages.
Navigli, Roberto, “Word Sense Disambiguation: A Survey”, Article 10, ACM Computing Surveys, vol. 41, No. 2, Feb. 2009, 70 pages.
SRI, “SRI Speech: Products: Software Development Kits: EduSpeak”, available at <http://web.archive.org/ web/20090828084033/http://www.speechatsri.com/products/eduspeak>shtml, retrieved on Jun. 20, 2013, 2 pages.
“Digital Audio in the New Era”, Electronic Design and Application, No. 6, Jun. 30, 2003, 3 pages.
“Mobile Speech Solutions, Mobile Accessibility”, SVOX AG Product Information Sheet, available at <http://www.svox.com/site/bra840604/con782768/mob965831936.aSQ?osLang=1>, Sep. 27, 2012, 1 page.
“N200 Hands-Free Bluetooth Car Kit”, available at <www.wirelessground.com>, retrieved on Mar. 19, 2007, 3 pages.
“PhatNoise”, Voice Index on Tap, Kenwood Music Keg, available at <http://www.phatnoise.com/kenwood/kenwoodssamail.html>, retrieved on Jul. 13, 2006, 1 page.
“Windows XP: A Big Surprise!-Experiencing Amazement from Windows XP”, New Computer, No. 2, Feb. 28, 2002, 8 pages.
Aikawa et al., “Genration for Multilingual MT”, available at <http://mtarchive.info/MTS-2001-Aikawa.pdf>, retrieved on Sep. 18, 2001, 6 pages.
Allen et al., “Automated Natural Spoken Dialog”, Computer, vol. 35, No. 4, Apr. 2002, pp. 51-56.
ANHUI USTC IFL YTEK Co. Ltd., “Flytek Research Center Information Datasheet”, available at <http://www.iflttek.com/english/Research.htm>, retrieved on Oct. 15, 2004, 3 pages.
Borden IV, G.R., “An Aural User Interface for Ubiquitous Computing”, Proceedings of the 6th International Symposium on Wearable Computers, IEEE, 2002, 2 pages.
Busemann et al., “Natural Language Diaglogue Service for Appointment Scheduling Agents”, Technical Report RR-97-02, Deutsches Forschungszentrum fur Kunstliche Intelligenz GmbH, 1997, 8 pages.
Dusan et al., “Multimodal Interaction on PDA's Integrating Speech and Pen Inputs”, Eurospeech Geneva, 2003, 4 pages.
Hain et al., “The Papageno TTS System”, Siemens AG, Corporate Technology, Munich, Germany, TC-STAR Workshop, 2006, 6 pages.
Quazza et al., “Actor: A Multilingual Unit-Selection Speech Synthesis System”, Proceedings of 4th ISCA Tutorial and Research Workshop on Speech Synthesis, Jan. 1, 2001, 6 pages.
Kim, E.A. Silverman., “The Structure and Processing of Fundamental Frequency Contours”, University of Cambridge Doctoral Thesis, Apr. 1987, 378 pages.
Moberg, M., “Contributions to Multilingual Low-Footprint TTS System for Hand-Held Devices”, Doctoral Thesis, Tampere University of Technology, Aug. 17, 2007, 82 pages.
Lamel et al., “Generation and Synthesis of Broadcast Messages”, Proceedings of ESCA-NATO Workshop: Applications of Speech Technology, Sep. 1, 1993, 4 pages.
Lyons et al., “Augmenting Conversations Using Dual-Purpose Speech”, Proceedings of the 17th Annual ACM Symposium on User interface Software and Technology, 2004, 10 pages.
Macsimum News, “Apple Files Patent for an Audio Interface for the iPod”, available at <http://www.macsimumnews.com/index.php/archive/apple—files—patent—for—an—audio—interface—for—the—ipod>, retrieved on Jul. 13, 2006, 8 pages.
Mahedero et al., “Natural Language Processing of Lyrics”, In Proceedings of the 13th Annual ACM International Conference on Multimedia, ACM, Nov. 6-11, 2005, 4 pages.
Ricker, Thomas, “Apple Patents Audio User Interface”, Engadget, available at <http://www.engadget.com/2006/05/04/apple-patents-audio-user-interface/>, May 4, 2006, 6 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2004/016519, mailed on Nov. 3, 2005, 16 pages.
Partial International Search Report and Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2004/016519, mailed on Aug. 4, 2005, 6 pages.
International Search Report received for PCT Patent Application No. PCT/US2011/037014, mailed on Oct. 4, 2011, 16 pages.
Invitation to Pay Additional Search Fees received for PCT Application No. PCT/US2011/037014, mailed on Aug. 2, 2011, 6 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/043098, mailed on Nov. 14, 2012, 9 pages.
Santaholma, Marianne Elina, “Grammar Sharing Techniques for Rule-based Multilingual NLP Systems”, Proceedings of the 16th Nordic Conference of Computational Linguistics, NODALIDA 2007, May 25-26, 2007, 9 pages.
Schnelle, Dirk, “Context Aware Voice User Interfaces for Workflow Support”, Dissertation Paper, Aug. 27, 2007, 254 pages.
Taylor, P. et al., “Speech Synthesis by Phonological Structure Matching”, International Speech Communication Association, vol. 2, Section 3, 1999, 4 pages.
W3C Working Draft, “Speech Synthesis Markup Language Specification for the Speech Interface Framework”, available at <http://www.w3org./Tr/speech-synthesis>, retrieved on Dec. 14, 2000, 42 pages.
Wikipedia, “Acoustic Model”, available at <http://en.wikipedia.org/wiki/AcousticModel>, retrieved on Sep. 14, 2011, 2 pages.
Wikipedia, “Language Model”, available at <http://en.wikipedia.org/wiki/Language—model>, retrieved on Sep. 14, 2011, 3 pages.
Wikipedia, “Speech recognition”, available at: <http://en.wikipedia.org/wiki/Speech—recognition>, retrieved on Sep. 14, 2011, 10 pages.
“Corporate Ladder”, BLOC Publishing Corporation, 1991, 1 page.
Badino et al., “Language Independent Phoneme Mapping for Foreign TTS”, 5th ISCA Speech Synthesis Workshop, Pittsburgh, Jun. 14-16, 2004, 2 pages.
Black et al., “Multilingual Text-to-Speech Synthesis”, Acoustics, Speech and Signal Processing (ICASSP'04), Proceedings of the IEEE International Conference, vol. 3, May 17-21, 2004, 4 pages.
Davis et al., “Stone Soup Translation”, Department of Linguistics, Ohio State University, 2001, 11 pages.
Heyer et al., “Exploring Expression Data: Identification and Analysis of Coexpressed Genes”, Genome Research, vol. 9, 19991, pp. 1106-1115.
Lafferty et al., “Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data”, Proceedings of the 18th International Conference on Machine Learning, 2001, 9 pages.
Lyons Richard F., “CCD Correlators for Auditory Models”, Proceedings of the Twenty-Fifth Asilomar Conference on Signals, Systems and Computers, IEEE, Nov. 4-6, 1991, pp. 785-789.
Marcus et al., “Building a Large Annotated Corpus of English: The Penn Treebank”, Computational Linguistics, vol. 19, No. 2, 1993, pp. 313-330.
Nilsson, B. A., “Microsoft Publisher is an Honorable Start for DTP Beginners”, Computer Shopper, Feb. 1, 1992, 2 pages.
Penn et al., “Ale for Speech: A Translation Prototype”, Bell Laboratories, 1999, 4 pages.
Rabiner et al., “Digital Processing of Speech Signals”, Prentice Hall, 1978, pp. 274-277.
Slaney et al., “On the Importance of Time—A Temporal Representation of Sound”, Visual Representation of Speech Signals, 1993, pp. 95-116.
Wilensky et al., “Talking to UNIX in English: An Overview of UC”, Communications of the ACM, vol. 27, No. 6, Jun. 1984, pp. 574-593.
Wilson, Mark, “New iPod Shuffle Moves Buttons to Headphones, Adds Text to Speech”, available at <http://gizmodo.com/5167946/new-ipod-shuffle-moves-buttons-to-headphones-adds-text-to-speech>, Mar. 11, 2009, 13 pages.
Singh et al., “Automatic Generation of Phone Sets and Lexical Transcriptions”, Acoustics, Speech and Signal Processing (ICASSP'00), 2000, 1 page.
Sullivan, Danny, “How Google Instant's Autocomplete Suggestions Work”, available at <http://searchengineland.com/how-google-instant-autocomplete-suggestions-work-62592>, Apr. 6, 2011, 12 pages.
Summerfield et al., “ASIC Implementation of the Lyon Cochlea Model”, Proceedings of the 1992 International Conference on Acoustics, Speech and Signal Processing, IEEE, vol. V, 1992, pp. 673-676.
T3 Magazine, “Creative MuVo TX 256MB”, available at <http://www.t3.co.uk/reviews/entertainment/mp3—player/creative—muvo—tx—256mb>, Aug. 17, 2004, 1 page.
Taos, “TAOS, Inc. Announces Industry's First Ambient Light Sensor to Convert Light Intensity to Digital Signals”, News Release, available at <http://www.taosinc.com/pressrelease—090902.htm>, Sep. 16, 2002, 3 pages.
Furnas, George W., “Generalized Fisheye Views”, CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, vol. 17, No. 4, Apr. 1986, pp. 16-23.
Tello, Ernest R., “Natural-Language Systems”, Mastering AI Tools and Techniques, Howard W. Sams & Company, 1988.
TG3 Electronics, Inc., “BL82 Series Backlit Keyboards”, available at <http://www.tg3electronics.com/products/backlitlbacklit.htm>, retrieved on Dec. 19, 2002, 2 pages.
The HP 150, “Hardware: Compact, Powerful, and Innovative”, vol. 8, No. 10, Oct. 1983, pp. 36-50.
Tidwell, Jenifer, “Animated Transition”, Designing Interfaces, Patterns for effective Interaction Design, Nov. 2005, First Edition, 4 pages.
Touch, Joseph, “Zoned Analog Personal Teleconferencing”, USC/Information Sciences Institute, 1993, pp. 1-19.
Toutanova et al., “Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network”, Computer Science Dept., Stanford University, Stanford CA 94305-9040, 2003, 8 pages.
Trigg et al., “Hypertext Habitats: Experiences of Writers in NoteCards”, Hypertext '87 Papers; Intelligent Systems Laboratory, Xerox Palo Alto Research Center, 1987, pp. 89-108.
Trowbridge, David, “Using Andrew for Development of Educational Applications”, Center for Design of Educational Computing, Carnegie-Mellon University (CMU-ITC-85-065), Jun. 2, 1985, pp. 1-6.
Tsao et al., “Matrix Quantizer Design for LPC Speech Using the Generalized Lloyd Algorithm”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Jun. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 237-245.
Turletti, Thierry, “The INRIA Videoconferencing System (IVS)”, Oct. 1994, pp. 1-7.
Uslan et al., “A Review of Henter-Joyce's MAGic for Windows NT”, Journal of Visual Impairment and Blindness, Dec. 1999, pp. 666-668.
Uslan et al., “A Review of Supernova Screen Magnification Program for Windows”, Journal of Visual Impairment & Blindness, Feb. 1999, pp. 108-110.
Uslan et al., “A Review of Two Screen Magnification Programs for Windows 95: Magnum 95 and LP-Windows”, Journal of Visual Impairment & Blindness, Sep.-Oct. 1997, pp. 9-13.
Veiga, Alex, “AT&T Wireless Launching Music Service”, available at <http://bizyahoo.com/ap/041005/at—t—mobile—music—5.html?printer=1>, Oct. 5, 2004, 2 pages.
Vogel et al., “Shift: A Technique for Operating Pen-Based Interfaces Using Touch”, CHI '07 Proceedings, Mobile Interaction Techniques I, Apr. 28—May 3, 2007, pp. 657-666.
Furnas, George W., “The Fisheye Calendar System”, Bellcore Technical Memorandum, Nov. 19, 1991.
Wadlow, M. G., “The Role of Human Interface Guidelines in the Design of Multimedia Applications”, Carnegie Mellon University (To be Published in Current Psychology: Research and Reviews, Summer 1990 (CMU-ITC-91-101), 1990, pp. 1-22.
Walker et al., “The LOCUS Distributed Operating System 1”, University of California Los Angeles, 1983, pp. 49-70.
Wang et al., “An Initial Study on Large Vocabulary Continuous Mandarin Speech Recognition with Limited Training Data Based on Sub-Syllabic Models”, International Computer Symposium, vol. 2, 1994, pp. 1140-1145.
Wang et al., “Tone Recognition of Continuous Mandarin Speech Based on Hidden Markov Model”, International Journal of Pattern Recognition and Artificial Intelligence, vol. 8, 1994, pp. 233-245.
Ware et al., “The DragMag Image Magnifier”, CHI '95 Mosaic of Creativity, May 7-11, 1995, pp. 407-408.
Ware et al., “The DragMag Image Magnifier Prototype I”, Apple Inc., Video Clip, Marlon, on a CD, Applicant is not Certain about the Date for the Video Clip., 1995.
Watabe et al., “Distributed Multiparty Desktop Conferencing System: MERMAID”, CSCW 90 Proceedings, Oct. 1990, pp. 27-38.
White, George M., “Speech Recognition, Neural Nets, and Brains”, Jan. 1992, pp. 1-48.
Gardner, Jr., P. C., “A System for the Automated Office Environment”, IBM Systems Journal, vol. 20, No. 3, 1981, pp. 321-345.
Garretson, R., “IBM Adds 'Drawing Assistant' Design Tool to Graphic Series”, PC Week, vol. 2, No. 32, Aug. 13, 1985, 1 page.
Gaver et al., “One Is Not Enough: Multiple Views in a Media Space”, INTERCHI, Apr. 24-29, 1993, pp. 335-341.
Gaver et al., “Realizing a Video Environment: EuroPARC's Rave System”, Rank Xerox Cambridge EuroPARC, 1992, pp. 27-35.
Giachin et al., “Word Juncture Modeling Using Inter-Word Context-Dependent Phone-Like Units”, Cselt Technical Reports, vol. 20, No. 1, Mar. 1992, pp. 43-47.
Wirelessinfo, “SMS/MMS Ease of Use (8.0)”, available at <http://www.wirelessinfo.com/content/palm-Treo-750-Cell-Phone-Review/Messaging.htm>, Mar. 2007, 3 pages.
Wong et al., “An 800 Bit/s Vector Quantization LPC Vocoder”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Oct. 1982), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 222-232.
Wong et al., “Very Low Data Rate Speech Compression with LPC Vector and Matrix Quantization”, (Proceedings of the IEEE Int'l Acoustics, Speech and Signal Processing Conference, Apr. 1983), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 233-236.
Wu et al., “Automatic Generation of Synthesis Units and Prosodic Information for Chinese Concatenative Synthesis”, Speech Communication, vol. 35, No. 3-4, Oct. 2001, pp. 219-237.
Gillespie, Kelly, “Adventures in Integration”, Data Based Advisor, vol. 9, No. 9, Sep. 1991, pp. 90-92.
Yang et al., “Auditory Representations of Acoustic Signals”, IEEE Transactions of Information Theory, vol. 38, No. 2, Mar. 1992, pp. 824-839.
Yang et al., “Hidden Markov Model for Mandarin Lexical Tone Recognition”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 36, No. 7, Jul. 1988, pp. 988-992.
Yiourgalis et al., “Text-to-Speech system for Greek”, ICASSP 91, vol. 1, May 14-17, 1991., pp. 525-528.
Gillespie, Kelly, “Internationalize Your Applications with Unicode”, Data Based Advisor, vol. 10, No. 10, Oct. 1992, pp. 136-137.
Zainab, “Google Input Tools Shows Onscreen Keyboard in Multiple Languages [Chrome]”, available at <http://www.addictivetips.com/internet-tips/google-input-tools-shows-multiple-language-onscreen-keyboards-chrome/>, Jan. 3, 2012, 3 pages.
Zelig, “A Review of the Palm Treo 750v”, available at <http://www.mtekk.com.au/Articles/tabid/54/articleType/ArticleView/articleld/769/A-Review-of-the-Palm-Treo-750v.aspx>, Feb. 5, 2007, 3 pages.
Zhang et al., “Research of Text Classification Model Based on Latent Semantic Analysis and Improved HS-SVM”, Intelligent Systems and Applications (ISA), 2010 2nd International Workshop, May 22-23, 2010, 5 pages.
Ziegler, K, “A Distributed Information System Study”, IBM Systems Journal, vol. 18, No. 3, 1979, pp. 374-401.
Zipnick et al., “U.S. Appl. No. 10/859,661, filed Jun. 2, 2004”.
Cisco Systems, Inc., “Cisco Unity Unified Messaging User Guide”, Release 4.0(5), Apr. 14, 2005, 152 pages.
Cisco Systems, Inc., “Installation Guide for Cisco Unity Unified Messaging with Microsoft Exchange 2003/2000 (With Failover Configured)”, Release 4.0(5), Apr. 14, 2005, 152 pages.
“Diagrammaker”, Action Software, 1989.
“Diagram-Master”, Ashton-Tate, 1989.
“Glossary of Adaptive Technologies: Word Prediction”, available at <http://www.utoronto.ca/atrc/reference/techwordpred.html>, retrieved on Dec. 6, 2005, 5 pages.
“iAP Sports Lingo 0x09 Protocol V1.00”, May 1, 2006, 17 pages.
“IEEE 1394 (Redirected from Firewire”, Wikipedia, The Free Encyclopedia, avialable at <http://www.wikipedia.org/wiki/Firewire>, retrieved on Jun. 8, 2003, 2 pages.
Extended European Search Report (includes European Search Report and European Search Opinion) received for European Patent Application No. 06256215.2, mailed on Feb. 20, 2007, 6 pages.
Extended European Search Report (includes Supplementary European Search Report and Search Opinion) received for European Patent Application No. 07863218.9, mailed on Dec. 9, 2010, 7 pages.
Extended European Search Report (includes European Search Report and European Search Opinion) received for European Patent Application No. 12186113.2, mailed on Apr. 28, 2014, 14 pages.
Extended European Search Report (includes European Search Report and European Search Opinion) received for European Patent Application No. 13155688.8, mailed on Aug. 22, 2013, 11 pages.
ABCOM Pty. Ltd. “12.1″ 925 Candela Mobile PC”, LCDHardware.com, available at <http://www.lcdhardware.com/panel/12—1—panel/default.asp.>, retrieved on Dec. 19, 2002, 2 pages.
ABF Software, “Lens-Magnifying Glass 1.5”, available at <http://download.com/3000-2437-10262078.html?tag=1st-0-1>, retrieved on Feb. 11, 2004, 1 page.
Abut et al., “Low-Rate Speech Encoding Using Vector Quantization and Subband Coding”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Apr. 1986), as reprinted in Vector Quantization IEEE Press, 1990, pp. 312-315.
Abut et al., “Vector Quantization Of Speech and Speech-Like Waveforms”, (IEEE Transactions on Acoustics, Speech, and Signal Processing, Jun. 1982), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 258-270.
Adium, “AboutAdium—Adium X—Trac”, available at <http://web.archive.org/web/20070819113247/http://trac.adiumx.com/wiki/AboutAdium>, retrieved on Nov. 25, 2011, 2 pages.
Ahlberg et al., “The Alphaslider: A Compact and Rapid Selector”, CHI '94 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 1994, pp. 365-371.
Ahlberg et al., “Visual Information Seeking: Tight Coupling of Dynamic Query Filters with Starfield Displays”, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 24-28, 1994, pp. 313-317.
Ahlstrom et al., “Overcoming Touchscreen User Fatigue by Workplace Design”, CHI '92 Posters and Short Talks of the 1992 SIGCHI Conference on Human Factors in Computing Systems, 1992, pp. 101-102.
Ahmed et al., “Intelligent Natural Language Query Processor”, Tencon '89, Fourth IEEE Region 10 International Conference, Nov. 22-24, 1989, pp. 47-49.
Ahuja et al., “A Comparison Of Application Sharing Mechanisms in Real-Time Desktop Conferencing Systems”, AT&T Bell Laboratories, 1990, pp. 238-248.
Aikawa, K. “Time-Warping Neural Network for Phoneme Recognition”, IEEE International Joint Conference on Neural Networks, vol. 3, Nov. 18-21, 1991, pp. 2122-2127.
Alleva et al., “Applying SPHINX-II to DARPA Wall Street Journal CSR Task”, Proceedings of Speech and Natural Language Workshop, Feb. 1992, pp. 393-398.
Amrel Corporation, “Rocky Matrix BackLit Keyboard”, available at <http://www.amrel.com/asi—matrixkeyboard. html>, retrieved on Dec. 19, 2002, 1 page.
Apple Computer, Inc., “Inside Macintosh”, vol. VI, 1985.
Apple Computer, Inc., “Apple—iPod—Technical Specifications, iPod 20GB and 60GB Mac + PC”, available at <http://www.apple.com/ipod/color/specs—html>, 2005, 3 pages.
Apple Computer, Inc., “Apple Announces iTunes 2”, Press Release, Oct. 23, 2001, 2 pages.
Apple Computer, Inc., “Apple Introduces iTunes—World's Best and Easiest to Use Jukebox Software”, Macworld Expo, Jan. 9, 2001, 2 pages.
Apple Computer, Inc., “Apple's iPod Available in Stores Tomorrow”, Press Release, Nov. 9, 2001, 1 page.
Cisco Systems, Inc., “Operations Manager Tutorial, Cisco's IPC Management Solution”, 2006, 256 pages.
Coleman, David W., “Meridian Mail Voice Mail System Integrates Voice Processing and Personal Computing”, Speech Technology, vol. 4, No. 2, Mar./Apr. 1988, pp. 84-87.
Compaq, “Personal Jukebox”, available at <http://research.compaq.com/SRC/pjb/>, 2001, 3 pages.
Compaq Inspiration Technology, “Personal Jukebox (PJB)—Systems Research Center and PAAD”, Oct. 13, 2000, 25 pages.
Conkie et al., “Preselection of Candidate Units in a Unit Selection-Based Text-to-Speech Synthesis System”, ISCA, 2000, 4 pages.
Conklin, Jeffrey, “A Survey of Hypertext”, MCC Software Technology Program, Dec. 1987, 40 pages.
Copperi et al., “CELP Coding for High Quality Speech at 8 kbits/s”, Proceedings of IEEE International Acoustics, Speech and Signal Processing Conference, Apr. 1986), as reprinted in Vector Quantization (IEEE Press), 1990, pp. 324-327.
Corr, Paul, “Macintosh Utilities for Special Needs Users”, available at <http://homepage.mac.com/corrp/macsupt/columns/specneeds.html>, Feb. 1994 (content updated Sep. 19, 1999), 4 pages.
Creative, “Creative NOMAD MuVo”, available at <http://web.archive.org/web/20041024075901/www.creative.com/products/product.asp?category=213&subcategory=216&product=4983>, retrieved on Jun. 7, 2006, 1 page.
Creative, “Creative NOMAD MuVo TX”, available at <http://web.archive.org/web/20041024175952/www.creative.com/products/pfriendly.asp?product=9672>, retrieved on Jun. 6, 2006, 1 page.
Creative, “Digital MP3 Player”, available at <http://web.archive.org/web/20041024074823/www.creative.com/products/product.asp?category=213&subcategory=216&product=4983, 2004, 1 page.
Creative Technology Ltd., “Creative NOMAD®: Digital Audio Player: User Guide (On-Line Version)”, available at <http://ec1.images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000010757.pdf>, Jun. 1999, 40 pages.
Creative Technology Ltd., “Creative NOMAD® II: Getting Started—User Guide (On Line Version)”, available at <http://ec1images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000026434.pdf>, Apr. 2000, 46 pages.
Creative Technology Ltd., “Nomad Jukebox”, User Guide, Version 1.0, Aug. 2000, 52 pages.
Croft et al., “Task Support in an Office System”, Proceedings of the Second ACM-SIGOA Conference on Office Information Systems, 1984, pp. 22-24.
Crowley et al., “MMConf: An Infrastructure for Building Shared Multimedia Applications”, CSCW 90 Proceedings, Oct. 1990, pp. 329-342.
Cuperman et al., “Vector Predictive Coding of Speech at 16 kbit s/s”, (IEEE Transactions on Communications, Jul. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 300-311.
De Herrera, Chris, “Microsoft ActiveSync 3.1”, Version 1.02, available at <http://www.cewindows.net/wce/activesync3.1.htm>, Oct. 13, 2000, 8 pages.
Degani et al., “'Soft' Controls for Hard Displays: Still a Challenge”, Proceedings of the 36th Annual Meeting of the Human Factors Society, 1992, pp. 52-56.
Del Strother, Jonathan, “Coverflow”, available at <http://www.steelskies.com/coverflow>, retrieved on Jun. 15, 2006, 14 pages.
Diamond Multimedia Systems, Inc., “Rio PMP300: User's Guide”, available at <http://ec1.images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000022854.pdf>, 1998, 28 pages.
Dickinson et al., “Palmtips: Tiny Containers for All Your Data”, PC Magazine, vol. 9, Mar. 1990, p. 218(3).
Digital Equipment Corporation, “OpenVMS RTL DECtalk (DTK$) Manual”, May 1993, 56 pages.
Gilloire et al., “Innovative Speech Processing for Mobile Terminals: An Annotated Bibliography”, Signal Processing, vol. 80, No. 7, Jul. 2000, pp. 1149-1166.
Glinert-Stevens, Susan, “Microsoft Publisher: Desktop Wizardry”, PC Sources, vol. 3, No. 2, Feb. 1992, 1 page.
Gmail, “About Group Chat”, available at <http://mail.google.com/support/bin/answer.py?answer=81090>, Nov. 26, 2007, 2 pages.
Goldberg, Cheryl, “IBM Drawing Assistant: Graphics for the EGA”, PC Magazine, vol. 4, No. 26, Dec. 24, 1985, 1 page.
Good et al., “Building a User-Derived Interface”, Communications of the ACM; (Oct. 1984) vol. 27, No. 10, Oct. 1984, pp. 1032-1043.
Gray et al., “Rate Distortion Speech Coding with a Minimum Discrimination Information Distortion Measure”, (IEEE Transactions on Information Theory, Nov. 1981), as reprinted in Vector Quantization (IEEE Press), 1990, pp. 208-221.
Greenberg, Saul, “A Fisheye Text Editor for Relaxed-WYSIWIS Groupware”, CHI '96 Companion, Vancouver, Canada, Apr. 13-18, 1996, 2 pages.
Griffin et al., “Signal Estimation From Modified Short-Time Fourier Transform”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. ASSP-32, No. 2, Apr. 1984, pp. 236-243.
Gruhn et al., “A Research Perspective on Computer-Assisted Office Work”, IBM Systems Journal, vol. 18, No. 3, 1979, pp. 432-456.
Halbert, D. C., “Programming by Example”, Dept. Electrical Engineering and Comp. Sciences, University of California, Berkley, Nov. 1984, pp. 1-76.
Hall, William S., “Adapt Your Program for Worldwide Use with Windows.TM. Internationalization Support”, Microsoft Systems Journal, vol. 6, No. 6, Nov./Dec. 1991, pp. 29-58.
Haoui et al., “Embedded Coding of Speech: A Vector Quantization Approach”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Mar. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 297-299.
Hartson et al., “Advances in Human-Computer Interaction”, Chapters 1, 5, and 6, vol. 3, 1992, 121 pages.
Heger et al., “Knowbot: An Adaptive Data Base Interface”, Nuclear Science and Engineering, V. 107, No. 2, Feb. 1991, pp. 142-157.
Hendrix et al., “The Intelligent Assistant: Technical Considerations Involved in Designing Q&A's Natural-Language Interface”, Byte Magazine, Issue 14, Dec. 1987, 1 page.
Hill, R. D., “Some Important Features and Issues in User Interface Management System”, Dynamic Graphics Project, University of Toronto, CSRI, vol. 21, No. 2, Apr. 1987, pp. 116-120.
Hinckley et al., “A Survey of Design Issues in Spatial Input”, UIST '94 Proceedings of the 7th Annual ACM Symposium on User Interface Software and Technology, 1994, pp. 213-222.
Hiroshi, “TeamWork Station: Towards a Seamless Shared Workspace”, NTT Human Interface Laboratories, CSCW 90 Proceedings, Oct. 1990, pp. 13-26.
Holmes, “Speech System and Research”, 1955, pp. 129-135, 152-153.
Hon et al., “Towards Large Vocabulary Mandarin Chinese Speech Recognition”, Conference on Acoustics, Speech, and Signal Processing, ICASSP-94, IEEE International, vol. 1, Apr. 1994, pp. 545-548.
Hopper, Andy, “Pandora—An Experimental System for Multimedia Applications”, Olivetti Research Laboratory, Apr. 1990, pp. 19-34.
Howard, John H., “(Abstract) An Overview of the Andrew File System”, Information Technology Center, Carnegie Mellon University; (CMU-ITC-88-062) To Appear in a future issue of the ACM Transactions on Computer Systems, 1988, pp. 1-6.
Pearl, Amy, “System Support for Integrated Desktop Video Conferencing”, Sunmicrosystems Laboratories, Dec. 1992, pp. 1-15.
Eslambolchilar et al., “Making Sense of Fisheye Views”, Second Dynamics and Interaction Workshop at University of Glasgow, Aug. 2005, 6 pages.
Phillipps, Ben, “Touchscreens are Changing the Face of Computers—Today's Users Have Five Types of Touchscreens to Choose from, Each with its Own Unique Characteristics”, Electronic Products, Nov. 1994, pp. 63-70.
Phillips, Dick, “The Multi-Media Workstation”, SIGGRAPH '89 Panel Proceedings, 1989, pp. 93-109.
Pickering, J. A., “Touch-Sensitive Screens: The Technologies and Their Application”, International Journal of Man-Machine Studies, vol. 25, No. 3, Sep. 1986, pp. 249-269.
Pingali et al., “Audio-Visual Tracking for Natural Interactivity”, ACM Multimedia, Oct. 1999, pp. 373-382.
Plaisant et al., “Touchscreen Interfaces for Alphanumeric Data Entry”, Proceedings of the Human Factors and Ergonomics Society 36th Annual Meeting, 1992, pp. 293-297.
Plaisant et al., “Touchscreen Toggle Design”, CHI'92, May 3-7, 1992, pp. 667-668.
Poly-Optical Products, Inc., “Poly-Optical Fiber Optic Membrane Switch Backlighting”, available at <http:// www.poly-optical.com/membrane—switches.html>, retrieved on Dec. 19, 2002, 3 pages.
Poor, Alfred, “Microsoft Publisher”, PC Magazine, vol. 10, No. 20, Nov. 26, 1991, 1 page.
Potter et al., “An Experimental Evaluation of Three Touch Screen Strategies within a Hypertext Database”, International Journal of Human-Computer Interaction, vol. 1, No. 1, 1989, p. 41-52.
Potter et al., “Improving the Accuracy of Touch Screens: An Experimental Evaluation of Three Strategies”, CHI '88 ACM, 1988, pp. 27-32.
Public Safety Technologies, “Tracer 2000 Computer”, available at <http://www.pst911.com/tracer.html>, retrieved on Dec. 19, 2002, 3 pages.
Eslambolchilar et al., “Multimodal Feedback for Tilt Controlled Speed Dependent Automatic Zooming”, UIST'04, Oct. 24-27, 2004, 2 pages.
Fanty et al., “A Comparison of DFT, PLP and Cochleagram for Alphabet Recognition”, IEEE, Nov. 1991.
Rampe et al., “SmartForm Designer and SmartForm Assistant”, News release, Claris Corp., Jan. 9, 1989, 1 page.
Rao et al., “Exploring Large Tables with the Table Lens”, Apple Inc., Video Clip, Xerox Corp., on a CD, 1994.
Rao et al., “Exploring Large Tables with the Table Lens”, CHI'95 Mosaic of Creativity, ACM, May 7-11, 1995, pp. 403-404.
Rao et al., “The Table Lens: Merging Graphical and Symbolic Representations in an Interactive Focus+Context Visualization for Tabular Information”, Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, Apr. 1994, pp. 1-7.
Raper, Larry K. ,“The C-MU PC Server Project”, (CMU-ITC-86-051), Dec. 1986, pp. 1-30.
Ratcliffe et al., “Intelligent Agents Take U.S. Bows”, MacWeek, vol. 6, No. 9, Mar. 2, 1992, 1 page.
Reddy, D. R., “Speech Recognition by Machine: A Review”, Proceedings of the IEEE, Apr. 1976, pp. 501-531.
Reininger et al., “Speech and Speaker Independent Codebook Design in VQ Coding Schemes”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Mar. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 271-273.
Ren et al., “Efficient Strategies for Selecting Small Targets on Pen-Based Systems: An Evaluation Experiment for Selection Strategies and Strategy Classifications”, Proceedings of the IFIP TC2/TC13 WG2.7/WG13.4 Seventh Working Conference on Engineering for Human-Computer Interaction, vol. 150, 1998, pp. 19-37.
Ren et al., “Improving Selection Performance on Pen-Based Systems: A Study of Pen-Based Interaction for Selection Tasks”, ACM Transactions on Computer-Human Interaction, vol. 7, No. 3, Sep. 2000, pp. 384-416.
Ren et al., “The Best among Six Strategies for Selecting a Minute Target and the Determination of the Minute Maximum Size of the Targets on a Pen-Based Computer”, Human-Computer Interaction Interact, 1997, pp. 85-92.
Findlater et al., “Beyond QWERTY: Augmenting Touch-Screen Keyboards with Multi-Touch Gestures for Non-Alphanumeric Input”, CHI '12, Austin, Texas, USA, May 5-10, 2012, 4 pages.
Riecken, R D., “Adaptive Direct Manipulation”, IEEE Xplore, 1991, pp. 1115-1120.
Rioport, “Rio 500: Getting Started Guide”, available at <http://ec1.images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000023453.pdf>, 1999, 2 pages.
Robbin et al., “MP3 Player and Encoder for Macintosh!”, SoundJam MP Plus, Version 2.0, 2000, 76 pages.
Robertson et al., “Information Visualization Using 3D Interactive Animation”, Communications of the ACM, vol. 36, No. 4, Apr. 1993, pp. 57-71.
Robertson et al., “The Document Lens”, UIST '93, Nov. 3-5, 1993, pp. 101-108.
Root, Robert, “Design of a Multi-Media Vehicle for Social Browsing”, Bell Communications Research, 1988, pp. 25-38.
Roseberry, Catherine, “How to Pair a Bluetooth Headset & Cell Phone”, available at <http://mobileoffice.about.com/od/usingyourphone/ht/blueheadset—p.htm>, retrieved on Apr. 29, 2006, 2 pages.
Rosenberg et al., “An Overview of the Andrew Message System”, Information Technology Center Carnegie-Mellon University, Jul. 1987, pp. 99-108.
Rosner et al., “In Touch: A Graphical User Interface Development Tool”, IEEE Colloquium on Software Tools for Interface Design, Nov. 8, 1990, pp. 1211-1217.
Rossfrank, “Konstenlose Sprachmitteilungins Festnetz”, XP002234425, Dec. 10, 2000, pp. 1-4.
Roucos et al., “A Segment Vocoder at 150 B/S”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Apr. 1983), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 246-249.
Roucos et al., “High Quality Time-Scale Modification for Speech”, Proceedings of the 1985 IEEE Conference on Acoustics, Speech and Signal Processing, 1985, pp. 493-496.
Sabin et al., “Product Code Vector Quantizers for Waveform and Voice Coding”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Jun. 1984), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 274-288.
Fisher et al., “Virtual Environment Display System”, Interactive 3D Graphics, Oct. 23-24, 1986, pp. 77-87.
Santen, Jan P., “Assignment of Segmental Duration in Text-to-Speech Synthesis”, Computer Speech and Language, vol. 8, No. 2, Apr. 1994, pp. 95-128.
Sarawagi, Sunita, “CRF Package p.”, available at <http://crf.sourceforge.net/>, retrieved on Apr. 6, 2011, 2 pages.
Sarkar et al., “Graphical Fisheye Views”, Communications of the ACM, vol. 37, No. 12, Dec. 1994, pp. 73-83.
Sarkar et al., “Graphical Fisheye Views of Graphs”, Systems Research Center, Digital Equipment Corporation, Mar. 17, 1992, 31 pages.
Sarkar et al., “Graphical Fisheye Views of Graphs”, CHI '92 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, May 3-7, 1992, pp. 83-91.
Sarkar et al., “Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens”, UIST'93, ACM, Nov. 3-5, 1993, pp. 81-91.
Sastry, Ravindra W., “A Need for Speed: A New Speedometer for Runners”, submitted to the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, 1999, pp. 1-42.
Schafer et al., “Digital Representations of Speech Signals”, Proceedings of the IEEE, vol. 63, No. 4, Apr. 1975, pp. 662-677.
Schaffer et al., “Navigating Hierarchically Clustered Networks through Fisheye and Full-Zoom Methods”, ACM Transactions on Computer-Human Interaction, vol. 3, No. 2, Jun. 1996, pp. 162-188.
Apple Computer, Inc., “iTunes 2: Specification Sheet”, 2001, 2 pages.
Apple Computer, Inc., “iTunes, Playlist Related Help Screens”, iTunes v1.0, 2000-2001, 8 pages.
Apple Computer, Inc., “QuickTime Movie Playback Programming Guide”, Aug. 11, 2005, pp. 1-58.
Apple Computer, Inc., “QuickTime Overview”, Aug. 11, 2005, pp. 1-34.
Apple Computer, Inc., “Welcome to Tiger”, available at <http://www.maths.dundee.ac.uk/software/Welcome—to—Mac—OS—X—v10.4—Tiger.pdf>, 2005, pp. 1-32.
Apple, “VoiceOver”, available at <http://www.apple.com/accessibility/voiceover/>, Feb. 2009, 5 pages.
Arango et al., “Touring Machine: A Software Platform for Distributed Multimedia Applications”, 1992 IFIP International Conference on Upper Layer Protocols, Architectures, and Applications, May 1992, pp. 1-11.
Arons, Barry M., “The Audio-Graphical Interface to a Personal Integrated Telecommunications System”, Thesis Submitted to the Department of Architecture at the Massachusetts Institute of Technology, Jun. 1984, 88 pages.
Apple Computer, Inc., “iTunes 2, Playlist Related Help Screens”, iTunes v2.0, 2000-2001, 8 pages.
Baechtle et al., “Adjustable Audio Indicator”, IBM Technical Disclosure Bulletin, Jul. 1, 1984, 2 pages.
Baeza-Yates, Ricardo, “Visualization of Large Answers in Text Databases”, AVI '96 Proceedings of the Workshop on Advanced Visual Interfaces, 1996, pp. 101-107.
Bahl et al., “Recognition of a Continuously Read Natural Corpus”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 3, Apr. 1978, pp. 422-424.
Bajarin, Tim, “With Low End Launched, Apple Turns to Portable Future”, PC Week, vol. 7, Oct. 1990, p. 153 (1).
Barthel, B., “Information Access for Visually Impaired Persons: Do We Still Keep a “Document” in “Documentation”?”, Professional Communication Conference, Sep. 1995, pp. 62-66.
Baudel et al., “2 Techniques for Improved HC Interaction: Toolglass & Magic Lenses: The See-Through Interface”, Apple Inc., Video Clip, CHI'94 Video Program on a CD, 1994.
Beck et al., “Integrating Natural Language, Query Processing, and Semantic Data Models”, COMCON Spring '90. IEEE Computer Society International Conference, 1990, Feb. 26-Mar. 2, 1990, pp. 538-543.
Bederson et al., “Pad++: A Zooming Graphical Interface for Exploring Alternate Interface Physics”, UIST' 94 Proceedings of the 7th Annual ACM symposium on User Interface Software and Technology, Nov. 1994, pp. 17-26.
Bederson et al., “The Craft of Information Visualization”, Elsevier Science, Inc., 2003, 435 pages.
Carpendale et al., “3-Dimensional Pliable Surfaces: For the Effective Presentation of Visual Information”, UIST '95 Proceedings of the 8th Annual ACM Symposium on User Interface and Software Technology, Nov. 14-17, 1995, pp. 217-226.
Carpendale et al., “Extending Distortion Viewing from 2D to 3D”, IEEE Computer Graphics and Applications, Jul./Aug. 1997, pp. 42-51.
Benel et al., “Optimal Size and Spacing of Touchscreen Input Areas”, Human-Computer Interaction—Interact, 1987, pp. 581-585.
Beringer et al., “Operator Behavioral Biases Using High-Resolution Touch Input Devices”, Proceedings of the Human Factors and Ergonomics Society 33rd Annual Meeting, 1989, 3 pages.
Beringer, Dennis B., “Target Size, Location, Sampling Point and Instruction Set: More Effects on Touch Panel Operation”, Proceedings of the Human Factors and Ergonomics Society 34th Annual Meeting, 1990, 5 pages.
Bernabei et al., “Graphical I/O Devices for Medical Users”, 14th Annual International Conference of the IEEE on Engineering in Medicine and Biology Society, vol. 3, 1992, pp. 834-836.
Bernstein, Macrophone, “Speech Corpus”, IEEE/ICASSP, Apr. 22, 1994, pp. 1-81 to 1-84.
Berry et al., “Symantec”, New version of MORE.TM, Apr. 10, 1990, 1 page.
Best Buy, “When it Comes to Selecting a Projection TV, Toshiba Makes Everything Perfectly Clear”, Previews of New Releases, available at <http://www.bestbuy.com/HomeAudioVideo/Specials/ToshibaTVFeatures.asp>, retrieved on Jan. 23, 2003, 5 pages.
Betts et al., “Goals and Objectives for User Interface Software”, Computer Graphics, vol. 21, No. 2, Apr. 1987, pp. 73-78.
Biemann, Chris, “Unsupervised Part-of-Speech Tagging Employing Efficient Graph Clustering”, Proceeding COLING ACL '06 Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop, 2006, pp. 7-12.
Bier et al., “Toolglass and Magic Lenses: The See-Through Interface”, Computer Graphics (SIGGRAPH '93 Proceedings), vol. 27, 1993, pp. 73-80.
Birrell, Andrew, “Personal Jukebox (PJB)”, available at <http://birrell.org/andrew/talks/pjb-overview.ppt>, Oct. 13, 2000, 6 pages.
Carpendale et al., “Making Distortions Comprehensible”, IEEE Proceedings of Symposium on Visual Languages, 1997, 10 pages.
Bleher et al., “A Graphic Interactive Application Monitor”, IBM Systems Journal, vol. 19, No. 3, Sep. 1980, pp. 382-402.
Bluetooth PC Headsets, “'Connecting' Your Bluetooth Headset with Your Computer”, Enjoy Wireless VoIP Conversations, available at <http://www.bluetoothpcheadsets.com/connect/htm>, retrieved on Apr. 29, 2006, 4 pages.
Bocchieri et al., “Use of Geographical Meta-Data in ASR Language and Acoustic Models”, IEEE International Conference on Acoustics Speech and Signal Processing, 2010, pp. 5118-5121.
Bociurkiw, Michael, “Product Guide: Vanessa Matz”, available at <http://www.forbes.com/asap/2000/1127/vmartz—print.html>, retrieved on Jan. 23, 2003, 2 pages.
Casner et al., “N-Way Conferencing with Packet Video”, The Third International Workshop on Packet Video, Mar. 22-23, 1990, pp. 1-6.
Borenstein, Nathaniel S., “Cooperative Work in the Andrew Message System”, Information Technology Center and Computer Science Department, Carnegie Mellon University; Thyberg, Chris A. Academic Computing, Carnegie Mellon University, 1988, pp. 306-323.
Boy, Guy A., “Intelligent Assistant Systems”, Harcourt Brace Jovanovicy, 1991, 1 page.
Chakarova et al., “Digital Still Cameras—Downloading Images to a Computer”, Multimedia Reporting and Convergence, available at <http://journalism.berkeley.edu/multimedia/tutorials/stillcams/downloading.html>, retrieved on May 9, 2005, 2 pages.
Brown et al., “Browing Graphs Using a Fisheye View”, Apple Inc., Video Clip, Systems Research Center, CHI '92 Continued Proceedings on a CD, 1992.
Brown et al., “Browsing Graphs Using a Fisheye View”, CHI '93 Proceedings of the Interact '93 and CHI '93 Conference on Human Factors in Computing Systems, 1993, p. 516.
Burger, D., “Improved Access to Computers for the Visually Handicapped: New Prospects and Principles”, IEEE Transactions on Rehabilitation Engineering, vol. 2, No. 3, Sep. 1994, pp. 111-118.
Chartier, David, “Using Multi-Network Meebo Chat Service on Your iPhone”, available at <http://www.tuaw.com/2007/07/04/using-multi-network-meebo-chat-service-on-your-iphone/>, Jul. 4, 2007, 5 pages.
Butler, Travis, “Archos Jukebox 6000 Challenges Nomad Jukebox”, available at <http://tidbits.com/article/6521>, Aug. 13, 2001, 5 pages.
Butler, Travis, “Portable MP3: The Nomad Jukebox”, available at <http://tidbits.com/article/6261>, Jan. 8, 2001, 4 pages.
Buxton et al., “EuroPARC's Integrated Interactive Intermedia Facility (IIIf): Early Experiences”, Proceedings of the IFIP WG 8.4 Conference on Multi-User Interfaces and Applications, 1990, pp. 11-34.
Call Centre, “Word Prediction”, The CALL Centre & Scottish Executive Education Dept., 1999, pp. 63-73.
Campbell et al., “An Expandable Error-Protected 4800 BPS CELP Coder (U.S. Federal Standard 4800 BPS Voice Coder)”, (Proceedings of IEEE Int'l Acoustics, Speech, and Signal Processing Conference, May 1983), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 328-330.
Card et al., “Readings in Information Visualization Using Vision to Think”, Interactive Technologies, 1999, 712 pages.
Scheifler, R. W., “The X Window System”, MIT Laboratory for Computer Science and Gettys, Jim Digital Equipment Corporation and MIT Project Athena; ACM Transactions on Graphics, vol. 5, No. 2, Apr. 1986, pp. 79-109.
Schluter et al., “Using Phase Spectrum Information for Improved Speech Recognition Performance”, IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001, pp. 133-136.
Schmandt et al., “A Conversational Telephone Messaging System”, IEEE Transactions on Consumer Electronics, vol. CE-30, Aug. 1984, pp. xxi-xxiv.
Schmandt et al., “Phone Slave: A Graphical Telecommunications Interface”, Society for Information Display, International Symposium Digest of Technical Papers, Jun. 1984, 4 pages.
Schmandt et al., “Phone Slave: A Graphical Telecommunications Interface”, Proceedings of the SID, vol. 26, No. 1, 1985, pp. 79-82.
Schmid, H., “Part-of-speech tagging with neural networks”, COLING '94 Proceedings of the 15th conference on Computational linguistics—vol. 1, 1994, pp. 172-176.
Schooler et al., “A Packet-switched Multimedia Conferencing System”, by Eve Schooler, et al; ACM SIGOIS Bulletin, vol. I, No. 1, Jan. 1989, pp. 12-22.
Schooler et al., “An Architecture for Multimedia Connection Management”, Proceedings IEEE 4th Comsoc International Workshop on Multimedia Communications, Apr. 1992, pp. 271-274.
Schooler et al., “Multimedia Conferencing: Has it Come of Age?”, Proceedings 24th Hawaii International Conference on System Sciences, vol. 3, Jan. 1991, pp. 707-716.
Schooler et al., “The Connection Control Protocol: Architecture Overview”, USC/Information Sciences Institute, Jan. 28, 1992, pp. 1-6.
Schooler, Eve, “A Distributed Architecture for Multimedia Conference Control”, ISI Research Report, Nov. 1991, pp. 1-18.
Schooler, Eve M., “Case Study: Multimedia Conference Control in a Packet-Switched Teleconferencing System”, Journal of Internetworking: Research and Experience, vol. 4, No. 2, Jun. 1993, pp. 99-120.
Schooler, Eve M., “The Impact of Scaling on a Multimedia Connection Architecture”, Multimedia Systems, vol. 1, No. 1, 1993, pp. 2-9.
Schütze, H., “Distributional part-of-speech tagging”, EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics, 1995, pp. 141-148.
Schütze, Hinrich, “Part-of-speech induction from scratch”, ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics, 1993, pp. 251-258.
Schwartz et al., “Context-Dependent Modeling for Acoustic-Phonetic Recognition of Continuous Speech”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 10, Apr. 1985, pp. 1205-1208.
Schwartz et al., “Improved Hidden Markov Modeling of Phonemes for Continuous Speech Recognition”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 9, 1984, pp. 21-24.
Schwartz et al., “The N-Best Algorithm: An Efficient And Exact Procedure For Finding The N Most Likely Sentence Hypotheses”, IEEE, 1990, pp. 81-84.
Scott et al., “Designing Touch Screen Numeric Keypads: Effects of Finger Size, Key Size, and Key Spacing”, Proceedings of the Human Factors and Ergonomics Society 41st Annual Meeting, Oct. 1997, pp. 360-364.
Seagrave, Jim, “A Faster Way to Search Text”, EXE, vol. 5, No. 3, Aug. 1990, pp. 50-52.
Sears et al., “High Precision Touchscreens: Design Strategies and Comparisons with a Mouse”, International Journal of Man-Machine Studies, vol. 34, No. 4, Apr. 1991, pp. 593-613.
Sears et al., “Investigating Touchscreen Typing: The Effect of Keyboard Size on Typing Speed”, Behavior & Information Technology, vol. 12, No. 1, 1993, pp. 17-22.
Sears et al., “Touchscreen Keyboards”, Apple Inc., Video Clip, Human-Computer Interaction Laboratory, on a CD, Apr. 1991.
Seide et al., “Improving Speech Understanding by Incorporating Database Constraints and Dialogue History”, Proceedings of Fourth International Conference on Philadelphia, 1996, pp. 1017-1020.
Shiraki et al., “LPC Speech Coding Based on Variable-Length Segment Quantization”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Sep. 1988), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 250-257.
Shneiderman, Ben, “Designing the User Interface: Strategies for Effective Human-Computer Interaction”, Second Edition, 1992, 599 pages.
Shneiderman, Ben, “Designing the User Interface: Strategies for Effective Human-Computer Interaction”, Third Edition, 1998, 669 pages.
Shneiderman, Ben, “Direct Manipulation for Comprehensible, Predictable and Controllable User Interfaces”, Proceedings of the 2nd International Conference on Intelligent User Interfaces, 1997, pp. 33-39.
Shneiderman, Ben, “Sparks of Innovation in Human-Computer Interaction”, 1993, (Table of Contents, Title Page, Ch. 4, Ch. 6 and List of References).
Shneiderman, Ben, “The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations”, IEEE Proceedings of Symposium on Visual Languages, 1996, pp. 336-343.
Shneiderman, Ben, “Touch Screens Now Offer Compelling Uses”, IEEE Software, Mar. 1991, pp. 93-94.
Shoham et al., “Efficient Bit and Allocation for an Arbitrary Set of Quantizers”, (IEEE Transactions on Acoustics, Speech, and Signal Processing, Sep. 1988) as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 289-296.
Simkovitz, Daniel, “LP-DOS Magnifies the PC Screen”, IEEE, 1992, pp. 203-204.
Forsdick, Harry, “Explorations into Real-Time Multimedia Conferencing”, Proceedings of the Ifip Tc 6 International Symposium on Computer Message Systems, 1986, 331 pages.
Sinitsyn, Alexander, “A Synchronization Framework for Personal Mobile Servers”, Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops, Piscataway, 2004, pp. 1, 3 and 5.
Furnas et al., “Space-Scale Diagrams: Understanding Multiscale Interfaces”, CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 1995, pp. 234-241.
Smeaton, Alan F., “Natural Language Processing and Information Retrieval”, Information Processing and Management, vol. 26, No. 1, 1990, pp. 19-20.
Smith et al., “Guidelines for Designing User Interface Software”, User Lab, Inc., Aug. 1986, pp. 1-384.
Smith et al., “Relating Distortion to Performance in Distortion Oriented Displays”, Proceedings of Sixth Australian Conference on Computer-Human Interaction, Nov. 1996, pp. 6-11.
Sony Eiicsson Corporate, “Sony Ericsson to introduce Auto pairing.TM. to Improve Bluetooth.TM. Connectivity Between Headsets and Phones”, Press Release, available at <http://www.sonyericsson.com/spg.jsp? cc=global&lc=en&ver=4001&template=pc3—1—1&z . . .>, Sep. 28, 2005, 2 pages.
Soong et al., “A High Quality Subband Speech Coder with Backward Adaptive Predictor and Optimal Time-Frequency Bit Assignment”, (Proceedings of the IEEE International Acoustics, Speech, and Signal Processing Conference, Apr. 1986), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 316-319.
Spiller, Karen, “Low-Decibel Earbuds Keep Noise at a Reasonable Level”, available at <http://www.nashuatelegraph.com/apps/pbcs.dll/article?Date=20060813&Cate . . .>, Aug. 13, 2006, 3 pages.
Furnas, George W., “Effective View Navigation”, Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, Mar. 1997, pp. 367-374.
Srinivas et al., “Monet: A Multi-Media System for Conferencing and Application Sharing in Distributed Systems”, CERC Technical Report Series Research Note, Feb. 1992.
Stealth Computer Corporation, “Peripherals for Industrial Keyboards & Pointing Devices”, available at <http://www.stealthcomputercom/peripherals—oem.htm>, retrieved on Dec. 19, 2002, 6 pages.
Steinberg, Gene, “Sonicblue Rio Car (10 GB, Reviewed: 6 GB)”, available at <http://electronics.cnet.com/electronics/0-6342420-1304-4098389.html>, Dec. 12, 2000, 2 pages.
Stent et al., “Geo-Centric Language Models for Local Business Voice Search”, AT&T Labs—Research, 2009, pp. 389-396.
Stone et al., “The Movable Filter as a User Interface Tool”, CHI '94 Human Factors in Computing Systems, 1994, pp. 306-312.
Su et al., “A Review of ZoomText Xtra Screen Magnification Program for Windows 95”, Journal of Visual Impairment & Blindness, Feb. 1998, pp. 116-119.
Su, Joseph C., “A Review of Telesensory's Vista PCI Screen Magnification System”, Journal of Visual Impairment & Blindness, Oct. 1998, pp. 705, 707-710.
Omologo et al., “Microphone Array Based Speech Recognition with Different Talker-Array Positions”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 1, Apr. 21-24, 1997, pp. 227-230.
Oregon Scientific, “512MB Waterproof MP3 Player with FM Radio & Built-in Pedometer”, available at <http://www2.oregonscientific.com/shop/product.asp?cid=4&scid=11&pid=581>, retrieved on Jul. 31, 2006, 2 pages.
Oregon Scientific, “Waterproof Music Player with FM Radio and Pedometer (MP121)—User Manual”, 2005, 24 pages.
Padilla, Alfredo, “Palm Treo 750 Cell Phone Review—Messaging”, available at <http://www.wirelessinfo.com/content/palm-Treo-750-Cell-Phone-Review/Messaging.htm>, Mar. 17, 2007, 6 pages.
Palay et al., “The Andrew Toolkit: An Overview”, Information Technology Center, Carnegie-Mellon University, 1988, pp. 1-15.
Palm, Inc., “User Guide: Your Palm® Treo.TM. 755p Smartphone”, 2005-2007, 304 pages.
Panasonic, “Toughbook 28: Powerful, Rugged and Wireless”, Panasonic: Toughbook Models, available at <http://www.panasonic.com/computer/notebook/htm1/01a—s8.htm>, retrieved on Dec. 19, 2002, 3 pages.
Parks et al., “Classification of Whale and Ice Sounds with a cochlear Model”, IEEE, Mar. 1992.
Patterson et al., “Rendezvous: An Architecture for Synchronous Multi-User Applications”, CSCW '90 Proceedings, 1990, pp. 317-328.
International Search Report received for PCT Patent Application No. PCT/US2002/033330, mailed on Feb. 4, 2003, 6 pages.
Edwards, John R., “Q&A: Integrated Software with Macros and an Intelligent Assistant”, Byte Magazine, vol. 11, No. 1, Jan. 1986, pp. 120-122.
Egido, Carmen, “Video Conferencing as a Technology to Support Group Work: A Review of its Failures”, Bell Communications Research, 1988, pp. 13-24.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2005/038819, mailed on Apr. 5, 2006, 12 pages.
International Search Report received for PCT Patent Application No. PCT/US2005/046797, mailed on Nov. 24, 2006, 6 pages.
Invitation to Pay Additional Fees and Partial Search Report received for PCT Application No. PCT/US2005/046797, mailed on Jul. 3, 2006, 6 pages.
Written Opinion received for PCT Patent Application No. PCT/US2005/046797, mailed on Nov. 24, 2006, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2006/048669, mailed on Jul. 2, 2007, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2006/048670, mailed on May 21, 2007, 11 pages.
Invitation to Pay Addition Fees and Partial International Search Report received for PCT Patent Application No. PCT/US2006/048738, mailed on Jul. 10, 2007, 4 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2006/048753, mailed on Jun. 19, 2007, 15 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/026243, mailed on Mar. 31, 2008, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/077424, mailed on Jun. 19, 2008, 13 pages.
Invitation to Pay Additional Fees received for PCT Application No. PCT/US2007/077424, mailed on Apr. 29, 2008, 6 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/077443, mailed on Feb. 21, 2008, 8 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/088872, mailed on May 8, 2008, 8 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/088873, mailed on May 8, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000032, mailed on Jun. 12, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000042, mailed on May 21, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000043, mailed on Oct. 10, 2008, 12 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2008/000043, mailed on Jun. 27, 2008, 4 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000045, mailed on Jun. 12, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000047, mailed on Sep. 11, 2008, 12 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2008/000047, mailed on Jul. 4, 2008, 4 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US20081/000059, mailed on Sep. 19, 2008, 18 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000061, mailed on Jul. 1, 2008, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/050083, mailed on Jul. 4, 2008, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2011/020350, mailed on Jun. 30, 2011, 17 pages.
Invitation to Pay Additional Fees and Partial International Search Report received for PCT Patent Application No. PCT/US2011/020350, mailed on Apr. 14, 2011, 5 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2011/020861, mailed on Aug. 2, 2012, 11 pages.
Elliot, Chip, “High-Quality Multimedia Conferencing Through a Long-Haul Packet Network”, BBN Systems and Technologies, 1993, pp. 91-98.
Elliott et al., “Annotation Suggestion and Search for Personal Multimedia Objects on the Web”, CIVR, Jul. 7-9, 2008, pp. 75-84.
Elofson et al., “Delegation Technologies: Environmental Scanning with Intelligent Agents”, Jour. of Management Info. Systems, Summer 1991, vol. 8, No. 1, 1991, pp. 37-62.
Eluminx, “Illuminated Keyboard”, available at <http://www.elumix.com/>, retrieved on Dec. 19, 2002, 1 page.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/034028, mailed on Jun. 11, 2012, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/040931, mailed on Feb. 1, 2013, 4 pages. (International Search Report only).
Engst, Adam C., “SoundJam Keeps on Jammin”', available at <http://db.tidbits.com/getbits.acgi?tbart=05988>, Jun. 19, 2000, 3 pages.
Ericsson Inc., “Cellular Phone with Integrated MP3 Player”, Research Disclosure Journal No. 41815, Feb. 1999, 2 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/041225, mailed on Aug. 23, 2013, 3 pages. (International Search Report only).
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2013/047659, mailed on Feb. 27, 2014, 7 pages.
Invitation to Pay Additional Fees received for PCT Application No. PCT/US2013/052558, mailed on Nov. 7, 2013, 6 pages.
Jabra, “Bluetooth Introduction”, 2004, 15 pages.
Jabra Corporation, “FreeSpeak: BT200 User Manual”, 2002, 42 pages.
Jaybird, “Everything Wrong with AIM: Because We've All Thought About It”, available at <http://www.psychonoble.com/archives/articles/82.html>, May 24, 2006, 3 pages.
Jeffay et al., “Kernel Support for Live Digital Audio and Video”, In Proc. of the Second Intl. Workshop on Network and Operating System Support for Digital Audio and Video, vol. 614, Nov. 1991, pp. 10-21.
Jelinek et al., “Interpolated Estimation of Markov Source Parameters from Sparse Data”, In Proceedings of the Workshop on Pattern Recognition in Practice May 1980, pp. 381-397.
Johnson, Jeff A., “A Comparison of User Interfaces for Panning on a Touch-Controlled Display”, CHI '95 Proceedings, 1995, 8 pages.
Kaeppner et al., “Architecture of HeiPhone: A Testbed for AudioNideo Teleconferencing”, IBM European Networking Center, 1993.
Kamba et al., “Using Small Screen Space More Efficiently”, CHI '96 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 13-18, 1996, pp. 383-390.
Kang et al., “Quality Improvement of LPC-Processed Noisy Speech by Using Spectral Subtraction”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 37, No. 6, Jun. 1989, pp. 939-942.
Keahey et al., “Non-Linear Image Magnification”, Apr. 24, 1996, 11 pages.
Keahey et al., “Nonlinear Magnification Fields”, Proceedings of the 1997 IEEE Symposium on Information Visualization, 1997, 12 pages.
Keahey et al., “Techniques for Non-Linear Magnification Transformations”, IEEE Proceedings of Symposium on Information Visualization, Oct. 1996, pp. 38-45.
Keahey et al., “Viewing Text With Non-Linear Magnification: An Experimental Study”, Department of Computer Science, Indiana University, Apr. 24, 1996, pp. 1-9.
Kennedy, P J., “Digital Data Storage Using Video Disc”, IBM Technical Disclosure Bulletin, vol. 24, No. 2, Jul. 1981, p. 1171.
Kerr, “An Incremental String Search in C: This Data Matching Algorithm Narrows the Search Space with each Keystroke”, Computer Language, vol. 6, No. 12, Dec. 1989, pp. 35-39.
Kirstein et al., “Piloting of Multimedia Integrated Communications for European Researchers”, Proc. INET '93, 1993, pp. 1-12.
Kjelldahl et al., “Multimedia—Principles, Systems, and Applications”, Proceedings of the 1991 Eurographics Workshop on Multimedia Systems, Applications, and Interaction, Apr. 1991.
Kline et al., “Improving GUI Accessibility for People with Low Vision”, CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, May 7-11, 1995, pp. 114-121.
Kline et al., “UnWindows 1.0: X Windows Tools for Low Vision Users”, ACM SIGCAPH Computers and the Physically Handicapped, No. 49, Mar. 1994, pp. 1-5.
Knight et al., “Heuristic Search”, Production Systems, Artificial Intelligence, 2nd ed., McGraw-Hill, Inc., 1983-1991.
Kroon et al., “Quantization Procedures for the Excitation in CELP Coders”, (Proceedings of IEEE International Acoustics, Speech, and Signal Processing Conference, Apr. 1987), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 320-323.
Kuo et al., “A Radical-Partitioned coded Block Adaptive Neural Network Structure for Large-Volume Chinese Characters Recognition”, International Joint COnference on Neural Networks, vol. 3, Jun. 1992, pp. 597-601.
Kuo et al., “A Radical-Partitioned Neural Network System Using a Modified Sigmoid Function and a Weight-Dotted Radical Selector for Large-Volume Chinese Character Recognition VLSI”, IEEE Int. Symp. Circuits and Systems, Jun. 1994, pp. 3862-3865.
Kurlander et al., “Comic Chat”, [Online], 1996 [Retrieved on: Feb 4th 2013], SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, [Retrieved from: http://delivery.acm.org/10.1145/240000/237260/p225-kurlander.pdf], 1996, pp. 225-236.
Laface et al., “A Fast Segmental Viterbi Algorithm for Large Vocabulary Recognition”, International Conference on Acoustics, Speech, and Signal Processing, vol. 1, May 1995, pp. 560-563.
Lamping et al., “Laying Out and Visualizing Large Trees Using a Hyperbolic Space”, Proceedings of the ACM Symposium on User Interface Software and Technology, Nov. 1994, pp. 13-14.
Lamping et al., “Visualizing Large Trees Using the Hyperbolic Browser”, Apple Inc., Video Clip, Mit Media Library, on a CD, 1995.
Lantz et al., “Towards a Universal Directory Service”, Departments of Computer Science and Electrical Engineering, Stanford University, 1985, pp. 250-260.
Lantz, Keith, “An Experiment in Integrated Multimedia Conferencing”, 1986, pp. 267-275.
Lauwers et al., “Collaboration Awareness in Support of Collaboration Transparency: Requirements for the Next Generation of Shared Window Systems”, CHI'90 Proceedings, 1990, pp. 303-311.
Lauwers et al., “Replicated Architectures for Shared Window Systems: A Critique”, COCS '90 Proceedings of the ACM SIGOIS and IEEE CS TC-OA conference on Office information systems, ACM SIGOIS Bulletin, 1990, pp. 249-260.
Lazzaro, Joseph J., “Adapting Desktop Computers to Meet the Needs of Disabled Workers is Easier Than You Might Think”, Computers for the Disabled, BYTE Magazine, Jun. 1993, 4 pages.
Leahy et al., “Effect of Touch Screen Target Location on User Accuracy”, Proceedings of the Human Factors Society 34th Annual Meeting, 1990, 5 pages.
Lee, Kai-Fu, “Automatic Speech Recognition”, 1989, 14 pages. (Table of Contents).
Leung et al., “A Review and Taxonomy of Distortion-Oriented Presentation Techniques”, ACM Transactions on Computer-Human Interaction (ToCHI), vol. 1, No. 2, Jun. 1994, pp. 126-160.
Levinson et al., “Speech synthesis in telecommunications”, IEEE Communications Magazine, vol. 31, No. 11, Nov. 1993, pp. 46-53.
Lewis, “Speech synthesis in a computer aided learning environment”, UK IT, Mar. 19-22, 1990, pp. 294-298.
Lewis, Peter, “Two New Ways to Buy Your Bits”, CNN Money, available at <http://money.cnn.com/2003/12/30/commentary/ontechnology/download/>Dec. 31, 2003, 4 pages.
Lieberman, Henry, “Powers of Ten Thousand: Navigating in Large Information Spaces”, Proceedings of the ACM Symposium on User Interface Software and Technology, Nov. 1994, pp. 1-2.
Lyon, R., “A Computational Model of Binaural Localization and Separation”, Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, Apr. 1983, pp. 1148-1151.
Mackenzie et al., “Alphanumeric Entry on Pen-Based Computers”, International Journal of Human-Computer Studies, vol. 41, 1994, pp. 775-792.
MacKinlay et al., “The Perspective Wall: Detail and Context Smoothly Integrated”, ACM, 1991, pp. 173-179.
Hunt, “Unit Selection In A Concatenative Speech Synthesis System Using A Large Speech Database”, Copyright 1996 IEEE. “To appear in Proc. ICASSP-96, May 7-10, Atlanta, GA” ATR Interpreting Telecommunications Research Labs, Kyoto Japan, 1996, pp. 373-376.
IBM, “Why Buy: ThinkPad”, available at <http://www.pc.ibm.com/us/thinkpad/easeofuse.html>, retrieved on Dec. 19, 2002, 2 pages.
IBM Corporation, “Simon Says 'Here's How”, Users Manual, 1994, 3 pages.
IChat AV, “Video Conferencing for the Rest of Us”, Apple—Mac OS X—iChat AV, available at <http://www.apple.com/macosx/features/ichat/>, retrieved on Apr. 13, 2006, 3 pages.
!Phone Hacks, “Native iPhone MMS Application Released”, available at <http://www.iphonehacks.com/2007/12/iphone-mms-app.html>, retrieved on Dec. 25, 2007, 5 pages.
Iphonechat, “iChat for iPhone in JavaScript”, available at <http://www.publictivity.com/iPhoneChat/>, retrieved on Dec. 25, 2007, 2 pages.
Jabra, “Bluetooth Headset: User Manual”, 2005, 17 pages.
Hukin, R. W., “Testing an Auditory Model by Resynthesis”, European Conference on Speech Communication and Technology, Sep. 26-29, 1989, pp. 243-246.
Mactech, “KeyStrokes 3.5 for Mac OS X Boosts Word Prediction”, available at <http://www.mactech.com/news/?p=1007129>, retrieved on Jan. 7, 2008, 3 pages.
Lieberman, Henry, “A Multi-Scale, Multi-Layer, Translucent Virtual Space”, Proceedings of IEEE Conference on Information Visualization, Aug. 1997, pp. 124-131.
Huang et al., “Real-Time Software-Based Video Coder for Multimedia Communication Systems”, Department of Computer Science and Information Engineering, 1993, 10 pages.
Markel et al., “Linear Production of Speech”, Reviews, 1976, pp. xii, 288.
Masui, Toshiyuki, “POBox: An Efficient Text Input Method for Handheld and Ubiquitous Computers”, Proceedings of the 1st International Symposium on Handheld and Ubiquitous Computing, 1999, 12 pages.
Matsui et al., “Speaker Adaptation of Tied-Mixture-Based Phoneme Models for Text-Prompted Speaker Recognition”, 1994 IEEE International Conference on Acoustics, Speech and Signal Processing, Apr. 19-22, 1994, 1-125-1-128.
Matsuzawa, A, “Low-Voltage and Low-Power Circuit Design for Mixed Analog/Digital Systems in Portable Equipment”, IEEE Journal of Solid-State Circuits, vol. 29, No. 4, 1994, pp. 470-480.
Mellinger, David K., “Feature-Map Methods for Extracting Sound Frequency Modulation”, IEEE Computer Society Press, 1991, pp. 795-799.
Menico, Costas, “Faster String Searches”, Dr. Dobb's Journal, vol. 14, No. 7, Jul. 1989, pp. 74-77.
Menta, Richard, “1200 Song MP3 Portable is a Milestone Player”, available at <http://www.mp3newswire.net/stories/personaljuke.html>, Jan. 11, 2000, 4 pages.
Meyer, Mike, “A Shell for Modern Personal Computers”, University of California, Aug. 1987, pp. 13-19.
Meyrowitz et al., “Bruwin: An Adaptable Design Strategy for Window ManagerNirtual Terminal Systems”, Department of Computer Science, Brown University, 1981, pp. 180-189.
Miastkowski, Stan, “paperWorks Makes Paper Intelligent”, Byte Magazine, Jun. 1992.
Microsoft, “Turn On and Use Magnifier”, available at <http://www.microsoft.com/windowsxp/using/accessibility/magnifierturnon.mspx>, retrieved on Jun. 6, 2009.
Microsoft Corporation, Microsoft Office Word 2003 (SP2), Microsoft Corporation, SP3 as of 2005, pp. MSWord 2003 Figures 1-5, 1983-2003.
Microsoft Corporation, “Microsoft MS-DOS Operating System User's Guide”, Microsoft Corporation, 1982, pp. 4-1 to 4-16, 5-1 to 5-19.
Microsoft Press, “Microsoft Windows User's Guide for the Windows Graphical Environment”, version 3.0, 1985-1990, pp. 33-41 & 70-74.
Microsoft Windows XP, “Magnifier Utility”, Oct. 25, 2001, 2 pages.
Microsoft Word 2000 Microsoft Corporation, pp. MSWord Figures 1-5, 1999.
Microsoft/Ford, “Basic Sync Commands”, www.SyncMyRide.com, Sep. 14, 2007, 1 page.
Milner, N. P., “A Review of Human Performance and Preferences with Different Input Devices to Computer Systems”, Proceedings of the Fourth Conference of the British Computer Society on People and Computers, Sep. 5-9, 1988, pp. 341-352.
Miniman, Jared, “Applian Software's Replay Radio and Player v1.02”, pocketnow.com—Review, available at <http://www.pocketnow.com/reviews/replay/replay.htm>, Jul. 31, 2001, 16 pages.
Moberg et al., “Cross-Lingual Phoneme Mapping for Multilingual Synthesis Systems”, Proceedings of the 8th International Conference on Spoken Language Processing, Jeju Island, Korea, Interspeech 2004, Oct. 4-8, 2004, 4 pages.
Donahue et al., “Whiteboards: A Graphical Database Tool”, ACM Transactions on Office Information Systems, vol. 4, No. 1, Jan. 1986, pp. 24-41.
Mobile Tech News, “T9 Text Input Software Updated”, available at <http://www.mobiletechnews.com/info/2004/11/23/122155.html>, Nov. 23, 2004, 4 pages.
Mok et al., “Media Searching on Mobile Devices”, IEEE EIT 2007 Proceedings, 2007, pp. 126-129.
Morland, D. V., “Human Factors Guidelines for Terminal Interface Design”, Communications ofthe ACM vol. 26, No. 7, Jul. 1983, pp. 484-494.
Morris et al., “Andrew: A Distributed Personal Computing Environment”, Communications of the ACM, (Mar. 1986); vol. 29 No. 3 Mar. 1986, pp. 184-201.
Muller et al., “CSCW'92 Demonstrations”, 1992, pp. 11-14.
Musicmatch, “Musicmatch and Xing Technology Introduce Musicmatch Jukebox”, Press Releases, available at <http://www.musicmatch.com/info/company/press/releases/?year= 1998&release=2>, May 18, 1998, 2 pages.
Muthesamy et al., “Speaker-Independent Vowel Recognition: Spectograms versus Cochleagrams”, IEEE, Apr. 1990.
My Cool Aids, “What's New”, available at <http://www.mycoolaids.com/>, 2012, 1 page.
Myers, Brad A., “Shortcutter for Palm”, available at <http://www.cs.cmu.eduhpebbles/v5/shortcutter/palm/index.html>, retrieved on Jun. 18, 2014, 10 pages.
Nadoli et al., “Intelligent Agents in the Simulation of Manufacturing Systems”, Proceedings of the SCS Multiconference on AI and Simulation, 1989, 1 page.
Nakagawa et al., “Unknown Word Guessing and Part-of-Speech Tagging Using Support Vector Machines”, Proceedings of the 6th NLPRS, 2001, pp. 325-331.
Dourish et al., “Portholes: Supporting Awareness in a Distributed Work Group”, CHI 1992; May 1992, pp. 541-547.
NCIP, “NCIP Library: Word Prediction Collection”, available at <http://www2.edc.org/ncip/library/wp/toc.htm>, 1998, 4 pages.
NCIP, “What is Word Prediction?”, available at <http://www2.edc.org/Ncip/library/wp/what—is.htm>, 1998, 2 pages.
NCIP Staff, “Magnification Technology”, available at <http://www2.edc.org/ncip/library/vi/magnifi.htm>, 1994, 6 pages.
Newton, Harry, “Newton's Telecom Dictionary”, Mar. 1998, pp. 62, 155, 610-611, 771.
Nguyen et al., “Generic Manager for Spoken Dialogue Systems”, In DiaBruck: 7th Workshop on the Semantics and Pragmatics of Dialogue, Proceedings, 2003, 2 pages.
Dyslexic.Com, “AlphaSmart 3000 with CoWriter SmartApplet: Don Johnston Special Needs”, available at <http://www.dyslexic.com/procuts.php?catid-2&pid=465&PHPSESSID=2511b800000f7da>, retrieved on Dec. 6, 2005, 13 pages.
Noik, Emanuel G., “Layout-Independent Fisheye Views of Nested Graphs”, IEEE Proceedings of Symposium on Visual Languages, 1993, 6 pages.
Nonhoff-Arps et al., “StraBenmusik: Portable MP3-Spieler mit USB Anschluss”, CT Magazin Fuer Computer Technik, Verlag Heinz Heise GMBH, Hannover DE, No. 25, 2000, pp. 166-175.
Northern Telecom, “Meridian Mail PC User Guide”, 1988, 17 pages.
Notenboom, Leo A., “Can I Retrieve Old MSN Messenger Conversations?”, available at <http://ask-leo.com/can—i—retrieve—old—msn—messenger—conversations.html>, Mar. 11, 2004, 23 pages.
O'Connor, Rory J., “Apple Banking on Newton's Brain”, San Jose Mercury News, Apr. 22, 1991.
Ohsawa et al., “A computational Model of an Intelligent Agent Who Talks with a Person”, Research Reports on Information Sciences, Series C, No. 92, Apr. 1989, pp. 1-18.
Ohtomo et al., “Two-Stage Recognition Method of Hand-Written Chinese Characters Using an Integrated Neural Network Model”, Denshi Joohoo Tsuushin Gakkai Ronbunshi, D-II, vol. J74, Feb. 1991, pp. 158-165.
Okazaki et al., “Multi-Fisheye Transformation Method for Large-Scale Network Maps”, IEEE Japan, vol. 44, No. 6, 1995, pp. 495-500.
Related Publications (1)
Number Date Country
20130185074 A1 Jul 2013 US
Provisional Applications (1)
Number Date Country
61295774 Jan 2010 US
Continuations (1)
Number Date Country
Parent 12987982 Jan 2011 US
Child 13784694 US