492 results about "Substring" patented technology

Systems and methods to generate modified / refined user inputs based on the original user input, such as a search query, are disclosed. The method may be implemented for Roman-based and / or non-Roman based language such as Chinese. The method may generally include receiving an original user input and identifying core terms therein, determining potential alternative inputs by replacing core term(s) in the original input with another term according to a similarity matrix and / or substituting a word sequence in the original input with another word sequence according to an expansion / contraction table where one word sequence is a substring of the other, computing likelihood of each potential alternative input, and selecting most likely alternative inputs according to a predetermined criteria, e.g., likelihood of the alternative input being at least that of the original input. A cache containing pre-computed original user inputs and corresponding alternative inputs may be provided.

In particular, this invention provides novel methods of populating data structures for use in evolutionary modeling. In particular, this invention provides methods of populating a data structure with a plurality of character strings. The methods involve encoding two or more a biological molecules into character strings to provide a collection of two or more different initial character strings; selecting at least two substrings from the pool of character strings; concatenating the substrings to form one or more product strings about the same length as one or more of the initial character strings; adding the product strings to a collection of strings; and optionally repeating this process using one or more of the product strings as an initial string in the collection of initial character strings.

An apparatus and method for performing similarity searching on a data stream with respect to a query string are disclosed, where the data stream comprises a plurality of data substrings, and where the query string comprises a plurality of query substrings. A programmable logic device is used to filter the data stream to find a plurality of possible matches between the data substrings and a plurality of the query substrings, wherein the data substrings and the query substrings comprise a plurality of characters. From these possible matches, a determination can be made as to a similarity between the query string and at least a portion of the data stream.

Disclosed is a system, method, and program for determining boundaries in a string of characters using a dictionary, wherein the substrings in the dictionary may comprise words. A determination is made of all possible initial substrings of the string in the dictionary. One initial substring is selected such that all the characters following the initial substring can be divided into at least one substring in the dictionary. The boundaries follow each of the initial substring and the at least one substring that includes all the characters following the initial substring.

A system and method for performing biological sequence similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of biological sequence data strings and a plurality of substrings of a query string. The pipeline may further include a ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the biological sequence data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.

A method and system are provided for identifying a television content item desired by a television viewer from a set of television content items. Each of the television content items has one or more associated descriptors. The system receives from the television viewer a reduced text search entry directed at identifying the desired television content item. The search entry is a prefix substring of one or more words relating to the desired television content item. The system dynamically identifies a group of one or more television content items from the set of television content items having one or more descriptors matching the search entry as the television viewer enters each character of the search entry. The system then transmits the names of the one or more television content items of the identified group to be displayed on a device operated by the television viewer.

A method and apparatus is provided for extracting key terms from a data set, the method includes identifying a first set of one or more word groups of one or more word that occur more than once in the data set, and removing from this first set a second set of word groups that are sub-strings of longer word groups in the first set. The remaining word groups are key terms. Each word group is weighted according to its frequency of occurrence within the data set. The weighting of any word group may be increased by the frequency of any sub-string of words occurring in the second set and then dividing each weighting by the number of words in the word group. This weighting process operates to determine the order of occurrence of the word groups. Prefixes and suffixes are also removed from each word in the data set. This produces a neutral form of each word so that the weighting values are prefix and suffix independent.

Improved method, data structure and computer readable medium for searching for digital information files. Files referenced by URLs may be quickly located by finding a minimum unique prefix for the desired URL, breaking the prefix into substrings, and traversing a trie data structure to find indices to another trie data structure that will yield the physical location of the stored digital information file. A node data structure may be used to construct the trie data structures, and may be compressed to allow the tries to occupy less memory, thus allowing the tries to be maintained in memory and less access to storage devices. The result is faster retrieval times for digital information files.

A method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has a name including one or more words. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query comprises a prefix substring of at least one word in the name of the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more words in the names thereof matching the search query as the user enters each character of the search query. The system also orders the one or more items of the group in accordance with given criteria. The names of the one or more items of the identified group are output to be displayed on the device operated by the user as ordered with the characters of the one or more words in the names corresponding to the prefix substring of the search query being highlighted.

A method for distributed tokenization of sensitive strings of characters, such as social security numbers, credit card numbers and the like, in a local server is disclosed. The method comprises the steps of receiving from a central server at least one, and preferably at least two, static token lookup tables, and receiving a sensitive string of characters. In a first tokenization step, a first substring of characters is substituted with a corresponding first token from the token lookup table(s) to form a first tokenized string of characters, wherein the first substring of characters is a substring of the sensitive string of characters. Thereafter, in a second step of tokenization, a second substring of characters is substituted with a corresponding second token from the token lookup table(s) to form a second tokenized string of characters, wherein the second substring of characters is a substring of the first tokenized string of characters. Optionally, one or more additional tokenization steps is / are used.

