1. Articles in category: Parsing

    25-48 of 563 « 1 2 3 4 5 ... 22 23 24 »
    1. Edge-Linear First-Order Dependency Parsing with Undirected Minimum Spanning Tree Inference. (arXiv:1510.07482v1 [cs.CL])

      The run time complexity of state-of-the-art inference algorithms in graph-based dependency parsing is super-linear in the number of input words (n). Recently, pruning algorithms for these models have shown to cut a large portion of the graph edges, with minimal damage to the resulting parse trees. Solving the inference problem in run time complexity determined solely by the number of edges (m) is hence of obvious importance.

      Read Full Article
    2. Statistical Parsing by Machine Learning from a Classical Arabic Treebank. (arXiv:1510.07193v1 [cs.CL])

      Research into statistical parsing for English has enjoyed over a decade of successful results. However, adapting these models to other languages has met with difficulties. Previous comparative work has shown that Modern Arabic is one of the most difficult languages to parse due to rich morphology and free word order. Classical Arabic is the ancient form of Arabic, and is understudied in computational linguistics, relative to its worldwide reach as the language of the Quran.

      Read Full Article
    3. System and method for dialog modeling

      Disclosed herein are systems, computer-implemented methods, and computer-readable media for dialog modeling. The method includes receiving spoken dialogs annotated to indicate dialog acts and task/subtask information, parsing the spoken dialogs with a hierarchical, parse-based dialog model which operates incrementally from left to right and which only analyzes a preceding dialog context to generate parsed spoken dialogs, and constructing a functional task structure of the parsed spoken dialogs. The method can further either interpret user utterances with the functional task structure of the parsed spoken dialogs or plan system responses to user utterances with the functional task structure of the ...

      Read Full Article
    4. Multi-source transfer of delexicalized dependency parsers

      A source language sentence is tagged with non-lexical tags, such as part-of-speech tags and is parsed using a lexicalized parser trained in the source language. A target language sentence that is a translation of the source language sentence is tagged with non-lexical labels (e.g., part-of speech tags) and is parsed using a delexicalized parser that has been trained in the source language to produce k-best parses. The best parse is selected based on the parse's alignment with lexicalized parse of the source language sentence. The selected best parse can be used to update the parameter vector of a ...

      Read Full Article
    5. Efficient parsing with structured prediction cascades

      A dependency parsing method can include determining an index set of possible head-modifier dependencies for a sentence. The index set can include inner arcs and outer arcs, inners arcs representing possible dependency between words in the sentence separated by a distance less than or equal to a threshold and outer arcs representing possible dependency between words in the sentence separated by a distance greater than the threshold. The index set can be pruned to include: (i) each specific inner arc when a likelihood that the specific inner arc is appropriate is greater than a first threshold, and (ii) the outer ...

      Read Full Article
    6. Method and apparatus for full natural language parsing

      The method and apparatus for discriminative natural language parsing, uses a deep convolutional neural network adapted for text and a structured tag inference in a graph. In the method and apparatus, a trained recursive convolutional graph transformer network, formed by the deep convolutional neural network and the graph, predicts "levels" of a parse tree based on predictions of previous levels.

      Read Full Article
    7. Method and system for generating a parser and parsing complex data

      Computer-implemented systems and methods are disclosed for constructing a parser that parses complex data. In some embodiments, a method is provided for receiving a parser definition as an input to a parser generator and generating a parser at least in part from the parser definition. In some embodiments, the generated parser comprises two or more handlers forming a processing pipeline. In some embodiments, the parser receives as input a first string into the processing pipeline. In some embodiments, the parser generates a second string by a first handler and inputs the second string regeneratively into the parsing pipeline, if the ...

      Read Full Article
    8. Immutable parsing

      Immutable structures are employed to effect immutable parsing. In particular, an immutable parsing configuration, comprising a stack and lookahead buffer, is utilized by a parser to perform lexical and syntactical analysis of an input stream and optionally output an immutable parse tree or the like. Performance with respect to the immutable structures can be optimized utilizing sharing and lazy computation. In turn, immutability benefits are afforded with respect to parsing including safe sharing amongst services and/or across multiple threads as well as history preservation, among other things.

      Read Full Article
    9. Methods and apparatus for dynamic embedded object handling

      A navigation information distribution system comprising one or more servers in communication with each other to parse embedded data attached to an electronic mail message. The servers are configured to receive an email including destination data associated with subscriber identification. Before parsing the embedded data, the server may confirm the subscriber identification included in the email is a valid active subscriber. After confirmation of the subscriber's status, the servers parse the destination data from the email and determine a location based on the destination data using a map database. After parsing, the server may receive a request for the ...

      Read Full Article
    10. Probabilistic learning method for XML annotation of documents

      A document processor includes a parser that parses a document using a grammar having a set of terminal elements for labeling leaves, a set of non terminal elements for labeling nodes, and a set of transformation rules. The parsing generates a parsed document structure including terminal element labels for fragments of the document and a nodes tree linking the terminal element labels and conforming with the transformation rules. An annotator-annotates the document with structural information based on the parsed document structure.

      Read Full Article
    11. Automated parsing of e-mail messages

      An automated parser for e-mail messages identifies component parts such as header, body, signature, and disclaimer. The parser uses a hidden Markov model (HMM) in which the lines making up an e mail are treated as a sequence of observations of a system that evolves according to a Markov chain having states corresponding to the component parts. The HMM is trained using a manually-annotated set of e-mail messages, then applied to parse other e-mail messages. HMM-based parsing can be further refined or expanded using heuristic post-processing techniques that exploit redundancy of some component parts (e.g., signatures, disclaimers) across a ...

      Read Full Article
      Mentions: Markov
    12. Joint Video and Text Parsing for Understanding Events and Answering Queries. (arXiv:1308.6628v1 [cs.CV])

      We propose a framework for parsing video and text jointly for understanding events and answering user queries. Our framework produces a parse graph that represents the compositional structures of spatial information (objects and scenes), temporal information (actions and events) and causal information (causalities between events and fluents) in the video and text.

      Read Full Article
    13. Parse.ly Raises $5M For Predictive Analytics Platform That Helps Media Companies Decide What To Publish

      Parse.ly has raised $5 million for its platform to do analysis of web site data that does natural language processing (NLP) to define semantic relationships in data, primarily for digital media companies. The funding round was led by Grotech Ventures with participation from Blumberg Capital, ff Venture Capital, and FundersClub.

      Read Full Article
    14. Method, device, computer program and computer program product for processing linguistic data in accordance with a formalized natural language

      A method, device and computer program product for parsing linguistic input data by a computer system, in accordance with a grammar of a Formalized Natural Language. The grammar of the Formalized Natural language is a text grammar representing an infinite set of texts of type Text and is stored in electronic form in a computer readable medium constituting a text grammar device. This text grammar is defined by a set of four elements W, N, R and Text. W is a finite set of invariable words of type Word, to be used as terminal, elementary expressions of a text. N ...

      Read Full Article
    15. Joint disambiguation of syntactic and semantic ambiguity

      Ambiguities in a natural language expression are interpreted by jointly disambiguating multiple alternative syntactic and semantic interpretations. More than one syntactic alternative, represented by parse contexts, are analyzed together with joint analysis of referents, word senses, relation types, and layout of a semantic representation for each syntactic alternative. Best combinations of interpretations are selected from all participating parse contexts, and are used to form parse contexts for the next step in parsing.

      Read Full Article
    16. Syntactic parsing of clinical text: guideline and corpus development with handling ill-formed sentences.

      Syntactic parsing of clinical text: guideline and corpus development with handling ill-formed sentences.

      J Am Med Inform Assoc. 2013 Aug 1;

      Authors: Fan JW, Yang EW, Jiang M, Prasad R, Loomis RM, Zisook DS, Denny JC, Xu H, Huang Y

      Abstract OBJECTIVE: To develop, evaluate, and share: (1) syntactic parsing guidelines for clinical text, with a new approach to handling ill-formed sentences; and (2) a clinical Treebank annotated according to the guidelines.

      Read Full Article
    17. System and method for querying data streams

      A method includes parsing input from a requestor, where the input includes at least one of a query and a command that is parsed into a structured query having an indication of at least one data stream or set of data streams and at least one action to be performed on the at least one data stream or set of data streams. The method further includes mapping the structured query into a graph of processing elements that are selected and interconnected so as to execute the structured query; instantiating the graph of processing elements and connecting and initializing the instantiated ...
      Read Full Article
    18. Method for parsing, searching and formatting of text input for visual mapping of knowledge information

      A method for performing relational analysis of parsed input is employed to create a visual map of knowledge information. A title, header or subject line for an input item of information is parsed into syntactical components of at least a subject component and any predicate component(s) relationally linked as topic and subtopics. A search of indices for the knowledge map and its topics and subtopics is carried out for the subject component. If a match is found, then the subject component is taken as the existing topic. If no match is found, then the subject component is formatted as ...
      Read Full Article
    19. Automatic data categorization with optimally spaced semantic seed terms

      A method and system for automatic data categorization in response to a user query. A document set is retrieved in response to the user query. A semantic parser parses the document set and produces semantic term-groups by parsing a semantic network of nodes. A seed ranker produces a plurality of advantageously spaced semantic seeds based on the semantic term-groups. A category accumulator stores the advantageously spaced semantic seeds. The semantic network of nodes is augmented with the advantageously spaced semantic seeds.
      Read Full Article
    20. Efficient incremental parsing of context sensitive programming languages

      Many integrated development environments provide "intelligent feedback" to developers. Current "intelligent feedback" techniques may not work well with source code files comprising context sensitive programming languages because edits to one place in the code may change the meaning of arbitrary other places in the code, thus requiring additional full semantic parses to maintain correctness of the system. As provided herein, context-free "name" parsing may be performed to support entity candidate recursive semantic parsing in determining the meaning of the entity. A name parse may be performed to build and/or update a name table and a range table comprising names ...
      Read Full Article
    25-48 of 563 « 1 2 3 4 5 ... 22 23 24 »
  1. Categories

    1. Default:

      Discourse, Entailment, Machine Translation, NER, Parsing, Segmentation, Semantic, Sentiment, Summarization, WSD
  2. Popular Articles