Microsoft Technology Licensing, LLC

Apple Inc.

Other

Gianluca Donato

Santanu Bhowmick

Franco Salvetti

Aparna Rajaraman

Joseph B Wearing

Giovanni Lorenzo Thione

David D Ahn

Micol Marchetti-Bowick

Michael Paul Bieniosek

Apostolos Karmirantzos

Yiping Zhou

Andrei Peter Makhanov

Justin John Trobec

Oana Nicolov

Ara Avanesyan

Deepak Kumar Singh

Madhuwanti A Vaidya

Techniques described herein may be used to identify anomalies in a joined region of two datasets. For example, a computer system may determine an elevation anomaly data point in based on an elevation criterion. The computer system may determine a set of buffer points surrounding the elevation anomaly data points. The computer system may user the set of buffer points to reduce the number of data points for adjusting. The computer system may determine a reduction factor based on the buffer points. The computer system may then apply the reduction factor to points in the buffer points and other points.

Map data adjustments for anomaly correction

Techniques described herein may be used to adjust sets of bounded polygons in a predictable and automated manner. For example, a computer system may access a first set of polygons of a first type and a set of polylines of a second type. The computer system may group polygons from the first set of polygons into face groups. The computer system may determine that a first face group is anomalous based on a perimeter of the first polygon and first property of a first polyline of the set of polylines. The computer system may, for the first face group, compute a set of push vectors and apply the set of push vectors to the first face group.

Polygon block shrinkage using push vectors

Techniques described herein may be used to using a medial axis of an overlap or gap to assign portions of the gap or overlap to adjacent polygons. For example, a computer system may identify a subject polygon defined by a first polygon and a second polygon. The computer system may determine a plurality of line segments within the subject polygon and that define a medial axis of the subject polygon. The computer system may assign a first face of the plurality of faces to the first polygon. The computer system may update a first boundary of the first polygon to include a first face area corresponding to the first face. The computer system may cause rendering, on a display, of a map view that includes the updated first boundary.

Polygon overlap assignment using medial axis

Architecture that enables the extraction of document-specific salient terms from documents for use improving the result summaries on a search engine result page (SERP), and methods to extract the salient terms from the documents using search engine logs, document metadata, and other algorithms. Document-specific salient terms can provide additional information and significantly improve user success in finding relevant documents while disregarding non-relevant documents. The architecture also enables the extraction of entity information from a variety of sources, some of which are at a query level, and other sources that are specific to a single document. All the entities available are aggregated for a set of results and the most relevant results are identified. The final set of results is then used to determine where in the document summary to apply visual emphasis or cues (e.g., bolding).

Salient terms and entities for caption generation and presentation

Architecture that splits the generation of results summaries into at least two phases for reduced latency and improved relevance. A first phase generates a summary quickly and thereby enables subsequent modules to begin processing. A second round then executes in parallel to these other modules to offset the latency. The second round can also provide additional contextual information to the summarization module to improve the quality (relevance) of the summaries. Ultimately, the summaries generated in the two phases are merged. The multiple rounds of summarization enable the first round to be cheaper in processing resources to save overall latency, whereas the second phase can be more expensive, since the second phase can be run in parallel with other modules. Additionally, contextual information can be used to build the full content summaries in the second round.

Multiple rounds of results summarization for improved latency and relevance

An ecosystem that enables content providers to decorate search results with interactive content. The searching user can then interact with the content and view the content without leaving the search results page. The content provider sends content and metadata to a content enrichment enabler that transforms the content into an enriched content, and receives back from the enrichment enabler a location identifier which includes information that identifies the provider and the location of the enriched content. The content provider then embeds the identifier in each of the content provider webpages for which such content has been produced. The identifier is indexed by a search engine to identify the interactive content and source thereof for surfacing on a search results page. The search result is decorated with an indicator that the user recognizes as the availability of the enriched content, and uses to access the content via the web page.

Decoration of search results by third-party content providers

Referring expressions are identified for concepts by analyzing search query and result selection information. An ontology of concepts is identified, and at least one document is associated with each concept. The document associated with a concept is representative of the concept. Search query information from a search engine is analyzed to identify search queries that resulted in user selections of documents associated with the concepts. Referring expressions that refer to the concepts are identified based on the search queries that resulted in user selections of documents corresponding with the concepts. After identifying referring expressions for concepts, search queries may be mapped to referring expressions to identify concepts to which the search queries pertain, and search result pages may be generated based on knowledge of the concepts.

Growing community of inventors

Los Altos, CA, United States of America

Gianluca Donato