3001 results about "Parsing" patented technology

A system and methods for organizing and querying data within a linear grid management system. Data having multiple dimensions is associated with physical locations, where a first dimension is associated with a node and a second dimension is associated with a data storage identifier of a memory storage device. The data may have a third dimension which provides a field for ordering data within the memory storage device. Metadata may be used to map a logical table to data stored in the memory storage device. The data query may be divided into multiple subqueries, wherein each subquery is related directly to one node associated with a data storage identifier related to a memory storage device. A preSQL and postSQL process may be generated to access an external database. A dispatcher may manage data subrequests and a node may generate a unique and efficient parsing process from the received data subrequest.

An intelligent home automation system answers questions of a user speaking “natural language” located in a home. The system is connected to, and may carry out the user's commands to control, any circuit, object, or system in the home. The system can answer questions by accessing the Internet. Using a transducer that “hears” human pulses, the system may be able to identify, announce and keep track of anyone entering or staying in the home or participating in a conversation, including announcing their identity in advance. The system may interrupt a conversation to implement specific commands and resume the conversation after implementation. The system may have extensible memory structures for term, phrase, relation and knowledge, question answering routines and a parser analyzer that uses transformational grammar and a modified three hypothesis analysis. The parser analyzer can be dormant unless spoken to. The system has emergency modes for prioritization of commands.

In language evaluation systems, user expressions are often evaluated by speech recognizers and language parsers, and among several possible translations, a highest-probability translation is selected and added to a dialogue sequence. However, such systems may exhibit inadequacies by discarding alternative translations that may initially exhibit a lower probability, but that may have a higher probability when evaluated in the full context of the dialogue, including subsequent expressions. Presented herein are techniques for communicating with a user by formulating a dialogue hypothesis set identifying hypothesis probabilities for a set of dialogue hypotheses, using generative and/or discriminative models, and repeatedly re-ranks the dialogue hypotheses based on subsequent expressions. Additionally, knowledge sources may inform a model-based with a pre-knowledge fetch that facilitates pruning of the hypothesis search space at an early stage, thereby enhancing the accuracy of language parsing while also reducing the latency of the expression evaluation and economizing computing resources.

A method of delivering advertising items to a client at a portable device is provided. A client ID is sent to a host server. A downloaded advertising item is produced relative to a product or service from the host server. The downloaded advertising item is parsed and stored. In response to the parsing and storing, displaying the advertising item is displayed to the client at the mobile device.

In the present invention, a textual document is syntactically analyzed and knowledge is constructed from a single word or plural words. The knowledge is then marked, from the broken down knowledge (represented by the underscores in FIG. 1) or from a part-of-speech, as a related object (node) or a relation (edge) (represented by ‘n’ or ‘e’ shown in FIG. 1). In other words, in the present invention a textual document is treated as knowledge constructed from a single word or plural words. The knowledge extracted from the textual document is structured to form a knowledge structure (such as a graph structure constituted from nodes and edges). At least one link can be established between each of the knowledge structure elements and a semantically closest concept entry in a hierarchical concept dictionary.

A programmable pattern matching engine efficiently parses the contents of network messages for regular expressions and executes pre-defined actions or treatments on those messages that match the regular expressions. The pattern matching engine is preferably a logic circuit designed to perform its pattern matching and execution functions at high speed, e.g., at multi-gigabit per second rates. It includes, among other things, a message buffer for storing the message being evaluated, a decoder circuit for decoding and executing corresponding actions or treatments, and one or more content-addressable memories (CAMs) that are programmed to store the regular expressions used to search the message. The CAM may be associated with a second memory device, such as a random access memory (RAM), as necessary, that is programmed to contain the respective actions or treatments to be applied to messages matching the corresponding CAM entries. The RAM provides its output to the decoder circuit, which, in response, decodes and executes the specified action or treatment.

