Patents by Inventor Chad P. Walters
Chad P. Walters has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11803596Abstract: Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.Type: GrantFiled: October 1, 2019Date of Patent: October 31, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Knut Magne Risvik, Michael Hopcroft, John G. Bennett, Karthik Kalyanaraman, Trishul Chilimbi, Chad P. Walters, Vishesh Parikh, Jan Otto Pedersen
-
Publication number: 20200192948Abstract: Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.Type: ApplicationFiled: October 1, 2019Publication date: June 18, 2020Inventors: KNUT MAGNE RISVIK, MICHAEL HOPCROFT, JOHN G. BENNETT, KARTHIK KALYANARAMAN, TRISHUL CHILIMBI, CHAD P. WALTERS, VISHESH PARIKH, JAN OTTO PEDERSEN
-
Patent number: 10437892Abstract: Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.Type: GrantFiled: July 8, 2014Date of Patent: October 8, 2019Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Knut Magne Risvik, Michael Hopcroft, John G. Bennett, Karthik Kalyanaraman, Trishul Chilimbi, Chad P. Walters, Vishesh Parikh, Jan Otto Pedersen
-
Patent number: 9424351Abstract: Methods and systems are provided for using a hybrid-distribution system to identify relevant documents based on a search query. A group of documents is assigned to a particular segment. The group of documents is indexed both by atom and by document to form a reverse index and a forward index. Both indexes are divided amongst each node in that segment so that each node is responsible for storing and accessing a different portion of both the reverse and forward indexes. The reverse index portion is accessed on each of a first set of nodes to identify a first set of documents that is relevant to a particular search query. Document identifications associated with the first set of documents are used to identify a second set of nodes that access their forward index portions to limit the number of relevant documents to a second set of documents.Type: GrantFiled: November 22, 2010Date of Patent: August 23, 2016Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Knut Magne Risvik, Michael Hopcroft, John Bennett, Karthik Kalyanaraman, Trishul Chilimbi, Chad P. Walters, Vishesh Parikh, Jan Otto Pedersen
-
Publication number: 20140324819Abstract: Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.Type: ApplicationFiled: July 8, 2014Publication date: October 30, 2014Inventors: KNUT MAGNE RISVIK, MICHAEL HOPCROFT, JOHN BENNETT, KARTHIK KALYANARAMAN, TRISHUL CHILIMBI, CHAD P. WALTERS, VISHESH PARIKH, JAN OTTO PEDERSEN
-
Publication number: 20140278983Abstract: In various embodiments, systems and methods are provided for facilitating enhanced advertisement display. In embodiments, an indication of an entity preference and a corresponding entity bid in association with an advertisement are received. Thereafter, the entity preference and the corresponding entity bid associated with the advertisement are provided for use in an advertisement auction when at least one search result for a query is associated with the entity preference. In such a case, the entity bid is used to participate in the advertisement auction.Type: ApplicationFiled: March 15, 2013Publication date: September 18, 2014Applicant: MICROSOFT CORPORATIONInventors: Dirk H. REINSHAGEN, David C. KU, Aravind BALA, Eric M. BOYD, Ramu MOVVA, Anand SAMPATHKUMARAN, Fnu SIDHARTHA, Chad P. WALTERS
-
Patent number: 8713024Abstract: Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.Type: GrantFiled: November 22, 2010Date of Patent: April 29, 2014Assignee: Microsoft CorporationInventors: Knut Magne Risvik, Michael Hopcroft, John G. Bennett, Karthik Kalyanaraman, Trishul Chilimbi, Chad P. Walters, Vishesh Parikh, Jan Otto Pedersen
-
Patent number: 8620907Abstract: Search results are identified and returned in response to search queries by evaluating and pruning candidate documents in multiple stages. The process employs a search index that indexes atoms found in documents and pre-computed scores for document/atom pairs. When a search query is received, atoms are identified from the search query and a reformulated query is generated based on the identified atoms. The reformulated query is used to identify matching documents, and a preliminary score is generated for matching documents using a simplified scoring function and pre-computed scores in the search index. Documents are pruned based on preliminary scores, and the remaining documents are evaluated using a final ranking algorithm that provides a final set of ranked documents, which is used to generate search results to return in response to the search query.Type: GrantFiled: November 22, 2010Date of Patent: December 31, 2013Assignee: Microsoft CorporationInventors: Knut Magne Risvik, Michael Hopcroft, John G. Bennett, Karthik Kalyanaraman, Trishul Chilimbi, Chad P. Walters, Jan Otto Pedersen
-
Patent number: 8229730Abstract: Methods, systems and computer readable media for finding documents in a data store that match a natural language query submitted by a user are provided. The documents and queries are matched by determining that words within the query have the same relationship to each other as the same words in the document. Documents are semantically analyzed and words in the document are indexed along with the role the word plays in a sentence. The initial semantic role may be generalized using a role hierarchy and stored in the index along with the original role. A similar analysis may be used with the search query to find words used in the same role in both the query and the document.Type: GrantFiled: August 29, 2008Date of Patent: July 24, 2012Assignee: Microsoft CorporationInventors: Martin H. Van Den Berg, Giovanni L. Thione, Chad P. Walters, Richard S. Crouch
-
Publication number: 20120130994Abstract: Search results are identified and returned in response to search queries by evaluating and pruning candidate documents in multiple stages. The process employs a search index that indexes atoms found in documents and pre-computed scores for document/atom pairs. When a search query is received, atoms are identified from the search query and a reformulated query is generated based on the identified atoms. The reformulated query is used to identify matching documents, and a preliminary score is generated for matching documents using a simplified scoring function and pre-computed scores in the search index. Documents are pruned based on preliminary scores, and the remaining documents are evaluated using a final ranking algorithm that provides a final set of ranked documents, which is used to generate search results to return in response to the search query.Type: ApplicationFiled: November 22, 2010Publication date: May 24, 2012Applicant: MICROSOFT CORPORATIONInventors: KNUT MAGNE RISVIK, MICHAEL HOPCROFT, JOHN G. BENNETT, KARTHIK KALYANARAMAN, TRISHUL CHILIMBI, CHAD P. WALTERS, JAN OTTO PEDERSEN
-
Publication number: 20120130997Abstract: Methods and systems are provided for using a hybrid-distribution system to identify relevant documents based on a search query. A group of documents is assigned to a particular segment. The group of documents is indexed both by atom and by document to form a reverse index and a forward index. Both indexes are divided amongst each node in that segment so that each node is responsible for storing and accessing a different portion of both the reverse and forward indexes. The reverse index portion is accessed on each of a first set of nodes to identify a first set of documents that is relevant to a particular search query. Document identifications associated with the first set of documents are used to identify a second set of nodes that access their forward index portions to limit the number of relevant documents to a second set of documents.Type: ApplicationFiled: November 22, 2010Publication date: May 24, 2012Applicant: MICROSOFT CORPORATIONInventors: KNUT MAGNE RISVIK, MICHAEL HOPCROFT, JOHN BENNETT, KARTHIK KALYANARAMAN, TRISHUL CHILIMBI, CHAD P. WALTERS, VISHESH PARIKH, JAN OTTO PEDERSEN
-
Publication number: 20120130995Abstract: Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.Type: ApplicationFiled: November 22, 2010Publication date: May 24, 2012Applicant: MICROSOFT CORPORATIONInventors: KNUT MAGNE RISVIK, MICHAEL HOPCROFT, JOHN G. BENNETT, KARTHIK KALYANARAMAN, TRISHUL CHILIMBI, CHAD P. WALTERS, VISHESH PARIKH, JAN OTTO PEDERSEN
-
Patent number: 7827523Abstract: A system and method for dynamically composing a class is provided. A query is parsed and a compiler object tree is generated that corresponds to the operators in the query. A set of feature requests and responses are initiated and a set of feature objects are generated that are executed at runtime. The language of the query may be extended by registering a new operator, and optionally a new feature for a query language, with a search engine without modifying the source code of the search engine. The new operator may be specified in a plug-in and provided to the search engine via the plug-in. An application converts an end user query into an application query that conforms to the query language supported by the search engine and includes the new operator. The application query may also include references to traditional programming constructs and search engine primitives.Type: GrantFiled: February 22, 2006Date of Patent: November 2, 2010Assignee: Yahoo! Inc.Inventors: Nawaaz Ahmed, Robert L. Travis, Jr., Chad P. Walters
-
Publication number: 20090063473Abstract: Methods, systems and computer readable media for finding documents in a data store that match a natural language query submitted by a user are provided. The documents and queries are matched by determining that words within the query have the same relationship to each other as the same words in the document. Documents are semantically analyzed and words in the document are indexed along with the role the word plays in a sentence. The initial semantic role may be generalized using a role hierarchy and stored in the index along with the original role. A similar analysis may be used with the search query to find words used in the same role in both the query and the document.Type: ApplicationFiled: August 29, 2008Publication date: March 5, 2009Applicant: Powerset, Inc.Inventors: Martin HENK VAN DEN BERG, Richard S. CROUCH, Giovanni L. THIONE, Chad P. WALTERS
-
Patent number: 5617552Abstract: A lossless data compression system and method compresses a set of M data words stored in a computer memory. A first table stores data representing last occurrence positions among those of the M data words already processed for all distinct word values. A second table stores for each data word an entry indicating the position, if any, of a most recent prior occurrence of another data word with the same word value. A dictionary index indicates how many distinct data word values have been encountered during processing of M data words.Type: GrantFiled: February 29, 1996Date of Patent: April 1, 1997Assignee: Connectix CorporationInventors: Jonathan F. Garber, Jorg A. Brown, Chad P. Walters