Sciweavers

    13 search results - page 1 / 3
    » Recognition of Linear Context-Free Rewriting Systems
    Sort
    View
    ACL
    1992
    119views Computational Linguistics» more  ACL 1992»
    Recognition of Linear Context-Free Rewriting Systems
    13 years 6 months ago
    Recognition of Linear Context-Free Rewriting Systems
    Download  www.aclweb.org
    The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
    Giorgio Satta
    claim paper
    Read More »
    NAACL
    2010
    155views Computational Linguistics» more  NAACL 2010»
    Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
    13 years 2 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 »
    ACL
    2010
    152views Computational Linguistics» more  ACL 2010»
    Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
    13 years 2 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 »
    ACL
    1992
    120views Computational Linguistics» more  ACL 1992»
    Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
    13 years 6 months ago
    Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
    Download  www.aclweb.org
    We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
    David J. Weir
    claim paper
    Read More »
    ACL
    2011
    178views Computational Linguistics» more  ACL 2011»
    Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
    12 years 8 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.