The present invention provides a method for recognizing a named entity included in natural language, comprising the steps of: performing gradual parsing model training with the natural language to obtain a classification model; performing gradual parsing and recognition according to the obtained classification model to obtain information on positions and types of candidate named entities; performing a refusal recognition process for the candidate named entities; and generating a candidate named entity lattice from the refusal-recognition-processed candidate named entities, and searching for a optimal path. The present invention uses a one-class classifier to score or evaluate these results to obtain the most reliable beginning and end borders of the named entities on the basis of the forward and backward parsing and recognizing results obtained only by using the local features.

Intelligent message processing is provided for person to person (P2P) messaging by intercepting the message and processing the message before directing the message to the recipient. The messaging system then acts as a person to application (P2A) and application to person (A2P) system, wherein any P2P message can be intercepted and processed as necessary. Such functionality allows any desired processing of the message, such as to allow for transformation, charging, content filtering, screening, parsing, and any other such processing. Further, such an approach allows the message to be received from the sender and directed to the recipient on different channels. A messaging enabler allows the message to be processed using application logic and/or Web services, for example.

A system is provided for building a parser generator. The system includes a grammar input module for inputting in the parser generator a grammar expressed in a given formalism. A checking module formally verifies that a given grammar belongs to a predetermined class of grammars for which a translation to a correct, terminating parser is feasible. A checking module formally verifies that a grammar expressed in the formalism is well-formed. A semantic action module defines a parsing result depending on semantic actions embedded in the grammar. The semantic action module ensures in a formal way that all semantic actions of the grammar are terminating semantic actions. A formal module generates a parser with total correctness guarantees, using the modules to verify that the grammar is well-formed, belongs to a certain class of feasible, terminating grammars and all its semantic actions are terminating.

An architecture capable of stream parsing of the H.264 Content Based Adaptive Binary Arithmetic Coding (CABAC) format is disclosed. The architecture employs a two pass dataflow approach to implement the functions of CABAC bit parsing and decoding processes (based on the H.264 CABAC algorithm). The architecture can be implemented, for example, as a system-on-chip (SOC) for a video/audio decoder for use high definition television broadcasting (HDTV) applications. Other such video/audio decoder applications are enabled as well.

Techniques for parsing rule creation are provided. A technique for constructing one or more message parsing rules may comprise the following steps. First, message data representing past messages, for example, associated with a network, an application and/or a system being analyzed, is obtained. For example, this may involve reading the past or historical message data from messages logs or having a system point to the message data in existing data storage. Parsing rules are then generated by a process from one or more existing rule templates and/or based on user selection and classification of at least a portion of a message. For example, the user may choose a message part and demonstratively classify the part, for example, as a positive or negative example. The generated rules may then be stored for access by a rule-based parsing system such as a message adaptation system. Prior to generation of the one or more parsing rules, a message structure may be established upon which generation of the rules may be based.

The present invention is intended to allow a user to easily and precisely extract related terms through use of mutual information without requiring morphological analysis or syntax analysis, by constituting a related term extraction apparatus from preceding-and-subsequent term extraction means for extracting a preceding term occurring prior to a specified term or a subsequent term occurring subsequent to the same in text data; a frequency calculation means for calculating the occurrence frequencies of the specified term, the preceding terms, and the subsequent terms; probability-of-occurrence calculation means for calculating the occurrence probabilities of the preceding and subsequent terms together with the occurrence probability of the specified term; probability-of-concurrence calculation means for calculating the probabilities of the preceding and subsequent terms cooccurring with the specified term; order-dependent degree-of-association calculation means for calculating an order-dependent degrees of the preceding and subsequent terms cooccurring with the specified term; order-independent degree-of-association calculation means for calculating an order-independent degrees of occurrence of the preceding and subsequent terms with the specified term; and term group extraction means for extracting from the text data a group of terms related to the specified term, on the basis of the degree-of-association information calculated by the order-independent degree-of-association calculation means.

