Sciweavers

    226 search results - page 12 / 46
    » Parsing with the Shortest Derivation
    Sort
    View
    ACL
    2009
    108views Computational Linguistics» more  ACL 2009»
    Improving data-driven dependency parsing using large-scale LFG grammars
    13 years 7 months ago
    Improving data-driven dependency parsing using large-scale LFG grammars
    Download  www.ling.uni-potsdam.de
    This paper presents experiments which combine a grammar-driven and a datadriven parser. We show how the conversion of LFG output to dependency representation allows for a techniqu...
    Lilja Øvrelid, Jonas Kuhn, Kathrin Spreyer
    claim paper
    Read More »
    COLING
    1996
    131views Computational Linguistics» more  COLING 1996»
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    13 years 11 months ago
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    Download  staff.science.uva.nl
    This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
    Khalil Sima'an
    claim paper
    Read More »
    EMNLP
    2007
    144views Natural Language Processing» more  EMNLP 2007»
    Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
    13 years 11 months ago
    Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
    Download  cui.unige.ch
    We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
    Ivan Titov, James Henderson
    claim paper
    Read More »
    ENTCS
    2006
    184views more  ENTCS 2006»
    Scannerless Boolean Parsing
    13 years 9 months ago
    Scannerless Boolean Parsing
    Download  www.cs.berkeley.edu
    Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
    Adam Megacz
    claim paper
    Read More »
    COLING
    1996
    121views Computational Linguistics» more  COLING 1996»
    Reversible delayed lexical choice in a bidirectional framework
    13 years 11 months ago
    Reversible delayed lexical choice in a bidirectional framework
    Download  www.ling.helsinki.fi
    We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
    Graham Wilcock, Yuji Matsumoto
    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.