A method and system for use in a natural language understanding system for including grammars within a statistical parser. The method involves a series of steps. The invention receives a text input. The invention applies a first context free grammar to the text input to determine substrings and corresponding parse trees, wherein the substrings and corresponding parse trees further correspond to the first context free grammar. Additionally, the invention can examine each possible substring using an inventory of queries corresponding to the CFG.

A training model for malware detection is developed using common substrings extracted from known malware samples. The probability of each substring occurring within a malware family is determined and a decision tree is constructed using the substrings. An enterprise server receives indications from client machines that a particular file is suspected of being malware. The suspect file is retrieved and the decision tree is walked using the suspect file. A leaf node is reached that identifies a particular common substring, a byte offset within the suspect file at which it is likely that the common substring begins, and a probability distribution that the common substring appears in a number of malware families. A hash value of the common substring is compared (exact or approximate) against the corresponding substring in the suspect file. If positive, a result is returned to the enterprise server indicating the probability that the suspect file is a member of a particular malware family.

A system generates an output of documents having with a particular relevance range. The system receives an initial document comprising text, a list of documents for matching, each document comprising text, and a minimum substring match length. The system normalizes the text of the documents of the list of documents. The system searches common sub-strings between the text of the initial document and the text of each document of the list of documents. The system calculates a match percentage based on the search common sub-strings and outputs documents having a match percentage corresponding to a predetermined value. Also disclosed is a process for generating an output of documents within a particular relevance range.

Systems and processes are disclosed for handling a multi-part voice command for a virtual assistant. Speech input can be received from a user that includes multiple actionable commands within a single utterance. A text string can be generated from the speech input using a speech transcription process. The text string can be parsed into multiple candidate substrings based on domain keywords, imperative verbs, predetermined substring lengths, or the like. For each candidate substring, a probability can be determined indicating whether the candidate substring corresponds to an actionable command. Such probabilities can be determined based on semantic coherence, similarity to user request templates, querying services to determine manageability, or the like. If the probabilities exceed a threshold, the user intent of each substring can be determined, processes associated with the user intents can be executed, and an acknowledgment can be provided to the user.

A server machine receives an input string of characters from a client machine, and the string includes at least one abbreviated substring preceded and followed by word delimiters. Each abbreviated substring represents an expanded substring. The server machine automatically finds one of the abbreviated substrings based on the preceding and following word delimiters, determines that it is one of a set of abbreviated substrings, and produces an expanded version of the string of characters with the abbreviated substring replaced by its expanded substring. The case of the beginning character of the expanded substring can be the same as that of the abbreviated substring. The expanded substring can depend on time, such as the current time.

To help ensure high data quality, data warehouses validate and clean, if needed incoming data tuples from external sources. In many situations, input tuples or portions of input tuples must match acceptable tuples in a reference table. For example, product name and description fields in a sales record from a distributor must match the pre-recorded name and description fields in a product reference relation. A disclosed system implements an efficient and accurate approximate or fuzzy match operation that can effectively clean an incoming tuple if it fails to match exactly with any of the multiple tuples in the reference relation. A disclosed similarity function that utilizes token substrings referred to as q-grams overcomes limitations of prior art similarity functions while efficiently performing a fuzzy match process.

A method and apparatus are disclosed for determining the lengths of one or more substrings of an input string that matches a regular expression (regex) The input string is searched for the regex using an non-deterministic finite automaton (NFA), and upon detecting a match state a selected portion of the input string is marked as a match string. The NFA is inverted to create a reverse NFA that embodies the inverse of the regex. For some embodiments, the reverse NFA is created by inverting the NFA such that the match state of the NFA becomes the initial state of the reverse NFA, the initial state of the NFA becomes the match state of the reverse NFA, and the goto transitions of the NFA are inverted to form corresponding goto transitions in the reverse NFA. The match string is reversed and searched for the inverted regex using the reverse NFA, and a counter is incremented for each character processed during the reverse search operation. The current value of the counter each time the match state in the reverse NFA is reached indicates the character length of a corresponding substring that matches the regex.

Mechanisms for operating a prover device and a verifier device so that the verifier device can verify the authenticity of the prover device. The prover device generates a data string by: (a) submitting a challenge to a physical unclonable function (PUF) to obtain a response string, (b) selecting a substring from the response string, (c) injecting the selected substring into the data string, and (d) injecting random bits into bit positions of the data string not assigned to the selected substring. The verifier: (e) generates an estimated response string by evaluating a computational model of the PUF based on the challenge; (f) performs a search process to identify the selected substring within the data string using the estimated response string; and (g) determines whether the prover device is authentic based on a measure of similarity between the identified substring and a corresponding substring of the estimated response string.

