G06F16/316

REDUCING MATCHING DOCUMENTS FOR A SEARCH QUERY

The technology described herein provides for identifying matching documents for a search query using a bit vector search index. When a search query is received, a term is identified from the search index, and a number of bit vectors corresponding to the term are identified. Each bit vector comprises an array of bits in which at least one bit in each bit vector indicates that a corresponding document includes the term. Each bit vector also includes other bits indicating other documents include other terms. A determination is made that an unacceptable number of possible matching documents is likely to be returned. In response to the determination, a strengthening row bit vector is selected to reduce the number of possible matching documents. The identified bit vectors and the selected strengthening row are intersected to identify matching documents that contain the term.

Health care system
11495335 · 2022-11-08 · ·

A health care system includes a server to provide a service to care for a health state of each user, and a terminal of each user. The server registers and manages user information containing at least attribute information of the user, health information, or action information as share information of a group of users in response to an operation from the terminal of the user, checks similarity between the users in the share information, determines a similar user of each of the users, and outputs share information of the similar user of the user to the terminal of the user on the basis of the check information. The health information contains time series data of one element of measurement items containing a body temperature of the user, menstruation, examination results, medication, or symptoms. The action information contains time series data of one of actions or arbitrary texts.

Determining the schema of a graph dataset

A schema for a dataset is identified by identifying a dataset comprising data and relationships between data pairs. An original schema is identified for the dataset. This original schema comprises an organizational structure. An initial fit between the dataset and the original schema is determined. The initial fit quantifying a conformity of the data in the dataset to the organizational structure of the original schema. A plurality of additional schemas are identified. Each additional schema is a distinct organizational schema. The dataset is partitioned into a plurality of subsets. Each subset comprises a modified fit quantifying a modified conformity of subset data in each subset to one of the original schema and the additional schemas. The modified fit is greater than the original fit.

Machine learning worker node architecture

A database contains a corpus of incident reports, a machine learning (ML) model trained to calculate paragraph vectors of the incident reports, and a look-up set table that contains a list of paragraph vectors respectively associated with sets of the incident reports. A plurality of ML worker nodes each store the look-up set table and are configured to execute the ML model. An update thread is configured to: determine that the look-up set table has expired; update the look-up set table by: (i) adding a first set of incident reports received since a most recent update of the look-up set table, and (ii) removing a second set of incident reports containing timestamps that are no longer within a sliding time window; store, in the database, the look-up set table as updated; and transmit, to the ML worker nodes, respective indications that the look-up set table has been updated.

CODE PAGE TRACKING AND USE FOR INDEXING AND SEARCHING
20230102594 · 2023-03-30 ·

A processor may determine indexing information for indexing a document. The indexing information may comprise at least one index extracted from the document. The processor may identify at least one code page associated with the document. The processor may store the indexing information in association with code page information indicating the at least one code page. In response to a search query, the processor may determine a relevance degree between the document and the search query based on the indexing information and the code page information.

FINANCIAL DOCUMENTS EXAMINATION METHODS AND SYSTEMS

A user is able to extract financial data, particularly tables, from a document. The table is stored and the user can compare the data in this table with data from similar tables from previous documents. The user can see how financial data has changed historically by looking only at financial tables from the same type of document, for example, only balance sheet tables from annual reports for a specific public company, over many years, and see how the values have changed or whether any new categories or types of data have been added or deleted. From the time series of financial data, the user can gain real intelligence into an entity’s financial health.

CREATING ACTION-TRIGGER PHRASE SETS

A method of creating action-trigger phrase sets includes receiving a document from a corpus of documents; processing text from the document; and creating an action-trigger phrase set from the text.

MULTI-FORMAT CONTENT REPOSITORY SEARCH

An audio file format of an audio portion of a natural language content is determined. Using a trained audio language identification model, a human language included in the audio portion is identified. Using a trained audio to text model trained on the human language, the audio portion is converted to a corresponding set of text data. The set of text data is indexed. Using the indexed set of text data responsive to a search query, a search result is generated, the search query specifying a search including a non-textual portion of the natural language content.

Method and Computing Device in which Semantic Definitions are Composed as a Semantic Metaset
20230069957 · 2023-03-09 ·

The present application discloses a method of representing semantic definitions on a computing device. Semantic definition statements are composed using operators. The semantic definition statements include semantic concept statements using semantic concept operators and semantic context statements using semantic context operators. The semantic definition statements are saved in a metaset. The metaset is converted into a digital data structure and stored in a memory storage device of a computing device. The present application further discloses a method of semantically searching for a visual using a metaset.

Methods and systems for building a search service application

A system for providing a search service is disclosed and includes a processor-based search service application builder component that provides a search model representing a search service application for a first object of a plurality of objects. The search model is based at least on a user-defined end-user input field corresponding to a first attribute of a plurality of attributes associated with the first object and a user-defined search result output field corresponding to a second attribute of the plurality of attributes. The search model is also associated with a backend data store that supports a storage structure configured to store information relating to the first object. The system also includes a processor-based deployment engine that automatically configures a search engine system associated with the backend data store system to generate and/or update search index(es) based on at least one of the first attribute and the second attribute.