Sciweavers

    10 search results - page 1 / 2
    » Statistical Properties of Probabilistic Context-Free Grammar...
    Sort
    View
    COLING
    1999
    110views Computational Linguistics» more  COLING 1999»
    Statistical Properties of Probabilistic Context-Free Grammars
    13 years 4 months ago
    Statistical Properties of Probabilistic Context-Free Grammars
    Download  acl.ldc.upenn.edu
    Zhiyi Chi
    claim paper
    Read More »
    ACL
    2008
    119views Computational Linguistics» more  ACL 2008»
    Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
    13 years 6 months ago
    Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
    Download  www.aclweb.org
    Adaptor grammars (Johnson et al., 2007b) are a non-parametric Bayesian extension of Probabilistic Context-Free Grammars (PCFGs) which in effect learn the probabilities of entire s...
    Mark Johnson
    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 »
    EMNLP
    2004
    139views Natural Language Processing» more  EMNLP 2004»
    Bilingual Parsing with Factored Estimation: Using English to Parse Korean
    13 years 6 months ago
    Bilingual Parsing with Factored Estimation: Using English to Parse Korean
    Download  www.cs.cmu.edu
    We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...
    David A. Smith, Noah A. Smith
    claim paper
    Read More »
    ACL
    1998
    113views Computational Linguistics» more  ACL 1998»
    Conditions on Consistency of Probabilistic Tree Adjoining Grammars
    13 years 6 months 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 »
    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.