Jeffrey M Hill

US Patent:

7606714, Oct 20, 2009

Filed:

Sep 10, 2004

Appl. No.:

10/939288

Inventors:

David R. Williams - Carlisle MA, US
Jeffrey Hill - Westford MA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G10L 15/22

US Classification:

704275, 37926502

Abstract:

An automated response system (e. g. , an automated voice response system) may employ learning strategies to develop or improve automated response capabilities. Learning strategies may include using communications(e. g. , utterances, text messages, etc. ) of one party in a conversation (e. g. , a customer service agent) to identify and categorize communications of another party in the conversation (e. g. , a caller). Classifiers can be build from the categorized communications. Classifiers can be used to identify common communications patterns of a party in a conversation (e. g. , an agent). Learning strategies may also include selecting communications as learning opportunities to improve automated response capabilities based on selection criteria (e. g. , selection criteria chosen to ensure that the system does not learn from unreliable or insignificant examples).

US Patent:

8000973, Aug 16, 2011

Filed:

Feb 3, 2009

Appl. No.:

12/364807

Inventors:

David Williams - Carlisle MA, US
Jeffrey Hill - Westford MA, US
Yuri Zieman - Waltham MA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/20
G10L 15/22

US Classification:

704275

Abstract:

An embodiment of a method is disclosed wherein a natural language communication is received from a user. A concept recognition process is applied to automatically derive a representation of concepts embodied in the natural language communication. A collection of information likely to be useful in responding to the natural language communication is selected based on correspondence to the representation of concepts. The collection of information is provided to a human agent through an interface. Through the interface, an identification of a particular item of information from the collection is received. The particular item is illustratively a sub-set of the collection of information, the sub-set being a particular proposed response to the natural language communication. The particular proposed response is delivered to the user.

US Patent:

20020077823, Jun 20, 2002

Filed:

Mar 30, 2001

Appl. No.:

09/822590

Inventors:

Andrew Fox - Sudbury MA, US
Bin Liu - Northborough MA, US
Michael Tinglof - Concord MA, US
Tim Rochford - East Greenwich RI, US
Toffee Albina - Cambridge MA, US
Lorin Wilde - Stoneham MA, US
Jeffrey Hill - Westford MA, US

International Classification:

G10L013/08
G10L013/00

US Classification:

704/260000

Abstract:

A software development method and apparatus is provided for the simultaneous creation of software applications that operate on a variety of client devices and include text-to-speech and speech recognition capabilities. A software development system and related method use a graphical user interface that provides a software developer with an intuitive drag and drop technique for building software applications. Program elements, accessible with the drag and drop technique, include corresponding markup code that is adapted to operate on the plurality of different client devices. The software developer can generate a natural language grammar by providing typical or example spoken responses. The grammar is automatically enhanced to increase the number of recognizable words or phrases. The example responses provided by the software developer are further used to automatically build application-specific help. At application runtime, a help interface can be triggered to present these illustrative spoken prompts to guide the end user in responding.

US Patent:

53332687, Jul 26, 1994

Filed:

Sep 16, 1992

Appl. No.:

7/946242

Inventors:

David C. Douglas - Concord MA
Mahesh N. Ganmukhi - Littleton MA
Jeffrey V. Hill - Malden MA
W. Daniel Hillis - Brookline MA
Bradley C. Kuszmaul - Waltham MA
Charles E. Leiserson - Winchester MA
David S. Wells - Bolton MA
Monica C. Wong - Cambridge MA
Shaw-Wen Yang - Waltham MA
Robert C. Zak - Belmont MA

Assignee:

Thinking Machines Corporation - Cambridge MA

International Classification:

G06F 1100

US Classification:

395200

Abstract:

A digital computer includes a plurality of processing elements, a command processor, a diagnostic processor and a communications network. The processing elements each performs data processing and data communications operations in connection with commands. The processing elements also performing diagnostic operations in response to diagnostic operation requests and providing diagnostic results in response thereto. The command processor generates commands for the processing elements, and also performs diagnostic operations in response to diagnostic operation requests and providing diagnostic results in response thereto. The diagnostic processor generates diagnostic requests. The communication network includes three elements, including a data router, a control network and a diagnostic network. The data router is connected to the processing elements for facilitating the transfer of data among them during a data communications operation. The control network is connected to the processing elements and the command processor for transferring commands from the command processor to the processing elements.

US Patent:

52281167, Jul 13, 1993

Filed:

May 17, 1991

Appl. No.:

7/704704

Inventors:

Larry R. Harris - Concord MA
Jeffrey M. Hill - Watertown MA
Dayton Marcott - Watertown MA
Timothy F. Rochford - East Greenwich RI

Assignee:

Aicorp., Inc. - Waltham MA

International Classification:

G06F 1518

US Classification:

395 54

Abstract:

