John Gerard Messerly

US Patent:

6349316, Feb 19, 2002

Filed:

Apr 8, 1999

Appl. No.:

09/289085

Inventors:

Ronald A. Fein - Seattle WA
William B. Dolan - Redmond WA
John Messerly - Seattle WA
Edward J. Fries - Kirkland WA
Christopher A. Thorpe - Orangeville UT
Shawn J. Cokus - Seattle WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1500

US Classification:

707531, 707500

Abstract:

An author-oriented document summarizer for a word processor is described. The document summarizer performs a statistical analysis to generate a list of ranked sentences for consideration in the summary. The summarizer counts how frequently content words appear in a document and produces a table correlating the content words with their corresponding frequency counts. Phrase compression techniques are used to produce more accurate counts of repeatedly used phrases. A sentence score for each sentence is derived by summing the frequency counts of the content words in a sentence and dividing that tally by the number of the content words in the sentence. The sentences are then ranked in order of their sentence scores. Concurrent with the statistical analysis, during the same pass through the document the summarizer performs a cue-phrase analysis to weed out sentences with words or phrases that have been pre-identified as potential problem phrases. The cue-phrase analysis compares sentence phrases with a pre-compiled list of words and phrases and sets conditions on whether the sentences containing them can be used in the summary.

US Patent:

7051024, May 23, 2006

Filed:

Feb 11, 2002

Appl. No.:

10/074951

Inventors:

Ronald A. Fein - Seattle WA, US
William B. Dolan - Redmond WA, US
John Messerly - Seattle WA, US
Edward J. Fries - Kirkland WA, US
Christopher A. Thorpe - Orangeville UT, US
Shawn J. Cokus - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/00
G06F 17/30

US Classification:

707 6, 715500, 715531

Abstract:

An author-oriented document summarizer for a word processor is described. The document summarizer performs a statistical analysis to generate a list of ranked sentences for consideration in the summary. The summarizer counts how frequently content words appear in a document and produces a table correlating the content words with their corresponding frequency counts. Phrase compression techniques are used to produce more accurate counts of repeatedly used phrases. A sentence score for each sentence is derived by summing the frequency counts of the content words in a sentence and dividing that tally by the number of the content words in the sentence. The sentences are then ranked in order of their sentence scores. Concurrent with the statistical analysis, during the same pass through the document the summarizer performs a cue-phrase analysis to weed out sentences with words or phrases that have been pre-identified as potential problem phrases. The cue-phrase analysis compares sentence phrases with a pre-compiled list of words and phrases and sets conditions on whether the sentences containing them can be used in the summary.

US Patent:

8381195, Feb 19, 2013

Filed:

Jun 17, 2010

Appl. No.:

12/817466

Inventors:

Jonathon Michael Stall - Bothell WA, US
Curt Oliver Hagenlocher - Mercer Island WA, US
John Benjamin Messerly - Seattle WA, US
James J. Hugunin - Mercer Island WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

717131

Abstract:

The present invention extends to methods, systems, and computer program products for implementing parallel loops with serial semantics. Embodiments of the invention provide a semantic transforms and codegen patterns that provide more efficient parallel loop implementations with serial loop semantics. Embodiments of the invention support assignments within for-loop bodies, support break/return constructs within for-loop bodies, and run transformations to covert serial constructs to parallel constructs.

US Patent:

8499290, Jul 30, 2013

Filed:

Jun 15, 2010

Appl. No.:

12/815801

Inventors:

John Benjamin Messerly - Seattle WA, US
James J. Hugunin - Mercer Island WA, US
Jonathon Michael Stall - Bothell WA, US
Curt Oliver Hagenlocher - Mercer Island WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45
G06F 9/445

US Classification:

717140, 717109, 717141

Abstract:

The present invention extends to methods, systems, and computer program products for creating text functions form a spreadsheet. Embodiments of the invention extract functions from spreadsheets and represent the functions in textual form. Representation in textual form promotes code reuse, clarify, expressive power, and better performance. Text can be rendered in virtually any programming language, such as, for example, C#, C++, Visual Basic (“VB”), etc. In some embodiments, programming language extensibility to support spreadsheet compatible data types and functions is utilized.

