G06F16/3349

Entity-centric knowledge discovery

A user interface of an entity-centric knowledge discovery system presents an entity profile including a mix of structured and unstructured data relating to an entity. As a user refines the entity profile based on information gathered from various sources, the changing entity profile can be used as a substantially continuously updating query to search, retrieve, and rank new and pertinent information specifically relevant to the profiled entity. The platform described herein provide an active loop for refining an entity description and searching for additional information in which human input and machine-based algorithms can cooperate to more quickly build a comprehensive description of an entity of interest.

REDUCING CPU CONSUMPTION IN A FEDERATED SEARCH
20220237187 · 2022-07-28 ·

Techniques for reducing CPU consumption in a federated search are disclosed. In some example embodiments, a computer-implemented method comprises determining an initial search scope by selecting a subset of searchable resources from a plurality of searchable resources based on interaction data of a user, with the initial search scope being defined by the selected subset of searchable resources, and the interaction data indicating online activity of the user directed towards past search results of past search queries submitted by the user. A federated search for a current search query is then performed using the initial search scope, with the federated search for the current search query being restricted to only the subset of searchable resources, and current search results for the current search query are generated based on the performing of the federated search.

Systems and methods for fuzzy search without full text
11386101 · 2022-07-12 · ·

Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

Discriminating ambiguous expressions to enhance user experience

Methods and systems are provided for discriminating ambiguous expressions to enhance user experience. For example, a natural language expression may be received by a speech recognition component. The natural language expression may include at least one of words, terms, and phrases of text. A dialog hypothesis set from the natural language expression may be created by using contextual information. In some cases, the dialog hypothesis set has at least two dialog hypotheses. A plurality of dialog responses may be generated for the dialog hypothesis set. The dialog hypothesis set may be ranked based on an analysis of the plurality of the dialog responses. An action may be performed based on ranking the dialog hypothesis set.

QUERY CORRECTION BASED ON REATTEMPTS LEARNING
20220318283 · 2022-10-06 ·

Systems and methods are described to access a set of reattempt query pairs, where each respective pair comprises an initial query and a reattempt of the initial query, and is associated with an indication of whether a reply generated for output based on the respective query pair was acceptable. In response to determining that a second query received after a first query constitutes a reattempt of the first query, a query pair in the set of reattempt query pairs may be identified that matches at least one of the first query and the second query, and is associated with an indication that a reply generated for output based on the query pair was acceptable. A search may be performed based on the identified query pair in the set of reattempt query pairs, and a reply may be generated for output based on the performed search.

SMART CONTRACT GENERATION SYSTEM AND METHODS

A system for generating smart contracts may include a first subsystem to receive a written or verbal contract, and a second subsystem to identify terms of the contract using natural language processing (NLP). The system may additionally include a third subsystem to correlate processed NLP terms of the contract with chaincode in a library, and a fourth subsystem to combine correlated NLP terms to generate a smart contract. Methods of generating a smart contract may include inputting natural language contract terms into a smart contract generation system and identifying the natural language contract terms with a natural language processing system. The method may further include correlating at least some of the contract terms to chaincodes stored in a library, generating chaincodes for any contract terms that do not correlate to any chaincodes stored in the library, and assembling the chaincodes into a smart contract.

Query acceleration data store
11416528 · 2022-08-16 · ·

Systems and methods for a data index and query system that utilize a query acceleration data store. An example method includes receiving a query identifying a set of data to be processed and a manner of processing the set of data. A query processing scheme for obtaining and processing the set of data is defined. First partial results of the query stored in a data store are identified, with the first partial results corresponding to a first portion of the set of data. One or more partitions are dynamically allocated to obtain a second portion of the set of data from different data sources. The second portion of the set of data is processed to obtain second partial results. The first partial results and second partial results are combined. The query is executed based on the query processing scheme.

METHOD AND SYSTEM FOR DEFINING AN OBJECT-AGNOSTIC OFFLINABLE SYNCHRONIZATION MODEL

Some embodiments optimize a local, pending transaction queue of transactions locally executed by a client application to be synchronized with a server. Multiple transactions, which may be executed by the client application for a same local object, need to be synchronized with a server. The transactions, in queue for synchronization with the server, may include transactions to add, delete, or modify objects. Each set of transactions for a particular object in queue for synchronization with the server corresponds to a particular net effect on the server if synchronized individually to the server. The client application may replace the set of transactions for the particular object with a reduced set of transactions corresponding to the net effect, or entirely removed without replacement if there is no net effect of the set of transactions on the server.

QUERY-AS-A-SERVICE SYSTEM THAT PROVIDES QUERY-RESULT DATA TO REMOTE CLIENTS

The current document is directed to a query-as-a-service system (“QAAS system”) that collects enormous volumes of data from network-connected entities, referred to as “Things” in the phrase “Internet of Things,” persistently stores the collected data and provides a distributed-query-execution engine that allows remote clients to continuously execute queries against the collected data. In a described implementation, both the raw data and query results are persistently stored in the QAAS system, with the raw data stored for significantly longer periods of time. Query results generated by the query-processing engine are securely transmitted to QAAS remote clients for distribution to file systems, storage

Method and system for defining an object-agnostic offlinable synchronization model

Some embodiments optimize a local, pending transaction queue of transactions locally executed by a client application to be synchronized with a server. Multiple transactions, which may be executed by the client application for a same local object, need to be synchronized with a server. The transactions, in queue for synchronization with the server, may include transactions to add, delete, or modify objects. Each set of transactions for a particular object in queue for synchronization with the server corresponds to a particular net effect on the server if synchronized individually to the server. The client application may replace the set of transactions for the particular object with a reduced set of transactions corresponding to the net effect, or entirely removed without replacement if there is no net effect of the set of transactions on the server.