Sciweavers

    38 search results - page 2 / 8
    » Treebank Grammar Techniques for Non-Projective Dependency Pa...
    Sort
    View
    ACL
    2009
    99views Computational Linguistics» more  ACL 2009»
    Exploiting Heterogeneous Treebanks for Parsing
    13 years 2 months ago
    Exploiting Heterogeneous Treebanks for Parsing
    Download  www.aclweb.org
    We address the issue of using heterogeneous treebanks for parsing by breaking it down into two sub-problems, converting grammar formalisms of the treebanks to the same one, and pa...
    Zheng-Yu Niu, Haifeng Wang, Hua Wu
    claim paper
    Read More »
    ACL
    2006
    124views Computational Linguistics» more  ACL 2006»
    Mildly Non-Projective Dependency Structures
    13 years 6 months ago
    Mildly Non-Projective Dependency Structures
    Download  www.aclweb.org
    We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at mos...
    Marco Kuhlmann, Joakim Nivre
    claim paper
    Read More »
    ACL
    2008
    101views Computational Linguistics» more  ACL 2008»
    Unlexicalised Hidden Variable Models of Split Dependency Grammars
    13 years 6 months ago
    Unlexicalised Hidden Variable Models of Split Dependency Grammars
    Download  www.aclweb.org
    This paper investigates transforms of split dependency grammars into unlexicalised context-free grammars annotated with hidden symbols. Our best unlexicalised grammar achieves an ...
    Gabriele Antonio Musillo, Paola Merlo
    claim paper
    Read More »
    LRE
    2008
    100views more  LRE 2008»
    LTAG-spinal and the Treebank
    13 years 4 months ago
    LTAG-spinal and the Treebank
    Download  www.ling.upenn.edu
    Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
    Libin Shen, Lucas Champollion, Aravind K. Joshi
    claim paper
    Read More »
    COLING
    2010
    137views Computational Linguistics» more  COLING 2010»
    Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
    12 years 11 months ago
    Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
    Download  www.aclweb.org
    This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
    Laura Kallmeyer, Wolfgang Maier
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.