US Patent:

20060200765, Sep 7, 2006

Filed:

May 22, 2006

Appl. No.:

11/419670

Inventors:

Ronald Fein - Seattle WA, US
William Dolan - Redmond WA, US
John Messerly - Seattle WA, US
Edward Fries - Kirkland WA, US
Christopher Thorpe - Orangeville UT, US
Shawn Cokus - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/00

US Classification:

715530000

Abstract:

A document summarizer for word processors is described. In one aspect, a document is accessed for summarization. Using a phase summarizing process, a sentence-based summary of writings of the document is constructed from the writings. A file associated with the document is located. The sentence-based summary is inserted into the file such that the sentence-based summary is before an opening paragraph of the document. The file is saved to non-volatile memory.

US Patent:

20090328016, Dec 31, 2009

Filed:

Jun 27, 2008

Appl. No.:

12/163775

Inventors:

Timothy Yat Tim Ng - Bellevue WA, US
Robert Elliott Viehland - Seattle WA, US
James Hugunin - Mercer Island WA, US
Samuel Y. Ng - Belleview WA, US
Matthew J. Warren - Redmond WA, US
Anders Hejlsberg - Seattle WA, US
Henricus Johannes Maria Meijer - Mercer Island WA, US
John Wesley Dyer - Monroe WA, US
Avner Y. Aharoni - Seattle WA, US
John Benjamin Messerly - Seattle WA, US
Martin Maly - Redmond WA, US
William P. Chiles - Seattle WA, US
Mads Torgersen - Issaquah WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 9/44

US Classification:

717143

Abstract:

Expression tree versatility and applicability are enhanced to facilitate programming across various program languages and execution contexts. An expression tree can represent programmatic code as data in a representation common to multiple process mechanisms. As a result, entire programs or portions thereof can be captured and processed by a numerous common language components. Further, language specific concepts can be reduced to the common representation to enable language independent employment.

US Patent:

61610844, Dec 12, 2000

Filed:

Aug 3, 1999

Appl. No.:

9/366499

Inventors:

John J. Messerly - Bainbridge Island WA
George E. Heidorn - Bellevue WA
Stephen D. Richardson - Redmond WA
William B. Dolan - Redmond WA
Karen Jensen - Bellevue WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1727
G06F 1730

US Classification:

704 9

Abstract:

The present invention is directed to performing information retrieval utilizing semantic representation of text. In a preferred embodiment, a tokenizer generates from an input string information retrieval tokens that characterize the semantic relationship expressed in the input string. The tokenizer first creates from the input string a primary logical form characterizing a semantic relationship between selected words in the input string. The tokenizer then identifies hypernyms that each have an "is a" relationship with one of the selected words in the input string. The tokenizer then constructs from the primary logical form one or more alternative logical forms. The tokenizer constructs each alternative logical form by, for each of one or more of the selected words in the input string, replacing the selected word in the primary logical form with an identified hypernym of the selected word. Finally, the tokenizer generates tokens representing both the primary logical form and the alternative logical forms. The tokenizer is preferably used to generate tokens for both constructing an index representing target documents and processing a query against that index.

US Patent:

59419440, Aug 24, 1999

Filed:

Mar 3, 1997

Appl. No.:

8/828813

Inventors:

John J. Messerly - Bainbridge Island WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1516
G06F 1730

US Classification:

709203

Abstract:

Weights are assigned to features of data objects and the weights are utilized to determine whether data objects are substantially identical or not. One application of such weights is to assign weights to terms in web page documents. The weights assigned to the terms may then be utilized to determine whether web page documents are substantially identical. A set of identicals may be generated for each web page that is indexed by the system and utilized to repair broken hyperlinks. Specifically, when a uniform resource locator (URL) associated with the hyperlink cannot be resolved or cannot be resolved in a timely fashion, one of the identicals of the desired web page documents may be returned to provide a requesting party with the desired content.