Sciweavers

    268 search results - page 4 / 54
    » Linear Context Free Languages
    Sort
    View
    ACL
    2011
    178views Computational Linguistics» more  ACL 2011»
    Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
    14 years 3 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 »
    COLING
    2010
    137views Computational Linguistics» more  COLING 2010»
    Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
    14 years 6 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 »
    NAACL
    2010
    136views Computational Linguistics» more  NAACL 2010»
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    14 years 9 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 »
    CORR
    2010
    Springer
    124views Education» more  CORR 2010»
    On Omega Context Free Languages which are Borel Sets of Infinite Rank
    14 years 11 months ago
    On Omega Context Free Languages which are Borel Sets of Infinite Rank
    Download  hal.archives-ouvertes.fr
    This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
    Olivier Finkel
    claim paper
    Read More »
    LACL
    2001
    Springer
    97views Automated Reasoning» more  LACL 2001»
    Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
    15 years 4 months ago
    Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
    Download  esslli2009.labri.fr
    Jens Michaelis
    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-2025, USA.