Microsoft Technology Licensing, LLC

Esposito, Mario

Xiaochuan Ni

Zheng Chen

Jian-Tao Sun

Gang Wang

Xuedong D Huang

Jian Hu

Zhimin Zhang

Shipeng Li

Peng Xu

Ye-Yi Wang

Qifa Ke

Shakti Dhirendraji Sinha

Li Jiang

Xiaolong Li

Ke Tang

Satya Kanduri

Manish Malik

Mario Esposito

Peng Bai

Jiarui Ren

Systems and techniques for sequence to sequence conversational query understanding are described herein. A query may be received that includes multiple words. It may be identified that the query is to be reformulated based on an attention value for an attention word in the query. Relationships may be determined among words of the query and words in a previously submitted query and words in results from the previously submitted query. The query may be reformulated based on the relationships. The reformulated query may be employed to retrieve query results.

Sequence to sequence conversational query understanding

Searching is assisted by recognizing a selection of text from a document as an indication that a user wishes to initiate a search based on the selected text. The user is provided with query suggestions based on the selected text and the query suggestions are ranked based on a context provided by the document. The user may select the text by using a mouse, drawing a circle around the text on a touch screen, or by other input techniques. The query suggestions may be based on query reformulation or query expansion techniques applied to the selected text. Context provided by the document is used by a language model and/or an artificial intelligence system to rank the query suggestions in predicted order of relevance based on the selected text and the context.

Context-based search query formation

A system and method for generating modifiers for updated search queries are provided. In example embodiments, metadata is accessed, the metadata corresponds to search results of an input query and comprising a plurality of candidate modifiers. A score is calculated for each candidate based on a relevance value that indicates the correlation between a candidate modifier and the input query. A list of top number of candidate modifiers is generated based on the score of the candidate modifier transgressing a first threshold. A uniqueness score is calculated for combination pairs of candidate modifiers within the list, the uniqueness score being used to eliminate candidate modifiers. The list of top number of candidate modifiers is presented, at a user interface, according to a ranked order based on the score.

Generating modifiers for updating search queries

Techniques for utilizing data mining technology to extract universal topics with multilingual representations from a multilingual database, and to organize existing or new documents in different languages by analyzing their respective topic distributions.

Mining multilingual topics

A computer-readable storage medium having stored thereon computer-executable instructions which, when executed by a computer, cause the computer to implement an opinion search engine. The instructions to implement an opinion search engine cause the computer to collect opinion data about one or more objects from the Internet, extract metadata about the opinion data from the opinion data, remove duplicate metadata from the metadata to generate a resulting metadata, categorize the resulting metadata for similar objects according to one or more taxonomies from one or more websites on the Internet and rank the similar objects based on the categorized metadata.

Opinion search engine

Techniques and technologies for expanding a gallery by seeding the gallery with seed query results. A template is identified which is associated with the subjects of the seed queries and content identifiers are identified which include the template. These content identifiers are used to expand the gallery to include more content identifiers than before the expansion of the gallery.

Query expansion through searching content identifiers

Embodiments of the present invention relate to systems, methods, and computer-storage media for a method of contextually analyzing terms within a search query. In one embodiment, a received search query is classified into a domain category. Additionally, information is assigned to a schema associated with the domain by analyzing the search query. Further, at least one search result that helps a user complete a task within the domain is provided based on the information in the schema.

Dialog-enhanced contextual search query analysis

Providing sentiment classification of out of domain data are disclosed herein. In some aspects, a source domain having a trained classifier is matched to a target domain having a target classifier. The trained classifier may include identifiers that may be used to predict the sentiment of opinion data for the source domain. The target classifier may use the identifiers of the trained classifier to determine the sentiment of opinion data for the target domain.

Sentiment classification using out of domain data

A method for identifying transactional queries includes associating user queries with forms clicks on by users who employ a search engine to place the queries during query sessions. A score is assigned to each user query. The score reflects a likelihood that the respective query is a transactional query. The query is classified as a transactional query if the score exceeds a threshold value.

Classification of transactional queries based on identification of forms

The techniques describe recommending mobile query suggestions by integrating time and location in response to a query input submitted on a mobile computing device. A process constructs a bipartite graph by extracting users that submitted queries from mobile search logs and associating time and location with the submitted queries. The process determines the users are similar having submitted similar queries at similar times and at similar locations. The process receives a query input associated with a current time and a current location of a mobile computing device. Next, the process computes a relatedness of candidate queries to the query input based on a similarity between the user groups having submitted both the candidate queries and the query input, and distances of times and locations at which the user previously issued the query input and the candidate queries.

Growing community of inventors

Beijing, China

Xiaochuan Ni