183 results about "Unparser" patented technology

Apparatus with accompanying subsystems and methods for developing conversational computer applications. As a user interface, the apparatus allows for a user to initiate the conversation. The apparatus also answers simple and complex questions, understands complex requests, pursues the user for further information when the request is incomplete, and in general provides customer support with a human like conversation while, at the same time, it is capable to interact with a company's proprietary database. As a development tool, the apparatus allows a software developer to implement a conversational system much faster than takes, with current commercial systems to implement basic dialog flows. The apparatus contains three major subsystems: a state transition inference engine, a heuristic answer engine and a parser generator with semantic augmentations. A main process broker controls the flow and the interaction between the different subsystems. The state transition inference engine handles requests that require processing a transaction or retrieving exact information. The heuristic answer engine answers questions that do not require exact answers but enough information to fulfill the user's request. The parser generator processes the user's natural language request, that is, it processes the syntactical structure of the natural language requests and it builds a conceptual structure of the request. After the parser generator processes the user's request, a main process broker feeds the conceptual structure to either the heuristic answer engine or to the state transition inference engine. The interaction between the main process broker and the subsystems creates a conversational environment between the user and the apparatus, while the apparatus uses information from proprietary databases to provide information, or process information, during the course of the conversation. The apparatus is equipped with a programming interface that allows implementers to declare and specify transactions based requests and answers to a multiplicity of questions. The apparatus may be used with a speech recognition interface, in which case, the apparatus improves the recognition results through the context implicitly created by the apparatus.

A system, method and computer program product for conducting questions and answers with deferred type evaluation based on any corpus of data. The method includes processing a query including waiting until a “Type” (i.e. a descriptor) is determined AND a candidate answer is provided; the Type is not required as part of a predetermined ontology but is only a lexical/grammatical item. Then, a search is conducted to look (search) for evidence that the candidate answer has the required LAT (e.g., as determined by a matching function that can leverage a parser, a semantic interpreter and/or a simple pattern matcher). In another embodiment, it may be attempted to match the LAT to a known Ontological Type and then look for a candidate answer up in an appropriate knowledge-base, database, and the like determined by that type. Then, all the evidence from all the different ways to determine that the candidate answer has the expected lexical answer type (LAT) is combined and one or more answers are delivered to a user.

A digital device and a method for parsing a query, in particular a natural language query, and retrieving results from possibly multiple data sources such as relational databases or the Semantic Web. The method includes a parsing procedure for generating a graph-based logical representation of the query using semantically structured resources, consisting of a tokenizer, a node generator, a relationship generator, and a focus identificator. The digital device realizes a modularized architecture, consisting of a parser enabling the processing of a query with possibly multiple vocabularies, a query performer retrieving data of knowledge sources independently from their database management system, and a result processor merging the results.

A method of parsing a markup language document comprising syntactic elements is disclosed, said method comprising, for one of said syntactic elements, the steps of identifying (310) a type of the element, processing (318) the element by determining a hash representation thereof if said type is a first type, and augmenting (314) an at least partial structural representation of the document using the hash representation if said type is said first type.

Within the scope of existing XML Schema specifications, an approach is provided to embed simple types within a complex type so an XML stream can have instances of the embedded simple types, even without the presence of XML elements. Because the approach is within the scope of existing XML Schema specifications, the approach is transparent to known XML parsers. With the approach, an XML schema will have a complex type with a mixed flag set to true and an element set to be a dummy element. The dummy element has a simple type and one of (i) a name of the dummy element and (ii) a name of the simple type is one of a predetermined set of names. This XML schema is for use with a parser which, on parsing the schema, will interpret the dummy element as one of an embedded simple type and an inherited simple type.

A computing device programmed with an extensible framework that accepts one or more mark-up language parsers and/or generators, each implemented as plug-ins to the framework, with different plug-ins enabling different kinds of mark up languages to be handled by the device. In this way, the client is no longer tied to a single kind of parser or generator; it can operate with any different kind of parser compatible with the intermediary layer, yet it remains far simpler that prior art clients that are hard-coded to operate directly with several different kinds of parsers and generators.

Methods, systems, and computer program products are provided for profiling source code to enable improved source code execution. A runtime engine includes a parser, a bytecode generator, an execution controller, an interpreter, a just-in-time (JIT) compiler, and a profile generator. The parser receives source code coded in a dynamic language and parses the source code to generate parsed source code. The bytecode generator converts the parsed source code to bytecode. The interpreter is configured to interpret the bytecode when enabled by the execution controller. The JIT compiler is configured to compile the bytecode when enabled by the execution controller. The profile generator generates profile information from the bytecode and stores the profile information. The execution controller enables the interpreter or the JIT compiler to perform their respective functions based on the profile information.

