Sciweavers

    30 search results - page 2 / 6
    » Parsing the Wall Street Journal with the Inside-Outside Algo...
    Sort
    View
    ACL
    2006
    138views Computational Linguistics» more  ACL 2006»
    Annotation Schemes and their Influence on Parsing Results
    13 years 6 months ago
    Annotation Schemes and their Influence on Parsing Results
    Download  acl.ldc.upenn.edu
    Most of the work on treebank-based statistical parsing exclusively uses the WallStreet-Journal part of the Penn treebank for evaluation purposes. Due to the presence of this quasi...
    Wolfgang Maier
    claim paper
    Read More »
    ACL
    2001
    107views Computational Linguistics» more  ACL 2001»
    What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
    13 years 6 months ago
    What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
    Download  acl.ldc.upenn.edu
    We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
    Rens Bod
    claim paper
    Read More »
    COLING
    2000
    108views Computational Linguistics» more  COLING 2000»
    Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
    13 years 6 months ago
    Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
    Download  acl.ldc.upenn.edu
    We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
    Miles Osborne
    claim paper
    Read More »
    EACL
    2003
    ACL Anthology
    145views Natural Language Processing» more  EACL 2003»
    An efficient implementation of a new DOP model
    13 years 6 months ago
    An efficient implementation of a new DOP model
    Download  staff.science.uva.nl
    Two apparently opposing DOP models exist in the literature: one which computes the parse tree involving the most frequent subtrees from a treebank and one which computes the parse...
    Rens Bod
    claim paper
    Read More »
    NAACL
    2010
    166views Computational Linguistics» more  NAACL 2010»
    From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
    13 years 3 months ago
    From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
    Download  www.stanford.edu
    We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
    Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...
    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.