A method and system are provided. The method includes separating a predicate that specifies a set of events into a temporal part and a non-temporal part. The method further includes comparing the temporal part of the predicate against a predicate of a known window type. The method also includes determining whether the temporal part of the predicate matches the predicate of the known window type. The method additionally includes replacing (i) the non-temporal part of the predicate by a filter, and (ii) the temporal part of the predicate by an instance of the known window type, responsive to the temporal part of the temporal predicate matching the predicate of the known window type. The instance is parameterized with substitutions used to match the temporal part of the predicate to the predicate of the known window type.

Systems and methods are disclosed to implement a Boolean query evaluation system that allows clients to specify a latency constraint for evaluating Boolean queries. In embodiments, the system evaluates queries using data from multiple external data sources. If some data sources fail to return data in a timely fashion to satisfy the specified latency constraint, the system will evaluate the query using the data that it was able to obtain and generate a partial answer to the query—a partial true or a partial false. In embodiments, the query response may include a reason for the partial answer, and indicate the list of data sources that failed to provide timely results. In embodiments, the system may publish a table indicating different latency constraints specified for a category of queries and the types of answers returned for those queries. Clients may use the table select latency constraints for future queries.

A search engine optimizer which works independently and in parallel with a browser and search engine supercomputer to gather, analyze, and distill input information interactively. The optimizer reorganizes the input, and providing an optimized version as an output. The optimized version of the input (e.g. output) is sent to the search engine which responds to the end user with search results. The optimizer recognizes each request as a pattern and stores the pattern in an advanced Glyph format. This permits the optimizer to identify a left and ride side check mate combination required to achieve certitude.

Systems and methods of the present invention provide for one or more server computers communicatively coupled to a network and configured to: create a data table of characters, where each character in the data table is assigned a false Boolean value; for each character found in each domain name in a DNS file, update the Boolean value to true; receive a domain search request comprising a token and a TLD; generate candidate domain names using the token and the TLD; query the database to determine if any character in the domain name has the false Boolean value in the data table; and if so, remove the domain name from the candidate domain names.

Disclosed are systems and methods for improving interactions with and between computers in a search system supported by or configured with search servers, applications or platforms. The systems interact to identify and retrieve data across platforms, which data can be used to improve the quality of results data used in processing interactions between or among processors in such systems. The disclosed systems and methods provide a novel framework for automatically analyzing items, including real-world items and digital content items, in order to determine their attributes (e.g., characteristics, features, and the like), and based on the determined attributes, generating a user interface (UI) that displays the items and their respective attributes in an interactive, dynamically updatable and searchable multidimensional display.

A method for training system to perform text-based search among plurality of documents. The method including receiving starting document, having at least one reference-identifier associated with the document; selecting reference-text from starting document; generating search-string by using a plurality of keywords using at least one first machine learning algorithm and at least one search-operator using at least one second machine learning algorithm; performing search among plurality of documents using search-string to fetch set of relevant documents; deriving reference-identifier distribution, corresponding to the at least one reference-identifier associated with document, for the set of relevant documents; and corelating at least one reference-identifier associated with starting document with reference-identifier distribution to determine performance-score for system. The steps of method are iteratively performed until performance-score exceeds a predetermined threshold, wherein at each iteration at least one of: different search-string is generated, different reference-text is obtained, different document is received.

A Codex system of computers linked into a neural network continuously scans and gathers information from, understands, and interacts with, an environment, an optimizer software executing software instructions based on rules of grammar and semantics searches a encyclopedia of human knowledge to transform input into a search pattern. Then the Codex monetizes and commercializes each transformed input and corresponding optimal output. An artificial intelligence interaction software, hereinafter referred to as virtual maestro, uses the search pattern and optimal output to interact and engage scripted communication with the end user.

Methods, systems, and devices for dynamic response entry are disclosed herein. In some embodiments, a dynamic response entry system can include a user device that can be a proctor device or a testee device. The testee device can display a list to a testee for a predetermined time period. After the passing of the predetermined time period, the displaying of the list to the testee can be terminated. The testee can provide response to one or several questions, which responses can be input into the proctor device. The input responses can be evaluated and categorized and displayed according to the evaluation and categorization.

A method, computer program product, and system for enhancing dynamically enhancing query results. A processor(s) obtains an inquiry from a user and determines response types and condition elements, to use to determine the unique response type of the inquiry. The processor(s) generates, per type, a response form of slot(s) for condition elements. The processor(s) utilizes the response forms to generate a sum of products expression which it transforms into a product of sums expression. The processor(s) utilizes a first sum term to generate a prompt for a further question to the user. The processor(s) obtains data responsive to the question and interprets the data into condition primitive(s). The processor(s) identifies sum terms comprising the interpreted condition primitive(s), based on comparing the interpreted condition primitive(s) to the condition elements of each sum term. If deleting the sum terms renders the expression empty, the processor(s) identifies the unique response type.

Aspects of the invention are configured to perform an operation comprising receiving a query specifying an AND condition and an OR condition, determining, based on an AND index structure, a set of documents, of a plurality of documents in a corpus, satisfying the AND condition of the query, computing a query similarity score for a first document in the set of documents, wherein the query similarity score is based on a first hash value computed for the OR condition of the query, a weight value for the OR condition, and a second hash value for the first document specified in an OR index, and returning an indication of the first document and the query similarity score as responsive to the query.