A method to optimize tag based protocol parsing adapted to execute functions according to tags of a tag based protocol stream is disclosed. A reference tag table, associated to the document type definition of the tag based protocol stream, comprises tags and corresponding attribute and function names. When the optimized tag based protocol parser gets a tag from the tag based protocol stream, it determines whether or not the tag is present in the reference tag table. If the tag is not found in this table, normal parsing continues. Else, if the tag is found in this table and if there is at least one associated the attribute names from the reference tag table and from the tag based protocol stream. If the attribute names match, the parser gets the attribute values from the tag based protocol stream before getting the name of the function associated to the tag and attribute names combination. Then, the parser executes the function.

The invention relates to the field of semantic analysis, and discloses an intelligent question-answering method and device, a medium and electronic equipment. The method comprises the following steps:preprocessing a question input by a user and a plurality of question templates in a preset template library to respectively obtain keywords of the question and the question templates; inputting a question sentence and template keyword group pair consisting of the keyword of the question sentence and the keyword of each question sentence template into an established semantic parser comprising a multi-layer word similarity judgment model to obtain the similarity between the question sentence output by the semantic parser and each question sentence template; obtaining a standard question template from all question templates in a preset template library according to the similarity; and determining a question answer corresponding to the standard question template and outputting the question answer. According to the method, the answer most matched with the question can be obtained for the question of the user, the matching efficiency and accuracy of the question and the answer are improved,and then the matching effect is improved.

A system for analyzing text-based information is presented. Each datum of information includes an author, a description and a timestamp. A fetcher fetches the raw information according to keywords. A parser parses the raw information to refine the results. A lexicon management module extracts lemmas from the raw information, and creates an edited lexicon containing the raw data and the lemmas for each datum. A data manager correlates lemmas in the edited lexicon and identifies clusters of lemmas that are correlated between each other. The results can be visually displayed to a user, and clusters of lemma that are less correlated than the other clusters can be visually identified. In one aspect, the user is able to excise the less correlated clusters, in order to further refine the results of the keyword search.

An extension of any n-file compare and/or merge utility in an edit system includes services provided by a parser attached to the edit system for the particular file type. A compare command in the edit system is enabled by an extension-registration process to query, upon activation, for any compare extensions supported by the parser. Selected files are displayed to a user with non-comparing elements highlighted according to a compare strategy selected with reference to the compare extensions.

NLG techniques are disclosed that apply computer technology to sentence data for performing entity referencing. For example, a processor can parse sentence data in a defined window of sentence data into a list of entity terms and a plurality of classifications associated with the listed entity terms. A processor can also compute a plurality of context saliency scores for a plurality of the listed entity terms based on the classifications associated with the listed entity terms. For new sentence data that refers to an entity term from the entity term list, a processor can select a referring term for referencing that entity term from a list of candidate referring terms based on the context saliency scores for the entity terms. A processor can then form the new sentence data such that the new sentence data includes the selected referring term to refer to the at least one entity term.

A method and an apparatus for string pattern matching and parsing based on ABNF syntax. The method includes: defining an instruction set suitable for describing a string pattern rule; designing a compiler capable of translating the protocol rule described in ABNF syntax into a protocol rule described with the instruction set and an object code; designing a hardware parser according to the characteristics of the instruction set, the parser comprising a module implemented by a special hardware for supporting the corresponding instruction, thereby realizing string pattern matching and parsing.

A web development method for a web development system includes, in a running state of the web development system, generating or modifying script code used to perform a predetermined function; parsing, by a script parser, the generated script code or the modified script code to correspondingly generate an object type which performs a new function, or to modify the object type which performs an existing function; and generating a new function object or modifying the existing function object, by an object manager, according to the generated object type which performs the new function or the modified object type which performs the existing function, and organizing the invoking relationships between the new function object and other objects, or, invoking relationships between the modified function object and other objects, so as to generate or modify the predetermined function when the web development system is operating.

The invention discloses an application program development method. The method comprises the steps of obtaining a Java source code file to be compiled, wherein the Java source code file comprises a source code program and a source code annotation; compiling a source code program in the Java source code file through a Java source code compiler; and compiling a source code annotation in the Java source code file through an annotation parser, compiling a syntax tree obtained by compiling the Java source code file into an executable byte code, and packaging the executable byte code to generate an application program. According to the method, the byte code is directly operated in the operation period, on one hand, the problem of low coding efficiency is solved through annotation, and on the other hand, the annotation is compiled in the compiling stage to generate the byte code, so that the byte code is directly operated in the operation period. The problem of operation efficiency reduction caused by annotation analysis is avoided. The invention further discloses a corresponding device, equipment and a medium.