A method and system for a search engine for user generated content have been disclosed. According to one embodiment, a computer implemented method comprises receiving a search request from a client, the search request directed to user generated content. Relevant user generated content is retrieved, wherein retrieving comprises searching processed user generated content, and wherein processing user generated content comprises receiving first input data including text, creating a substring of text from the first input data and categorizing the substring to produce a concept associated with the substring, wherein the substring is categorized according to one of dictionaries or pattern analysis. An indication of sentiment is assigned to the concept associated with the substring and an indication of influence is assigned to the concept associated with the substring. The relevant user generated content is displayed.

The inventive technology, in certain embodiments, may be generally described as a solar power generation system with a converter, which may potentially include two or more sub-converters, established intermediately of one or more strings of solar panels. Particular embodiments may involve sweet spot operation in order to achieve improvements in efficiency, and bucking of open circuit voltages by the converter in order that more panels may be placed on an individual string or substring, reducing the number of strings required for a given design, and achieving overall system and array manufacture savings.

When it accepts an input sentence, the present apparatus divides the input sentence into substrings through morpheme analysis and obtains a candidate word group for translation of the substrings from a machine translation dictionary. It then obtains information on occurrence of each candidate word in the candidate word group within a bilingual example sentence database and calculates their priorities based on the occurrence information. Then, it grants priority as translation to each of the candidate words to generate a prioritized candidate word group and sorts the candidate words in descending order of priority for output.

Approximate substring indexing is accomplished by decomposing each string in a database into overlapping “positional q-grams”, sequences of a predetermined length q, and containing information regarding the “position” of each q-gram within the string (i.e., 1st q-gram, 4th q-gram, etc.). An index is then formed of the tuples of the positional q-gram data (such as, for example, a B-tree index or a hash index). Each query applied to the database is similarly parsed into a plurality of positional q-grams (of the same length), and a candidate set of matches is found. Position-directed filtering is used to remove the candidates which have the q-grams in the wrong order and / or too far apart to form a “verified” output of matching candidates. If errors are permitted (defined in terms of an edit distance between each candidate and the query), an edit distance calculation can then be performed to produce the final set of matching strings.

Techniques are provided for generating a hash value for searching for substrings in a data stream without reading more than one element (e.g. one byte) at a time. According to one technique, a before a next element is added to an old hash value, the old hash value is circularly shifted one or more bits. The first original element is shifted a number of bits and XOR'ed against the old hash value. The next element is added to the old hash value. In one embodiment, an entry value is retrieved for each element from an index table and the XOR and shift operations are performed on the entry values. According to another technique, each Linear Feedback Shift Register (LFSR) of a plurality of LFSRs read in one element at a time beginning at different offsets. Each LFSR uses the same state machine. The result of reading a number of elements into an LFSR is used as the hash value.

In a method of forming a target error model to facilitate correcting or suggesting corrections to misspelled input text related to a target data collection, a source query log containing user queries to at least one source data collection is provided. Next, target relational data is generated based on the source query log including corrective substring suggestions that relate to the target data collection and corresponding misspelled substrings extracted from the source query log. A target error model is then built using the target relational data. The target error model includes target statistical occurrence data for the substrings of the target relational data derived from the source query log. Finally, the target error model is stored on a computer readable medium. Additional embodiments of the invention are directed to a system configured to implement the method.

The invention discloses a keyword based evaluation expert intelligent search and recommendation method. The keyword based evaluation expert intelligent search and recommendation method specifically comprises step 1, segmenting an expert information main text into substring sequences, performing ICTCLAS word segmentation of Chinese academy of sciences and performing stop word filtering on the result of the word segmentation to obtain the word collection; step 2, extracting feature words of the expert information according to fields; step 3, building an expert knowledge representation model based on the fields and the weight of the feature words and establishing an expert information index database; step 4, performing automatic prompting according to a search term thesaurus when a user inputs keywords and meanwhile performing real-time update on the search term thesaurus through a search term counter; step 5, calculating the search relevance between the keywords and the expert information based on the semantic information and the like; step 6, listing relevant experts from high to low according to the matching degree. According to the keyword based evaluation expert intelligent search and recommendation method, the intelligent full-text search and recommendation of the expert information can be achieved through the keyword input and accordingly the experts which are matched with a pended science and technology project can be searched out accurately.

A method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has a name including one or more words. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query comprises a prefix substring of at least one word in the name of the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more words in the names thereof matching the search query as the user enters each character of the search query. The system also orders the one or more items of the group in accordance with given criteria. The names of the one or more items of the identified group are output to be displayed on the device operated by the user as ordered with the characters of the one or more words in the names corresponding to the prefix substring of the search query being highlighted.