The invention discloses a mapping knowledge domain questioning and answering system and method based on a template matching technique. The system comprises an offline module and an online module, wherein the offline module is mainly used for offline data preparation, and the online module is mainly used for system service. The system can support a friendly natural language question of a user to serve as a query, grammatical analysis is conducted on the question of the user, an offline-defined manual template library is searched for a matched question template according to a result obtained through grammatical analysis, a final structurized mapping knowledge domain query statement is generated according to an entity matching method and a relation matching method, retrieving is conducted in a mapping knowledge domain according to the structurized query statement, and then a final result is returned. According to the mapping knowledge domain questioning and answering system and method based on the template matching technique, the precise retrieving result can be given for the question of the user, and the searching satisfaction degree of the user is improved.

A method and system are disclosed for efficiently correlating network events within a data processing system and then transmitting messages to various network entities in response to an occurrence of a particular network event. According to the present invention, a network mediation service receives raw message streams from one or more external networks and passes the streams in real-time to the event notification service. The event notification service then passes the message to the message parsing service for processing. After the message has been parsed by the message parsing service, it is passed back to the event notification service which passes the message along an event channel to the network management service. The message is also passed to the event correlation service for event correlation. A knowledge-based database of message classes that define how to interpret the message text are used by the event correlation service to match correlation rule conditions to the observed events. After event correlation service processes the parsed event, it is passed to the network management service for resolution.

A method and system for providing trading indicators for selected instruments traded in a market such as stocks, currency contracts, bonds, commodities contracts, options contracts, and futures contracts. The method and system create trading indicators using Time and Sales data as provide by exchanges or financial data providers. The method comprise parsing time, price and volume of individual transactions into a collection of volume per price bracket per time interval quantities, wherein each quantity is an aggregate volume of transactions executed during one of a set of sequential time intervals and executed at prices within one of a set of price brackets. The method generate trading indicators by using mathematical algorithms to score individual volume per price bracket per time interval quantities corresponding to an evaluation time interval against a population of individual volume per price bracket per time interval quantities corresponding to a set of previous time intervals. The system generates trading indicators in real time, without the time lag associated to traditional technical analysis indicators. The method and system can also generate trend indicators based on analysis of volume accumulation, and defines trading indicators based on maximum volume prices.

A financial portfolio management system operable in a network environment can be configured to gather financial information from a plurality of sources over an electronic network and intelligently aggregate the information into a financial portfolio viewable by a client. The client can determine which accounts should be included in the portfolio. The system uses web crawling, parsing, or spidering technology to update the portfolio information. The system provides one platform that conveys financial information from a variety of accounts held at several different financial institutions.

Dedicated hardware is employed to perform parsing of documents such as XML(TM) documents in much reduced time while removing a substantial processing burden from the host CPU. The conventional use of a state table is divided into a character palette, a state table in abbreviated form, and a next state palette. The palettes may be implemented in dedicated high speed memory and a cache arrangement may be used to accelerate accesses to the abbreviated state table. Processing is performed in parallel pipelines which may be partially concurrent. dedicated registers may be updated in parallel as well and strings of special characters of arbitrary length accommodated by a character palette skip feature under control of a flag bit to further accelerate parsing of a document.

The present invention provides a packet processing device and method. A parsing processor provides instruction-driven content inspection of network packets at 10-Gbps and above with a parsing engine that executes parsing instructions. A flow state unit maintains statefulness of packet flows to allow content inspection across several related network packets. A state-graph unit traces -state-graph nodes to keyword indications and/or parsing instructions. The parsing instructions can be derived from a high-level application to emulate user-friendly parsing logic. The parsing processor sends parsed packets to a network processor unit for further processing.

Disclosed is a method for converting a plurality of words or sign language gestures into one or more sentences. The method involves the steps of: obtaining a plurality of words; assigning a part of speech tag to each of said words; assigning a sentence structure tag to said plurality of words; and parsing said words into one or more sentences based on a predefined sentence structure. The method can be implemented by a computer to provide a translator that more accurately reflects the natural language of the original text.