An inference engine in a knowledge base system may be invoked by an application program (e. g. , a COBOL program), by arranging to detect, in the program, instructions whose syntax complies with the syntax requirements of a predefined data base manipulation language (e. g. , SQL), and then executing the instruction by invoking the inference engine. As a result, the application programmer can implicitly and transparently take full advantage of the facilities of the inference engine using simple, known data base manipulation language statements. In other aspects, the "if (condition)" side of an inference rule triggers the inference engine to execute a sequence of steps based on a class of facts referred to in the condition and based on prestored information identifying the storage scheme for that class of facts; facts retrieved from an external data base are filtered to eliminate unneeded facts, before transducing the remaining, needed facts into the temporary storage space; and the knowledge base system exercises control of the cursor control mechanism of an external data base in order to retrieve facts one by one as needed by the inference engine.

US Patent:

62197754, Apr 17, 2001

Filed:

Mar 18, 1998

Appl. No.:

9/040747

Inventors:

Jon P. Wade - Cambridge MA
Daniel R. Cassiday - Topsfield MA
Robert D. Lordi - Wayland MA
Guy Lewis Steele - Lexington MA
Margaret A. St. Pierre - Lexington MA
Monica C. Wong-Chan - Cambridge MA
Zahi S. Abuhamdeh - Newton MA
David C. Douglas - Concord MA
Mahesh N. Ganmukhi - Littleton MA
Jeffrey V. Hill - Malden MA
W. Daniel Hillis - Cambridge MA
Scott J. Smith - Boston MA
Shaw-Wen Yang - Waltham MA
Robert C. Zak - Lexington MA

Assignee:

Thinking Machines Corporation - Cambridge MA

International Classification:

G06F 702

US Classification:

712 11

Abstract:

A massively-parallel computer includes a plurality of processing nodes and at least one control node interconnected by a network. The network faciliates the transfer of data among the processing nodes and of commands from the control node to the processing nodes. Each processing node includes an interface for transmitting data over, and receiving data and commands from, the network, at least one memory module for storing data, a node processor and an auxiliary processor. The node processor receives commands received by the interface and processes data in response thereto, in the process generating memory access requests for facilitating the retrieval of data from or storage of data in the memory module. The node processor further controlling the transfer of data over the network by the interface. The auxiliary processor is connected to the memory module and the node processor.

US Patent:

53882148, Feb 7, 1995

Filed:

Jan 14, 1994

Appl. No.:

8/183219

Inventors:

Charles E. Leiserson - Winchester MA
Robert C. Zak - Lexington MA
W. Daniel Hillis - Cambridge MA
Bradley C. Kuszmaul - Waltham MA
Jeffrey V. Hill - Santa Clara CA

Assignee:

Thinking Machines Corporation - Cambridge MA

International Classification:

G06F 1300

US Classification:

395200

Abstract:

A computer comprising a plurality of processing nodes, a control node and a request distribution network. Each processing node receives processing requests and generates in response processed data. The control node generates processing requests for transfer to selected ones of the processing nodes as identified by associated request address information, and receives processed data in response, the request address information identifying selected ones of the processing nodes to receive a processing request in parallel. The request distribution network distributes the processing requests to the processing nodes and returns processed data to the control node. The network includes a plurality of request distribution nodes connected in a plurality of levels to form a tree-structure, including an upper root level and a lower leaf level. Each request distribution node is connected to receive processing requests from, and to couple processed data to, a parent, the parent of the request distribution node of the root level comprising the control node, and each request distribution node being further connected to couple processing requests to and receive processed data from, selected children, the children of the request distribution nodes of the leaf level comprising the processing nodes. Each request distribution node, in response to request address information received from its parent, identifies selected ones of its children and thereafter couples further request address information which it receives and processing requests in parallel to its children.

US Patent:

58729879, Feb 16, 1999

Filed:

Sep 16, 1996

Appl. No.:

8/714635

Inventors:

Jon P. Wade - Cambridge MA
Daniel R. Cassiday - Topsfield MA
Robert D. Lordi - Wayland MA
Guy Lewis Steele - Lexington MA
Margaret A. St. Pierre - Lexington MA
Monica C. Wong-Chan - Cambridge MA
Zahi S. Abuhamdeh - Newton MA
David C. Douglas - Concord MA
Mahesh N. Ganmukhi - Littleton MA
Jeffrey V. Hill - Malden MA
W. Daniel Hillis - Cambridge MA
Scott J. Smith - Boston MA
Shaw-Wen Yang - Waltham MA
Robert C. Zak - Lexington MA

Assignee:

Thinking Machines Corporation - Cambridge MA

International Classification:

G06F 702

US Classification:

39580003

Abstract:

A massively-parallel computer includes a plurality of processing nodes and at least one control node interconnected by a network. The network faciliates the transfer of data among the processing nodes and of commands from the control node to the processing nodes. Each each processing node includes an interface for transmitting data over, and receiving data and commands from, the network, at least one memory module for storing data, a node processor and an auxiliary processor. The node processor receives commands received by the interface and processes data in response thereto, in the process generating memory access requests for facilitating the retrieval of data from or storage of data in the memory module. The node processor further controlling the transfer of data over the network by the interface. The auxiliary processor is connected to the memory module and the node processor.