Sciweavers

    NAACL
    2010
    130views Computational Linguistics» more  NAACL 2010»
    Products of Random Latent Variable Grammars
    13 years 9 months ago
    Products of Random Latent Variable Grammars
    Download  www.petrovi.de
    We show that the automatically induced latent variable grammars of Petrov et al. (2006) vary widely in their underlying representations, depending on their EM initialization point...
    Slav Petrov
    claim paper
    Read More »
    NAACL
    2010
    144views Computational Linguistics» more  NAACL 2010»
    Towards Cross-Lingual Textual Entailment
    13 years 9 months ago
    Towards Cross-Lingual Textual Entailment
    Download  www.aclweb.org
    This paper investigates cross-lingual textual entailment as a semantic relation between two text portions in different languages, and proposes a prospective research direction. We...
    Yashar Mehdad, Matteo Negri, Marcello Federico
    claim paper
    Read More »
    NAACL
    2010
    146views Computational Linguistics» more  NAACL 2010»
    Improved Extraction Assessment through Better Language Models
    13 years 9 months ago
    Improved Extraction Assessment through Better Language Models
    Download  www.aclweb.org
    A variety of information extraction techniques rely on the fact that instances of the same relation are "distributionally similar," in that they tend to appear in simila...
    Arun Ahuja, Doug Downey
    claim paper
    Read More »
    NAACL
    2010
    134views Computational Linguistics» more  NAACL 2010»
    Context-free reordering, finite-state translation
    13 years 9 months ago
    Context-free reordering, finite-state translation
    Download  www.aclweb.org
    We describe a class of translation model in which a set of input variants encoded as a context-free forest is translated using a finitestate translation model. The forest structur...
    Christopher Dyer, Philip Resnik
    claim paper
    Read More »
    NAACL
    2010
    167views Computational Linguistics» more  NAACL 2010»
    Query Ambiguity Revisited: Clickthrough Measures for Distinguishing Informational and Ambiguous Queries
    13 years 9 months ago
    Query Ambiguity Revisited: Clickthrough Measures for Distinguishing Informational and Ambiguous Queries
    Download  www.mathcs.emory.edu
    Understanding query ambiguity in web search remains an important open problem. In this paper we reexamine query ambiguity by analyzing the result clickthrough data. Previously pro...
    Yu Wang, Eugene Agichtein
    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 9 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 »
    NAACL
    2010
    134views Computational Linguistics» more  NAACL 2010»
    Language Identification: The Long and the Short of the Matter
    13 years 9 months ago
    Language Identification: The Long and the Short of the Matter
    Download  www.aclweb.org
    Language identification is the task of identifying the language a given document is written in. This paper describes a detailed examination of what models perform best under diffe...
    Timothy Baldwin, Marco Lui
    claim paper
    Read More »
    NAACL
    2010
    123views Computational Linguistics» more  NAACL 2010»
    An MDL-based approach to extracting subword units for grapheme-to-phoneme conversion
    13 years 9 months ago
    An MDL-based approach to extracting subword units for grapheme-to-phoneme conversion
    Download  www.aclweb.org
    We address a key problem in grapheme-tophoneme conversion: the ambiguity in mapping grapheme units to phonemes. Rather than using single letters and phonemes as units, we propose ...
    Sravana Reddy, John A. Goldsmith
    claim paper
    Read More »
    NAACL
    2010
    168views Computational Linguistics» more  NAACL 2010»
    Appropriately Handled Prosodic Breaks Help PCFG Parsing
    13 years 9 months ago
    Appropriately Handled Prosodic Breaks Help PCFG Parsing
    Download  www.aclweb.org
    This paper investigates using prosodic information in the form of ToBI break indexes for parsing spontaneous speech. We revisit two previously studied approaches, one that hurt pa...
    Zhongqiang Huang, Mary P. Harper
    claim paper
    Read More »
    NAACL
    2010
    159views Computational Linguistics» more  NAACL 2010»
    Crowdsourcing the evaluation of a domain-adapted named entity recognition system
    13 years 9 months ago
    Crowdsourcing the evaluation of a domain-adapted named entity recognition system
    Download  www.cs.umd.edu
    Named entity recognition systems sometimes have difficulty when applied to data from domains that do not closely match the training data. We first use a simple rule-based techniqu...
    Asad B. Sayeed, Timothy J. Meyer, Hieu C. Nguyen, ...
    claim paper
    Read More »
    « first‹ previous…67891011121314next ›last »
    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.