Product
Feature
Quick Research
Generate reliable direction feasibility study reports for your R&D in just a few steps.
Technical Q&A
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
Find Solutions
As an expert in R&D theories, this can generate solutions to your technical problems instantly.
Evaluate Feasibility
Analyze your overall solution with one click, know your potential R&D risks in advance.
Monitor Landscape
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
200 results about "Unparser" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In computing, an unparser is a system that constructs a set of characters or image components from a given parse tree. An unparser is in effect the reverse of a traditional parser that takes a set of string of characters and produces a parse tree. Unparsing generally involves the application of a specific set of rules to the parse tree as a "tree walk" takes place.
Apparatus and methods for developing conversational applications
InactiveUS20040083092A1Improve speech recognition performanceQuick fixSemantic analysisSpeech recognitionState switchingApplication software
Owner:GYRUS LOGIC INC
System and method for providing question and answers with deferred type evaluation
ActiveUS20090292687A1ConfidenceAllow useDigital data information retrievalDigital data processing detailsQuestions and answersData mining
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.
Owner:IBM CORP
Methods and systems of handling patent claims
InactiveUS20170075877A1Increase in numberImproved accessNatural language data processingSpecial data processing applicationsNatural languagePatent classification
There is disclosed a computer-implemented method of handling a text expressed in a natural language comprising creating a second text or patent claim sentence from a first text or patent claim sentence and timestamping said second text or patent claim sentence. Developments comprise the creation of a plurality of texts or patent claim sentences, the use of trusted and / or trustless timestamping, the use of grammatical texts, the use of a parser and / or of a tagger, modification operations such as addition, insertion and deletion, injection of definitions of words, the use of a thesaurus (synonym, hyponym, hyperonym, holonym, antonym of a word, etc), the use of a unique and optionally persistent web address, making the second text or patent claim available to the public (or not), the use of lexical directions such as a patent classification indication and the use of crowdsourcing techniques.
Owner:LEPELTIER MARIE THERESE
System and method for mining data
InactiveUS20060235811A1Data processing applicationsConveying record carriersBatch processingBatch extraction
A system and method for extracting data, hereinafter referred to as MitoMine, that produces a strongly-typed ontology defined collection referencing (and cross referencing) all extracted records. The input to the mining process can be any data source, such as a text file delimited into a set of possibly dissimilar records. MitoMine contains parser routines and post processing functions, known as ‘munchers’. The parser routines can be accessed either via a batch mining process or as part of a running server process connected to a live source. Munchers can be registered on a per data-source basis in order to process the records produced, possibly writing them to an external database and / or a set of servers. The present invention also embeds an interpreted ontology based language within a compiler / interpreter (for the source format) such that the statements of the embedded language are executed as a result of the source compiler ‘recognizing’ a given construct within the source and extracting the corresponding source content. In this way, the execution of the statements in the embedded program will occur in a sequence that is dictated wholly by the source content. This system and method therefore make it possible to bulk extract free-form data from such sources as CD-ROMs, the web etc. and have the resultant structured data loaded into an ontology based system.
Owner:FAIRWEATHER JOHN
Method for generic object oriented description of structured data (GDL)
InactiveUS7092950B2Facilitate semanticFacilitate definitional information verificationData processing applicationsDigital data processing detailsText entryComputerized system
A method is provided for use in a computer system to describe and obtain arbitrary data relating to a subject. The method provides a meta-language “Generic Object Oriented Description of Structured Data (GDL)” and a Parser. GDL allows a user to organize, define and describe subjects through the use of a schema known as a Template. Templates can be used to define the semantics for each subject element as well as, to define how each element fits into a larger data framework. Through the concept of Inheritance, Templates can be extended and defined to various levels of nesting, while still having a common core of properties. GDL allows the features and attributes of a subject to be quickly and readily extended or modified by altering a source file. A GDL parser provides a structured and hierarchical representation of the information, validation of text-entry semantics and a means to traverse through information obtained from the source file.
Owner:MICROSOFT TECH LICENSING LLC
System and method for automated building of component based applications for visualizing complex data structures
InactiveUS20060236254A1Promote generationSmall sizeReverse engineeringProgram controlGraphicsGraphical user interface
A system and method for generating a screen component configured to visualize a data structure in a displayed screen on a graphical user interface of a device. The screen component for including in an application for execution on the device and having definitions expressed in a structured definition language for defining the visualization of the data structure. The visualized data structure related to data content associated with messages communicated over a network between the device and a data source. The system and method comprises: a parser module for analyzing a set of predefined message and data definitions expressed in a structured definition language to identify corresponding data structure and message details related to the messages, the predefined message and data definitions for including in the application; a screen template for providing a representative example of the screen to be displayed on the graphical user interface; and a screen component generation module for applying the predefined message and data details to the screen template to generate the screen component; wherein the predefined message and data definitions and the screen component are subsequently assembled in to the application.
Owner:BLACKBERRY LTD
Method for integrating processes with a multi-faceted human centered interface
InactiveUS7188067B2Comfortable to userPrevented from appearingSpeech recognitionDividing attentionHands free
According to the present invention, a method for integrating processes with a multi-faceted human centered interface is provided. The interface is facilitated to implement a hands free, voice driven environment to control processes and applications. A natural language model is used to parse voice initiated commands and data, and to route those voice initiated inputs to the required applications or processes. The use of an intelligent context based parser allows the system to intelligently determine what processes are required to complete a task which is initiated using natural language. A single window environment provides an interface which is comfortable to the user by preventing the occurrence of distracting windows from appearing. The single window has a plurality of facets which allow distinct viewing areas. Each facet has an independent process routing its outputs thereto. As other processes are activated, each facet can reshape itself to bring a new process into one of the viewing areas. All activated processes are executed simultaneously to provide true multitasking.
Owner:NUANCE COMM INC
Rule parser
ActiveUS20050132034A1Digital data information retrievalDigital computer detailsParsingTree structure
In one embodiment of the present invention, a rule compiler can compress a plurality of rules to be parsed over a block of data into one state table tree structure. In one embodiment of the present invention, rue parsing over the block of data includes selecting a unit of the block of data, indexing into a state table of the state table tree using the selected unit. The state table indexed into can be used for determining whether a decision regarding the block of data can be reached based on the indexed entry, and for selecting a next state table indicated by the indexed entry if the decision regarding the block of data cannot be reached.
Owner:MCAFEE LLC
Method and Device for Performing Natural Language Searches
ActiveUS20140236579A1Reduce computation timePerform fasterNatural language translationSpecial data processing applicationsModularityKnowledge sources
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.
Owner:KURZ NADINE SINA
Parsing of text using linguistic and non-linguistic list properties
InactiveUS20120290288A1Natural language data processingSpecial data processing applicationsSyntaxDependency relation
A system and method are disclosed for extracting information from text which can be performed without prior knowledge as to whether the text includes a list. The method applies parser rules to a sentence spanning lines of text to identify a set of candidate list items in the sentence. Each candidate list item is assigned a set of features including one or more non-linguistic feature and a linguistic feature. The linguistic feature defines a syntactic function of an element of the candidate list item that is able to be in a dependency relation with an element of an identified candidate list introducer in the same sentence. When two or more candidate list items are found with compatible sets of features, a list is generated which links these as list items of a common list introducer. Dependency relations are extracted between the list introducer and list items and information based on the extracted dependency relations is output.
Owner:XEROX CORP
Reducing programming complexity in applications interfacing with parsers for data elements represented according to a markup language
ActiveUS20060074838A1Natural language data processingSemi-structured data queryingProgramming complexityApplication programming interface
According to an aspect of the present invention, a parser provides the portion identifiers (e.g., Xpath(s) in case of XML data files) of at It some of the data elements to the applications. As a result, the applications may be relieved from the task of computing the XPath(s) for various data elements. The implementation of applications may be simplified as a result. In one embodiment, prior API (application programming interface) is extended to provide the XPath(s). In an alternative embodiment, custom API is provided to encode the applications to obtain the XPath(s).
Owner:ORACLE INT CORP
Multi-lingual semantic parser based on transferred learning
ActiveUS20180307679A1Reduce training data needImprove performanceNatural language translationSemantic analysisHuman languageFirst language
The disclosure relates to transferred learning from a first language (e.g., a source language for which a semantic parser has been defined) to a second language (e.g., a target language for which a semantic parser has not been defined). A system may use knowledge from a trained model in one language to model another language. For example, the system may transfer knowledge of a semantic parser from a first (e.g., source) language to a second (e.g., target) language. Such transfer of knowledge may occur and be useful when the first language has sufficient training data but the second language has insufficient training data. The foregoing transfer of knowledge may extend the semantic parser for multiple languages (e.g., the first language and the second language).
Owner:VOICEBOX TECH INC
Syslog parser
ActiveUS20090119307A1Other databases queryingSpecial data processing applicationsTheoretical computer scienceApplication software
A computerized method performed in a computer operatively connected to storage. Parsing rules are determined for parsing logs output as text and / or symbols from multiple devices in a computer network. The logs are stored in the storage. Multiple log samples are sampled from the logs. The log samples are input into an application running on the computer. The log samples are each sectioned into multiple sections which include variable information separated by static structural text. Each of the log samples is processed by: comparing the sections to a list of regular expressions. The list is maintained in the storage, and upon matching a matched section of the sections to a matched regular expression from the list of the regular expressions, the matched section is tagged with a tag associated with the matched regular expression. The tag associated to the matched regular expression is stored and combined with any unmatched sections and with the static structural text to create a log pattern. The log pattern is stored in a table only if the log pattern is distinct from all log patterns previously stored in the table.
Owner:CHECK POINT SOFTWARE TECH LTD
Program compiler with abstraction composer
InactiveUS20040148592A1Simplifying program maintenanceImprove legibilitySoftware engineeringSpecific program execution arrangementsTheoretical computer scienceSource code
Source code is compiled using a multi-stage compiler that includes a tokenizer, a type checker, and a composer. The tokenizer segments source code into a sequence of tagged segments. The source code includes at least one instruction that composes a first abstraction and a second abstraction with a selected composition operator. The parser builds a tree using the sequence of tagged segments. The type checker performs a first pass of the tree to determine whether abstractions on the tree are well typed. The composer reduces the at least one instruction composing the first and the second abstractions on the tree to a third abstraction. The composer substitutes the first and the second abstractions on the tree with the third abstraction, wherein the type checker performs a second pass of the tree to determine whether the third abstraction is well typed.
Owner:XEROX CORP
Compiling source code using generic classes
A method includes receiving a portion of JAVA™ language software having a declaration of an instance of a generic class, parsing the declaration into a token corresponding to the generic class, and generating an intermediate language code block corresponding to the parsed declaration. The intermediate language code block is executable by a runtime engine. A system for compiling includes a parser receiving JAVA™ language source code having an instruction referencing a generic class and specifying a type of the generic class, and a code generator generating intermediate language code representing the source code.
Owner:MICROSOFT TECH LICENSING LLC
Self learning event parser
Owner:TRUSTWAVE HOLDINGS
Hash compact XML parser
InactiveUS7281205B2More disadvantageDigital computer detailsComputer security arrangementsStructural representationTheoretical computer science
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.
Owner:CANON KK
Applying a structured language model to information extraction
InactiveUS7805302B2Easy to practiceNatural language translationSemantic analysisSemantic annotationParse tree
One feature of the present invention uses the parsing capabilities of a structured language model in the information extraction process. During training, the structured language model is first initialized with syntactically annotated training data. The model is then trained by generating parses on semantically annotated training data enforcing annotated constituent boundaries. The syntactic labels in the parse trees generated by the parser are then replaced with joint syntactic and semantic labels. The model is then trained by generating parses on the semantically annotated training data enforcing the semantic tags or labels found in the training data. The trained model can then be used to extract information from test data using the parses generated by the model.
Owner:MICROSOFT TECH LICENSING LLC
Parsing system and method of multi-document based on elements
InactiveUS20060106837A1Digital data information retrievalDigital data processing detailsNatural language processingPaper document
A system and method is configured to parse web-document based on elements. The system can include a word parser for extracting and separating all tokens of the document supplied to the terminal regardless of kind of a markup language used to compose the web-document by referring to a token table; and a syntax parser for parsing syntax for the tokens extracted and separated by the word parser on the basis of a contents model, and generating a object on the basis of GUI of the terminal through the parsed syntax. The token table can include tokens defined in an XML document, keywords defined in document type definition (DTD) for all documents provided to the handheld terminal, and a list of elements that can be supported by each terminal. The contents model can be determined in accordance with DTD for all documents provided to the terminal and include a hierarchy of elements and an attribute list.
Owner:LG ELECTRONICS INC
Simple types in XML schema complex types
InactiveUS20040261018A1Simple typeData processing applicationsDigital computer detailsComplex typeComplex data 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.
Owner:IBM CORP
Extensible framework for handling different mark up language parsers and generators in a computing device
InactiveUS20070006068A1Fast loadingReduce total usageNatural language data processingSpecial data processing applicationsHard codingClient-side
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.
Owner:WSOU INVESTMENTS LLC
Profile guided jit code generation
ActiveCN103064720AEfficient executionSoftware testing/debuggingProgram controlExecution controlSource code
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.
Owner:MICROSOFT TECH LICENSING LLC
Systems and method for optimizing tag based protocol stream parsing
InactiveUS20060236222A1Digital computer detailsNatural language data processingTheoretical computer scienceDocument type definition
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.
Owner:IBM CORP
Structured query language conversion method based on natural language, and related equipment thereof
PendingCN111177184AAccurate conversionImprove relevanceDigital data information retrievalNatural language data processingEngineeringQuery language
The invention relates to the technical field of artificial intelligence, and provides a structured query language conversion method based on a natural language, and related equipment thereof. The structured query language conversion method based on the natural language comprises the following steps: obtaining a natural language text from a preset database; performing word segmentation processing on the natural language text to obtain natural language segmented words; obtaining a target text in a mode of mapping the natural language segmented words through a vocabulary analysis end; performinggrammar analysis on the target text by utilizing a preset grammar analyzer to generate an analyzed text; matching a preset select identifier and a preset where identifier with the identifier information in the analysis text respectively, and determining a select clause, a work clause and a from clause according to an obtained matching result; and generating a structured query language based on theselect clause, the where clause and the from clause. The natural language is rapidly and accurately converted into SQL, the accuracy of query by a user through the SQL is further guaranteed, and theworking efficiency of the user is improved.
Owner:ONE CONNECT SMART TECH CO LTD SHENZHEN
Program compiler with abstraction composer
InactiveUS7284242B2Easy maintenanceImprove legibilitySoftware engineeringSpecific program execution arrangementsSource codeProgram compilation
Source code is compiled using a multi-stage compiler that includes a tokenizer, a type checker, and a composer. The tokenizer segments source code into a sequence of tagged segments. The source code includes at least one instruction that composes a first abstraction and a second abstraction with a selected composition operator. The parser builds a tree using the sequence of tagged segments. The type checker performs a first pass of the tree to determine whether abstractions on the tree are well typed. The composer reduces the at least one instruction composing the first and the second abstractions on the tree to a third abstraction. The composer substitutes the first and the second abstractions on the tree with the third abstraction, wherein the type checker performs a second pass of the tree to determine whether the third abstraction is well typed.
Owner:XEROX CORP
Apparatus and method for automatically migrating client server applications to other architectures and platforms
Owner:TATA CONSULTANCY SERVICES LTD
Error-tolerant language understanding system and method
InactiveUS20030225579A1Speech recognitionSpecial data processing applicationsLanguage understandingSpeech sound
The present invention relates to an error-tolerant language understanding, system and method. The system and the method is using example sentences to provide the clues for detecting and recovering errors. The procedure of detection and recovery is guided by a probabilistic scoring function which integrated the scores from the speech recognizer, concept parser, the scores of concept-bigram and edit operations, such as deleting, inserting and substituting concepts. Meanwhile, the score of edit operations refers the confidence measure achieving more precise detection and recovery of the speech recognition errors. That said, a concept with lower confidence measure tends to be deleted or substituted, while a concept with higher one tends to be retained.
Owner:IND TECH RES INST
Search algorithm for inheriting clock contexts in hardware description language translation tools
InactiveUS7350180B1CAD circuit designSoftware simulation/interpretation/emulationTheoretical computer scienceEdge type
A search algorithm supports inherited clock contexts within functions written in a Hardware Description Language. For each function, a parser generates a corresponding node tree. Each clock context node has an associated clock signal and active clock edge. The edge can be an inherited type, whereas conventionally only absolute edge types are allowed. During elaboration processing, for each clock context node encountered with an associated directly inherited edge, the algorithm searches up the node tree from the encountered node. It looks for a controlling clock context node with an associated clock signal that is connected to the encountered context's associated clock signal. If a controlling context is found, then its associated edge replaces the encountered context node's associated edge. The connection requirement supports multi-clock circuits. If necessary, the search can move up a function hierarchy. An alternative oppositely inherited edge is replaced by the opposite of the found edge.
Owner:SLAVIN KEITH ROBERT
Method for Parsing Natural Language Text
ActiveUS20140019122A1Natural language data processingSpecial data processing applicationsPart of speechSpeech sound
A parser for natural language text is provided. The parser is trained by accessing a corpus of labeled utterances. The parser extracts details of the syntactic tree structures and part of speech tags from the labeled utterances. The details extracted from the tree structures include Simple Links which are the key to the improved efficiency of this new approach. The parser creates a language model using the details that were extracted from the corpus. The parser then uses the language model to parse utterances.
Owner:NEW ROBERT D
Compiler apparatus and method of optimizing a source program by reducing a hamming distance between two instructions
InactiveUS7386844B2Reduce power consumptionEnergy efficient ICTSoftware engineeringCode generationInstruction cycle
A compiler apparatus is capable of generating instruction sequences causing a processor to operate with lower power consumption. The compiler apparatus translates a source program into a machine language program for a processor including execution units which can execute instructions in parallel, and including instruction issue units which issue the instructions executed, respectively, by the execution units. The compiler apparatus includes a parser unit operable to parse the source program, an intermediate code conversion unit operable to convert the parsed source program into intermediate codes, an optimization unit operable to optimize the intermediate codes to reduce a hamming distance between instructions from the same instruction issue unit in consecutive instruction cycles, and includes a code generation unit operable to convert the optimized intermediate codes into machine language instructions.
Owner:SOCIONEXT INC
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Patsnap Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com