Microsoft Technology Licensing, LLC

Other

Kaushik Chakrabarti

Surajit J Chaudhuri

Kris Kuppuswamy Ganjam

Zhimin Chen

Vivek Ravindranath Narasayya

James P Finnigan

Kanstantsyn Zoryn

Venkatesh Ganti

Tao Cheng

Dong Xin

Sanjay Agrawal

Chi Wang

Senjuti Basu Roy

Zhongyuan Wang

Mohamed A Yakout

Sumit Gulwani

Cha Zhang

Yun-Cheng Ju

Philip Alan Bernstein

Yeye He

Bolin Ding

Mark Marron

Prabhdeep Singh

James Finnigan

Jianwen Zhang

Bahman Bahmani

Silu Huang

Meihui Zhang

Yuet Ching

Neta Haiby

Vinod Kurpad

Maria Pershina

Anatoly Yevgenyevich Ponomarev

Mengya Hu

Alexander T Gorevski

Zheng Chen

Leon Romaniuk

Surajt Chaudhuri

Seung-won Hwang

Souvik Kundu

Vivek R Narasayya

Mohamed Yakout

The disclosure herein describes generating input key-standard key mappings for a form. A set of input key-value pairs are received, and a subset of candidate form types are determined from a set of form types using the input key-value pairs. A set of standard keys associated with the determined subset of candidate form types are obtained. A set of input key-standard key pairs are generated using the set of input key-value pairs and the obtained set of standard keys and the set of input key-standard key pairs are narrowed using a narrowing rule. Ranking scores for each input key-standard key pair of the narrowed set of input key-standard key pairs are generated. Each input key of the set of input key-vale pairs is mapped to a standard key of the set of standard keys using at least the generated ranking scores of the narrowed set of input key-standard key pairs.

Knowledge driven pre-trained form key mapping

A location associated with a user of a computing device and a prefix portion of an input string may be received as one or more successive characters of the input string are provided by the user via the computing device. A list of suggested items may be obtained based on a function of respective recommendation indicators and proximities of the items to the location in response to receiving the prefix portion, and based on partially traversing a character string search structure having a plurality of non-terminal nodes augmented with bound indicators associated with spatial regions. The list of suggested items and descriptive information associated with each suggested item may be returned to the user, in response to receiving the prefix portion, for rendering an image illustrating indicators associated with the list in a manner relative to the location, as the user provides each successive character of the input string.

Progressive spatial searching using augmented structures

Described herein are various technologies pertaining to performing an operation relative to tabular data based upon voice input. An ASR system includes a language model that is customized based upon content of the tabular data. The ASR system receives a voice signal that is representative of speech of a user. The ASR system creates a transcription of the voice signal based upon the ASR being customized with the content of the tabular data. The operation relative to the tabular data is performed based upon the transcription of the voice signal.

Performing an operation relative to tabular data based upon voice input

The techniques discussed herein leverage structure within data of a corpus to parse unstructured data to obtain structured data and/or to predict latent data that is related to the unstructured and/or structured data. In some examples, parsing and/or predicting can be conducted at varying levels of granularity. In some examples, parsing and/or predicting can be iteratively conducted to improve accuracy and/or to expose more hidden data.

Leveraging corporal data for data parsing and predicting

The present invention extends to methods, systems, and computer program products for computing features of structured data. Aspects of the invention include computing features of table components (e.g., of rows, columns, cells, etc.). Computed features can be used for ranking the table components. When aggregated, features for different components of a table can be used for ranking the table (e.g., a web table).

Computing features of structured data

The present invention extends to methods, systems, and computer program products for understanding tables for search. Aspects of the invention include identifying a subject tuple (e.g., a subject column) for a table, detecting a tuple header (e.g., a column header) using other tables, and detecting a tuple header (e.g., a column header) using a knowledge base. Implementations can be utilized in a structured data search system (SDSS) that indexes structured information, such as, tables in a relational database or html tables extracted from web pages. The SDSS allows users to search over the structured information (tables) using different mechanisms including keyword search and data finding data.

