Sciweavers

    8 search results - page 1 / 2
    » Prefix Probabilities from Stochastic Tree Adjoining Grammars
    Sort
    View
    ACL
    1998
    90views Computational Linguistics» more  ACL 1998»
    Prefix Probabilities from Stochastic Tree Adjoining Grammars
    14 years 6 days ago
    Prefix Probabilities from Stochastic Tree Adjoining Grammars
    Download  acl.ldc.upenn.edu
    Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
    claim paper
    Read More »
    EMNLP
    2009
    140views Natural Language Processing» more  EMNLP 2009»
    Synchronous Tree Adjoining Machine Translation
    13 years 8 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
    14 years 5 days 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 »
    ACL
    1998
    113views Computational Linguistics» more  ACL 1998»
    Conditions on Consistency of Probabilistic Tree Adjoining Grammars
    14 years 6 days ago
    Conditions on Consistency of Probabilistic Tree Adjoining Grammars
    Download  www.cs.sfu.ca
    Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
    Anoop Sarkar
    claim paper
    Read More »
    NLP
    2000
    174views Natural Language Processing» more  NLP 2000»
    Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
    14 years 2 months ago
    Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
    Download  liawww.epfl.ch
    Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
    Jean-Cédric Chappelier, Martin Rajman
    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.