Patent application number | Description | Published |
20080228468 | English-Language Translation Of Exact Interpretations of Keyword Queries - The present invention relates to a methodology to translate exact interpretations of keyword queries into meaningful and grammatically correct plain-language queries in order to convey the meaning of these interpretations to the initiator of the search. The method includes the steps of generating at least one grammatically valid plain-language sentence interpretation for a keyword query from a generated sentence plain-language sentence clauses, wherein the grammatically valid plain-language sentence is based upon differing matching elements, and presenting at least one grammatically valid plain-language sentence interpretation for the keyword query to a keyword query system user for the user's review. | 09-18-2008 |
20090070327 | METHOD FOR AUTOMATICALLY GENERATING REGULAR EXPRESSIONS FOR RELAXED MATCHING OF TEXT PATTERNS - A method for automatically generating regular expressions for relaxed matching of text patterns. A received input phrase expressed in a natural language is determined to be a plain text pattern. The plain text pattern is automatically tokenized, thereby generating a first token list. Rules loaded from a predefined rule set are automatically applied to the first token list in an order specified by the predefined rule set to automatically modify a token list by applying a replace word, split-at-character or whitespace operator. The modified token list is automatically converted into a regular expression that matches the plain text pattern and one or more variations of the plain text pattern. A utilization of the regular expression for an information extraction facilitates a recall and a precision of the information extraction. | 03-12-2009 |
20090070328 | METHOD AND SYSTEM FOR AUTOMATICALLY GENERATING REGULAR EXPRESSIONS FOR RELAXED MATCHING OF TEXT PATTERNS - A method and system for automatically generating regular expressions for relaxed matching of text patterns. A received input phrase expressed in a natural language is determined to be a plain text pattern. The plain text pattern is automatically tokenized, thereby generating a first token list. Rules loaded from a predefined rule set are automatically applied to the first token list to automatically generate a modified token list. The order of the rules being applied to the first token list is specified by the rule set. The modified token list is automatically converted into a regular expression that matches the plain text pattern and one or more variations of the plain text pattern. A utilization of the regular expression for an information extraction facilitates a recall and a precision of the information extraction. | 03-12-2009 |
20100174718 | Indexing for Regular Expressions in Text-Centric Applications - A method, system, and article are provided for evaluating regular expressions over large data collections. A general purpose index is built to handle complex regular expressions at the character level. Characters, character classes, and associated metadata are identified and stored in an index of a collection of documents. Given a regular expression, a query is generated based on the contents of the index. This query is executed over the index to identify a set of documents in the collection of documents over which the regular expression can be evaluated. Based upon the query execution, the identified set of documents is returned for evaluation by the regular expression responsive to execution of the query over the index. | 07-08-2010 |
20100205201 | User-Guided Regular Expression Learning - A method, device, and computer program product are provided for regular expression learning is provided. An initial regular expression may be received from a user. The initial regular expression is executed over a database. Positive matches and negative matches are labeled. The initial regular expression and the labeled positive and negative matches are input in a transformation process. The transformation process may iteratively execute character class restrictions, quantifier restrictions, negative lookaheads on the initial regular expression to transform the initial regular expression into the pool of candidate regular expressions. The transformation process may execute, one at a time, the character class restrictions, quantifier restrictions, the negative lookaheads. A candidate regular expression is selected from the pool of candidate regular expressions, where the selected candidate regular expression has a best F-Measure out of the pool of candidate regular expressions. | 08-12-2010 |
20120310948 | Indexing for Regular Expressions in Text-Centric Applications - A method, system, and article are provided for evaluating regular expressions over large data collections. A general purpose index is built to handle complex regular expressions at the character level. Characters, character classes, and associated metadata are identified and stored in an index of a collection of documents. Given a regular expression, a query is generated based on the contents of the index. This query is executed over the index to identify a set of documents in the collection of documents over which the regular expression can be evaluated. Based upon the query execution, the identified set of documents is returned for evaluation by the regular expression responsive to execution of the query over the index. | 12-06-2012 |
20150039290 | KNOWLEDGE-RICH AUTOMATIC TERM DISAMBIGUATION - Embodiments of the invention relate to ambiguity detection. In one embodiment, an object and a topical domain associated with the object are obtained. In this embodiment, the object includes at least one term. At least one of a plurality of information sources is analyzed based on the at least one term and the topical domain. A determination is made that object is one of ambiguous and unambiguous based on analyzing at least one of the plurality of information sources. | 02-05-2015 |
Patent application number | Description | Published |
20080215299 | Asynchronous Hidden Markov Model Method and System - A system, method and program storage device implementing a method for modeling a data generating process, wherein the modeling comprises observing a data sequence comprising irregularly sampled data, obtaining an observation sequence based on the observed data sequence, assigning a time index sequence to the data sequence, obtaining a hidden state sequence of the data sequence, and decoding the data sequence based on a combination of the time index sequence and the hidden state sequence to model the data sequence. The method further comprises assigning a probability distribution over time stamp values of the observation sequence, wherein the decoding comprises using a Hidden Markov Model. The method further comprises using an expectation maximization methodology to learn the Hidden Markov Model. | 09-04-2008 |
20090049021 | SYSTEM AND METHOD FOR STORING TEXT ANNOTATIONS WITH ASSOCIATED TYPE INFORMATION IN A STRUCTURED DATA STORE - A text annotation structured storage system stores text annotations with associated type information in a structured data store. The present system persists or stores annotations in a structured data store in an indexable and queryable format. Exemplary structured data stores comprise XML databases and relational databases. The system exploits type information in a type system to develop corresponding schemas in a structured data model. The system comprises techniques for mapping annotations to an XML data model and a relational data model. The system captures various features of the type system, such as complex types and inheritance, in the schema for the persistent store. In particular, the repository provides support for path navigation over the hierarchical type system starting at any type. | 02-19-2009 |
20090192987 | SEARCHING NAVIGATIONAL PAGES IN AN INTRANET - Exemplary embodiments of the present invention relate to a method for searching navigational pages within an intranet environment. The method comprises identifying a plurality of navigational pages, performing a page-level analysis upon each identified navigational page in order to determine if a navigational page can be categorized as a candidate navigational page, performing a cross-page analysis upon each determined candidate navigational page in order to generate a final set of navigational pages, associating each final navigational page with a predetermined semantic classification group, generating term variants for each navigational page, building a navigational index for each semantic classification grouping, and filtering user queries in association with a user profile of a user that is posing a query. | 07-30-2009 |
20090198646 | SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR AN ALGEBRAIC APPROACH TO RULE-BASED INFORMATION EXTRACTION - Systems, methods and computer program products for an algebraic approach to rule-based information extraction. Exemplary embodiments include a method for rule-based information extraction, the method including specifying an annotator using algebraic operators, wherein each algebraic operator describes annotations identification from text documents. | 08-06-2009 |
20120226639 | Systems and Methods for Processing Machine Learning Algorithms in a MapReduce Environment - Systems and methods for processing Machine Learning (ML) algorithms in a MapReduce environment are described. In one embodiment of a method, the method includes receiving a ML algorithm to be executed in the MapReduce environment. The method further includes parsing the ML algorithm into a plurality of statement blocks in a sequence, wherein each statement block comprises a plurality of basic operations (hops). The method also includes automatically determining an execution plan for each statement block, wherein at least one of the execution plans comprises one or more low-level operations (lops). The method further includes implementing the execution plans in the sequence of the plurality of the statement blocks. | 09-06-2012 |
20140129211 | SVO-BASED TAXONOMY-DRIVEN TEXT ANALYTICS - Organizing textual data into statement clusters. Sentences are extracted from textual data and parsed. A verb usage pattern is identified and an SVO triplet is determined. The SVO triplet is compared to a taxonomy associated with the domain of the data and a sentiment is derived. A statement cluster is constructed comprising a higher level SVO triplet sensitive to the taxonomy and verb usage pattern, as well as the derived sentiment. Accordingly, the statement clusters may be organized by grouping. | 05-08-2014 |
20140129213 | SVO-BASED TAXONOMY-DRIVEN TEXT ANALYTICS - Organizing textual data into statement clusters. Sentences are extracted from textual data and parsed. A verb usage pattern is identified and an SVO triplet is determined. The SVO triplet is compared to a taxonomy associated with the domain of the data and a sentiment is derived. A statement cluster is constructed comprising a higher level SVO triplet sensitive to the taxonomy and verb usage pattern, as well as the derived sentiment. Accordingly, the statement clusters may be organized by grouping. | 05-08-2014 |
20150051900 | UNSUPERVISED LEARNING OF DEEP PATTERNS FOR SEMANTIC PARSING - Using exemplary sentences, usage patterns and thematic roles ascribed in VerbNet to generate “deep pattern trees” for the exemplary sentences. Then, when an arbitrary natural language subject sentence is input, these deep pattern trees can be matched to the natural language subject sentence in order to assign thematic roles to at least some of the “grammatical portions” of the natural language subject sentence. | 02-19-2015 |