Understanding tables for search

The present invention extends to methods, systems, and computer program products for refining structured data indexes. Aspects of the invention include associating structured data, such as, for example, tables, with additional content. Additional content can include content outside the &#x3c;table&#x3e; and &#x3c;/table&#x3e; tags of a web table. Indexes for structured data (e.g., table indexes) can be refined based on the additional content to improve the relevance of providing parts of the structured data (e.g., parts of the table) in search results.

Refining structured data indexes

Various technologies that facilitate performance of a data finding data (DFD) search are described herein. A user specifies entities, for example, by entering the entities into a query field, selecting the entities from a computer-executable application, or the like. The user further specifies an attribute of the entities that is of interest. A query is constructed based upon the entities and the attribute, and a search for tables is performed based upon the entities and the attribute. Values of the attribute for the selected entities are identified in a table, and the values of the attribute are returned.

Retrieval of attribute values based upon identified entities

Concept expansion using tables, such as web tables, can return entities belonging to a concept based on an input of the concept and at least one seed entity that belongs to the concept. A concept expansion frontend can receive the concept and seed entity and provide them to a concept expansion framework. The concept expansion framework can expand the coverage of entities for concepts, including tail concepts, using tables by leveraging rich content signals corresponding to concept names. Such content signals can include content matching the concept that appear in captions, early headings, page titles, surrounding text, anchor text, and queries for which the page has been clicked. The concept expansion framework can use the structured entities in tables to infer exclusive tables. Such inference differs from previous label propagation methods and involves modeling a table-entity relationship. The table-entity relationship reduces semantic drift without using a reference ontology.

Concept expansion using tables

A processing unit can determine a first subset of a data set including data records selected based on measure values thereof. The processing unit can determine an index mapping a predicate to data records associated with that predicate and approximation values of the records. The processing unit can process a query against the first subset to provide a first result and a first accuracy value, determine that the first accuracy value does not satisfy an accuracy criterion, and process the query against the index. In some examples, the processing unit can process the query against a second subset including data records satisfying a predetermined predicate. In some examples, the processing unit can receive data records and determine the first subset. Data records can include respective measure values. Data records with higher measure values can occur in the first subset more frequently than data records with lower measure values.

Aggregate-query database system and processing

Techniques and constructs to facilitate semantic matching and automated annotation (SMA) of attributes can take entity names and a keyword describing an attribute associated with the named entities as input and leverage a corpus of data such as data from tables, which can include HTML web tables, to automatically populate values associated with the named entities for the attribute. The constructs enable accurate SMA of attributes, such as attributes that relate to the entity and include numeric values in a different unit than the query, in a different scale than the query, and/or reflecting a time different from that of the query. An entity augmentation application programming interface (API) may be used to accept queries that include numeric criteria, parameters, or arguments, including query attributes represented by numeric values, which may be in different units or scales, and attributes represented by numeric values that can vary by time.

Semantic matching and annotation of attributes

Techniques for using digital entity correlation to generate a composite knowledge graph from constituent graphs. In an aspect, digital attribute values associated with primary entities may be encoded into primitives, e.g., using a multi-resolution encoding scheme. A pairs graph may be constructed, based on seed pairs calculated from correlating encoded primitives, and further expanded to include subjects and objects of the seed pairs, as well as pairs connected to relationship entities. A similarity metric is computed for each candidate pair to determine whether a match exists. The similarity metric may be based on summing a weighted landing probability over all primitives associated directly or indirectly with each candidate pair. By incorporating primitive matches from not only the candidate pair but also from pairs surrounding the candidate pair, entity matching may be efficiently implemented on a holistic basis.

Techniques for digital entity correlation

Growing community of inventors

Redmond, WA, United States of America

Kaushik Chakrabarti