Sciweavers

    18 search results - page 1 / 4
    » Probabilistic Tree-Adjoining Grammar As A Framework For Stat...
    Sort
    View
    COLING
    1992
    132views Computational Linguistics» more  COLING 1992»
    Probabilistic Tree-Adjoining Grammar As A Framework For Statistical Natural Language Processing
    13 years 6 months ago
    Probabilistic Tree-Adjoining Grammar As A Framework For Statistical Natural Language Processing
    Download  acl.ldc.upenn.edu
    Philip Resnik
    claim paper
    Read More »
    EACL
    2006
    ACL Anthology
    138views Natural Language Processing» more  EACL 2006»
    Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
    13 years 6 months ago
    Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
    Download  www.eecs.harvard.edu
    We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
    Stuart M. Shieber
    claim paper
    Read More »
    EACL
    1993
    ACL Anthology
    101views Natural Language Processing» more  EACL 1993»
    The Use of Shared Forests in Tree Adjoining Grammar Parsing
    13 years 6 months ago
    The Use of Shared Forests in Tree Adjoining Grammar Parsing
    Download  acl.ldc.upenn.edu
    We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
    K. Vijay-Shanker
    claim paper
    Read More »
    EMNLP
    2009
    140views Natural Language Processing» more  EMNLP 2009»
    Synchronous Tree Adjoining Machine Translation
    13 years 2 months ago
    Synchronous Tree Adjoining Machine Translation
    Download  www.isi.edu
    Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
    Steve DeNeefe, Kevin Knight
    claim paper
    Read More »
    COLING
    1996
    131views Computational Linguistics» more  COLING 1996»
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    13 years 6 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 »
    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.