Sciweavers

    10 search results - page 1 / 2
    » Efficient Parsing of Well-Nested Linear Context-Free Rewriti...
    Sort
    View
    NAACL
    2010
    155views Computational Linguistics» more  NAACL 2010»
    Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
    13 years 8 months ago
    Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
    Download  www.grupolys.org
    The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
    Carlos Gómez-Rodríguez, Marco Kuhlma...
    claim paper
    Read More »
    COLING
    2010
    137views Computational Linguistics» more  COLING 2010»
    Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
    13 years 5 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 »
    ACL
    2010
    152views Computational Linguistics» more  ACL 2010»
    Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
    13 years 9 months ago
    Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
    Download  aclweb.org
    Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
    Benoît Sagot, Giorgio Satta
    claim paper
    Read More »
    NAACL
    2010
    136views Computational Linguistics» more  NAACL 2010»
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    13 years 8 months ago
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    Download  www.cs.rochester.edu
    Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
    Daniel Gildea
    claim paper
    Read More »
    ACL
    2011
    178views Computational Linguistics» more  ACL 2011»
    Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
    13 years 2 months ago
    Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
    Download  www.cs.rochester.edu
    We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
    Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...
    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.