Kenneth Michael Church, 70Everett, WA

7277029, Oct 2, 2007

Jun 23, 2005

11/159711

Bo Thiesson - Woodinville WA, US
Kenneth Ward Church - Seattle WA, US

Microsoft Corporation - Redmond WA

H03M 11/00

341 22, 34082569, 341176, 704 1

A method of inputting text is provided in which a first portion of an input string is received from a user, the first portion of the input string including at least one keystroke representing a wildcard character of the input string. A second portion of the input string is then received, with the second portion including one or more keystrokes all representing non-wildcard characters of the input string.

7778837, Aug 17, 2010

Nov 30, 2006

11/565231

Bo Thiesson - Woodinville WA, US
Kenneth W. Church - Seattle WA, US

Microsoft Corporation - Redmond WA

G10L 21/00

704278, 704 7, 704 9, 704246, 704251

Systems and methods that create a classification of sentences in a language, and further construct associated local versions of language models, based on geographical location and/or other demographic criteria—wherein such local language models can be of different levels of granularity according to chosen demographic criteria. The subject innovation employs a classification encoder component that forms a classification (e. g. a tree structure) of sentences, and a local language models encoder component, which employs the classification of sentences in order to construct the localized language models. A decoder component can subsequently enable local word wheeling and/or local web search by blending k-best answers from local language models of varying demographic granularity that match users demographics. Hence, k-best matches for input data by users in one demographic locality can be different from k-best matches for the same input by other users in another locality.

8275759, Sep 25, 2012

Feb 24, 2009

12/391274

Scott K. Imig - Redmond WA, US
Kenneth Ward Church - Seattle WA, US
Jean-Marie Larchevêque - Bellevue WA, US
Emily Blythe Pitler - Philadelphia PA, US
Robert Rounthwaite - Fall City WA, US
Ryen W. White - Kirkland WA, US

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/30

707706, 707767, 707770

Described is a search technology in which a search engine constructs a results page for a query that integrates suggested queries with the individual query results (e. g. , displayed URLs). When rendered, the proximity of the suggested queries to their corresponding individual query result provides context as to the specific URL to which the suggested query is related. Suggested queries may appear alongside their associated search result, e. g. , a displayed URL, and/or in an expandable panel proximate that individual search result. Suggested queries may appear within text accompanying a URL, and/or in a drop down menu following interaction with such text or the like. Related queries may be found by using a search result URL to find a query, by analyzing a search result's text snippet, by accessing historical data, and/or by accessing current user session data.

8606627, Dec 10, 2013

Jun 12, 2008

12/137567

Arnd Christian König - Kirkland WA, US
Martin Miroslavov Markov - Redmond WA, US
Kenneth Ward Church - Seattle WA, US

Microsoft Corporation - Redmond WA

G06Q 40/00
G07G 1/14

705 14, 709217

A system that facilitates selecting advertisements that match a search query is described herein. The system includes a search query receiver component that receives a search query including keywords. The system also includes a match component that uses an associative data structure to identify in the associative data structure one or more data nodes that are associated in the associative data structure with respective unique keys corresponding to respective one or more hashes of combinations of the keywords in the search query. For each identified data node, the match component selects advertisements associated with bid phrases stored in the identified data node that respectively only include keywords included in the search query.

2008014, Jun 12, 2008

Dec 8, 2006

11/608631

Bo Thiesson - Woodinville WA, US
Christopher A. Meek - Kirkland WA, US
Kenneth W. Church - Seattle WA, US
Timothy D. Sharpe - Redmond WA, US

MICROSOFT CORPORATION - Redmond WA

G06Q 30/00
G06F 7/06
G06F 17/30

705 14, 707 5, 707E17017

Match criteria are provided to specify when advertisements will be shown, for instance in a search environment. Input such as search queries can be represented in a simplified form such as an implicit and/or explicit wildcard expression. Advertisers or other entities can bid on terms such that advertisements or similar content are presented when the terms match an expansion of a simplified input. Matching ads can subsequently be displayed alone or in combination with query expansion suggestions and/or query results.

2009008, Mar 26, 2009

Sep 21, 2007

11/858920

Arnd C. Konig - Kirkland WA, US
Surajit Chaudhuri - Redmond WA, US
Kenneth Church - Redmond WA, US
Liying Sui - Mountain View CA, US

MICROSOFT CORPORATION - Redmond WA

G06F 17/30

707 2, 707 5, 707E17014

Index structures and query processing framework that enforces a given threshold on the overhead of computing conjunctive keyword queries. This includes a keyword processing algorithm, logic to determine which indexes to materialize, and a probabilistic approach to reducing the overhead for determining which indexes to build. The index structures leverage the fact that the frequency distribution of natural-language text follows a power law. Given a document collection, a set of indexes is proposed for materialization so that the time for intersecting keywords does not exceed a given threshold Δ. When considering the associated space requirement, the additional indexes are limited. Materialization of such a set of indexes for reasonable values of Δ (e.g., the time required to scan 20% of the largest inverted index), at least for a collection of short documents is distributed by the power law.