Sciweavers

    NAACL
    2010
    149views Computational Linguistics» more  NAACL 2010»
    Cheap, Fast and Good Enough: Automatic Speech Recognition with Non-Expert Transcription
    13 years 9 months ago
    Cheap, Fast and Good Enough: Automatic Speech Recognition with Non-Expert Transcription
    Download  www.cs.jhu.edu
    Deploying an automatic speech recognition system with reasonable performance requires expensive and time-consuming in-domain transcription. Previous work demonstrated that non-pro...
    Scott Novotney, Chris Callison-Burch
    claim paper
    Read More »
    NAACL
    2010
    113views Computational Linguistics» more  NAACL 2010»
    Automatic Metaphor Interpretation as a Paraphrasing Task
    13 years 9 months ago
    Automatic Metaphor Interpretation as a Paraphrasing Task
    Download  aclweb.org
    We present a novel approach to metaphor interpretation and a system that produces literal paraphrases for metaphorical expressions. Such a representation is directly transferable ...
    Ekaterina Shutova
    claim paper
    Read More »
    NAACL
    2010
    155views Computational Linguistics» more  NAACL 2010»
    Automatic Domain Adaptation for Parsing
    13 years 9 months ago
    Automatic Domain Adaptation for Parsing
    Download  nlp.stanford.edu
    Current statistical parsers tend to perform well only on their training domain and nearby genres. While strong performance on a few related domains is sufficient for many situatio...
    David McClosky, Eugene Charniak, Mark Johnson
    claim paper
    Read More »
    NAACL
    2010
    159views Computational Linguistics» more  NAACL 2010»
    Multi-document Summarization via Budgeted Maximization of Submodular Functions
    13 years 9 months ago
    Multi-document Summarization via Budgeted Maximization of Submodular Functions
    Download  ssli.ee.washington.edu
    We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
    Hui Lin, Jeff Bilmes
    claim paper
    Read More »
    NAACL
    2010
    136views Computational Linguistics» more  NAACL 2010»
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    13 years 9 months ago
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    Download  www.cs.rochester.edu
    Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
    Daniel Gildea
    claim paper
    Read More »
    NAACL
    2010
    149views Computational Linguistics» more  NAACL 2010»
    The Effect of Ambiguity on the Automated Acquisition of WSD Examples
    13 years 9 months ago
    The Effect of Ambiguity on the Automated Acquisition of WSD Examples
    Download  www.aclweb.org
    Several methods for automatically generating labeled examples that can be used as training data for WSD systems have been proposed, including a semisupervised approach based on re...
    Mark Stevenson, Yikun Guo
    claim paper
    Read More »
    NAACL
    2010
    154views Computational Linguistics» more  NAACL 2010»
    Multi-Prototype Vector-Space Models of Word Meaning
    13 years 9 months ago
    Multi-Prototype Vector-Space Models of Word Meaning
    Download  www.cs.utexas.edu
    Current vector-space models of lexical semantics create a single "prototype" vector to represent the meaning of a word. However, due to lexical ambiguity, encoding word ...
    Joseph Reisinger, Raymond J. Mooney
    claim paper
    Read More »
    NAACL
    2010
    238views Computational Linguistics» more  NAACL 2010»
    An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
    13 years 9 months ago
    An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
    Download  www.cs.bgu.ac.il
    We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
    Yoav Goldberg, Michael Elhadad
    claim paper
    Read More »
    NAACL
    2010
    169views Computational Linguistics» more  NAACL 2010»
    The Simple Truth about Dependency and Phrase Structure Representations: An Opinion Piece
    13 years 9 months ago
    The Simple Truth about Dependency and Phrase Structure Representations: An Opinion Piece
    Download  www.aclweb.org
    There are many misconceptions about dependency representations and phrase structure representations for syntax. They are partly due to terminological confusion, partly due to a la...
    Owen Rambow
    claim paper
    Read More »
    NAACL
    2010
    152views Computational Linguistics» more  NAACL 2010»
    Why Synchronous Tree Substitution Grammars?
    13 years 9 months ago
    Why Synchronous Tree Substitution Grammars?
    Download  www.aclweb.org
    Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
    Andreas Maletti
    claim paper
    Read More »
    « first‹ previous123456789…next ›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.