Larry Jack Israel, 694718 Somerset Dr SE, Bellevue, WA 98006

6600501, Jul 29, 2003

May 18, 2000

09/574459

Larry J. Israel - Bellevue WA
James H. Cox - Seattle WA
Kipling A. Knox - Sammamish WA
Adrienne E. ODonnell - Seattle WA
Lisa Everett Woods - Poway CA

Microsoft Corporation - Redmond WA

G09G 500

345810, 345833, 345838, 345855, 345963, 705 9, 715507, 708112

A Dynamic Timeline for a computer-based information source, such as an electronic encyclopedia. The Dynamic Timeline can display Links, typically a reference to a time period, topic, or event. When the user chooses the Link, an array of information is presented to the user about the Link-related time period, topic, or event. Links can highlight individual events and trends that occur over a period of time. Links also can present an editorial perspective of events. The Links are typically listed in chronological order on the Dynamic Timeline for an electronic encyclopedia. The Dynamic Timeline allows users to view different Links by changing some dynamic settings.

7752148, Jul 6, 2010

Jul 12, 2007

11/776565

Jinsong Yu - Sammamish WA, US
Seth R. Atkinson - Seattle WA, US
Luke Kelly - Bellevue WA, US
William B. Kunz - Seattle WA, US
Larry J. Israel - Bellevue WA, US
Xin Li - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 15/18
G06F 3/048
G09B 23/02

706 12, 434188, 715810

A problem checker architecture that monitors user progress during a problem-solving process and assists the user through the process (e. g. , when requested) using common human methods of solving the problem. Assistance can be in the form of detecting errors during the process, and providing context-sensitive help information when the user gets stuck or makes a mistake. The problem checker can walk the user through the process of solving a math problem one step at a time allowing the user to learn to solve math problems according to a number of different methods. Rather than simply calculating and displaying the answer, the problem checker allows the user to attempt to solve math problems, providing direction only when asked and correction only when required. The problem checker can recognize multiple solution methods for many common math problems and guide the user to the solution via any of the methods.

8073258, Dec 6, 2011

Aug 22, 2007

11/843645

Jinsong Yu - Sammamish WA, US
Seth Atkinson - Redmond WA, US
Xin Li - Redmond WA, US
Luke Kelly - Bellevue WA, US
Larry Israel - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06K 9/00

382187, 382186, 382314, 708131

Systems and methods for use in handwriting recognition in computer algebra are provided. One disclosed method includes receiving handwriting input from a user via a handwriting input device, the handwriting input representing a mathematical expression. The method further includes, at a recognizer, processing the handwriting input to recognize a plurality of candidates and ranking the plurality of candidates to form initial candidate data. The method may further include, at an application program, scanning the plurality of candidates for segments that match application-level criteria, and adjusting a rank of one or more of the plurality of candidates based on the matching, to form a processed candidate list. The method may further include displaying the processed candidate list via a graphical user interface.

2006018, Aug 17, 2006

Feb 15, 2005

11/059014

Larry Israel - Bellevue WA, US
John Solaro - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707006000, 707001000

Search methods and associated systems are disclosed. One aspect of the invention is directed toward search methods and associated systems. One aspect of the invention is directed toward a computer-implemented searching method that includes receiving an input having a format. The method further includes finding a pattern that matches the format of the input using a rule set. The method still further includes determining a subject of the input based on the pattern, finding a result record corresponding to the subject, and sending an output based on the result record. In certain embodiments, the method can further include determining at least one qualifier based on the pattern and finding a result record corresponding to the subject and the at least one qualifier. In still other embodiments, the method can further include determining a subject of the input based on the pattern and at least one synonym rule.

2007026, Nov 15, 2007

May 15, 2006

11/383451

Chris Anderson - Renton WA, US
Edward Harris - Bellevue WA, US
Jamie Buckley - Redmond WA, US
John Solaro - Bellevue WA, US
Larry Israel - Bellevue WA, US
Randall Kern - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 7/00

707100000

An unbounded redundant discrete fact data store for providing answers to specific fact-based search queries is provided. Facts are stored discretely by the data store with information stored with each discrete fact for locating the discrete fact in response to a search query or browse request. The core of the data store includes subject-indicator-fact sets. Each discrete fact represents a particular facet of a particular subject. Accordingly, the data store includes a subject and zero or more indicators for each discrete fact, facilitating look-up of the discrete facts. Additionally, each subject may have zero or more subject classifications and zero or more parent/child relationships with other subjects, further facilitating filtering and look-up of discrete facts.

2009001, Jan 15, 2009

Jul 12, 2007

11/776564

William B. Kunz - Seattle WA, US
Timothy J. Hoffman - Redmond WA, US
Luke Kelly - Bellevue WA, US
Jinsong Yu - Sammamish WA, US
Larry J. Israel - Bellevue WA, US

MICROSOFT CORPORATION - Redmond WA

G09B 19/02

434188

A problem generator that takes an input as a math problem, analyzes the math problem, and intelligently spawns similar example problem types. The output is a set of math problems based on the conditions set during analysis and customization. For example, if the original problem deals with linear equations, this will be detected during analysis and used to spawn other linear equations as problems. Moreover, if the answer to the original problem is in integer format, so will the answers to the spawned problems. A customizable UI is designed to allow further customization of problem conditions to generate an accurate set of problems based on the initial input. Problem generator templates can be created, shared and modified for distribution and/or future use. Additionally, problem generation APIs can be extended for external code to automate and consume generated math problems.

5970449, Oct 19, 1999

Apr 3, 1997

8/840117

Fileno A. Alleva - Redmond WA
Michael J. Rozak - Issaquah WA
Larry J. Israel - Bellevue WA

Microsoft Corporation - Redmond WA

G10L 708

704235

A text normalizer normalizes text that is output from a speech recognizer. The normalization of the text produces text that is less awkward and more familiar to recipients of the text. The text may be normalized to include audio content, video content, or combinations of audio and video contents. The text may also be normalized to produce a hypertext document. The text normalization is performed using a context-free grammar. The context-free grammar includes rules that specify how text is to be normalized. The context-free grammar may be organized as a tree that is used to parse text and facilitate normalization. The context-free grammar is extensible and may be readily changed.

2015004, Feb 12, 2015

Aug 7, 2013

13/961641

- Redmond WA, US
Eric Smith - Seattle WA, US
Danny Thayer - Duvall WA, US
Bruce Wiedeman - Kirkland WA, US
Larry Jack Israel - Bellevue WA, US
Robert Novitskey - Redmond WA, US
Peter Gurevich - Woodinville WA, US
Mukunda Murthy - Kirkland WA, US
Jacob Pitts - Bellevue WA, US
Eric Borzello - Redmond WA, US
Yi-Lei Wu - Redmond WA, US
Bala Murali Loganath - Bothell WA, US

Microsoft Corporation - Redmond WA

H04L 12/26

709203

Technologies are generally described for collecting, analyzing and reporting telemetry data. A telemetry engine is built into a client application installed on a client device, and the telemetry engine is configured to collect and analyze application data at the client device and report the analyzed data to a service provider associated with the application. The telemetry application includes a specialized set of components, such as a telemetry transport component configured to communicate with the service provider, a data collection module configured to retrieve data from the application, and a rule manager and analyzer configured to analyze collected data according to a set of data collection rules provided by the service provider. The telemetry engine enables collection and analysis of telemetry data from multiple distributed client devices. The client devices dynamically change over time to ensure that current and important information is reported to the service provider.