Sciweavers

    ACL
    2012
    191views Computational Linguistics» more  ACL 2012»
    Tokenization: Returning to a Long Solved Problem - A Survey, Contrastive Experiment, Recommendations, and Toolkit -
    12 years 2 months ago
    Tokenization: Returning to a Long Solved Problem - A Survey, Contrastive Experiment, Recommendations, and Toolkit -
    Download  aclweb.org
    We examine some of the frequently disregarded subtleties of tokenization in Penn Treebank style, and present a new rule-based preprocessing toolkit that not only reproduces the Tr...
    Rebecca Dridan, Stephan Oepen
    claim paper
    Read More »
    ACL
    2012
    182views Computational Linguistics» more  ACL 2012»
    Head-driven Transition-based Parsing with Top-down Prediction
    12 years 2 months ago
    Head-driven Transition-based Parsing with Top-down Prediction
    Download  cl.naist.jp
    This paper presents a novel top-down headdriven parsing algorithm for data-driven projective dependency analysis. This algorithm handles global structures, such as clause and coor...
    Katsuhiko Hayashi, Taro Watanabe, Masayuki Asahara...
    claim paper
    Read More »
    ACL
    2011
    198views Computational Linguistics» more  ACL 2011»
    Using Large Monolingual and Bilingual Corpora to Improve Coordination Disambiguation
    13 years 4 months ago
    Using Large Monolingual and Bilingual Corpora to Improve Coordination Disambiguation
    Download  www.clsp.jhu.edu
    Resolving coordination ambiguity is a classic hard problem. This paper looks at coordination disambiguation in complex noun phrases (NPs). Parsers trained on the Penn Treebank are...
    Shane Bergsma, David Yarowsky, Kenneth Ward Church
    claim paper
    Read More »
    EMNLP
    2009
    136views Natural Language Processing» more  EMNLP 2009»
    Improving Dependency Parsing with Subtrees from Auto-Parsed Data
    13 years 10 months ago
    Improving Dependency Parsing with Subtrees from Auto-Parsed Data
    Download  www.aclweb.org
    This paper presents a simple and effective approach to improve dependency parsing by using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale una...
    Wenliang Chen, Jun'ichi Kazama, Kiyotaka Uchimoto,...
    claim paper
    Read More »
    EMNLP
    2010
    130views Natural Language Processing» more  EMNLP 2010»
    Utilizing Extra-Sentential Context for Parsing
    13 years 10 months ago
    Utilizing Extra-Sentential Context for Parsing
    Download  www.aclweb.org
    Syntactic consistency is the preference to reuse a syntactic construction shortly after its appearance in a discourse. We present an analysis of the WSJ portion of the Penn Treeba...
    Jackie Chi Kit Cheung, Gerald Penn
    claim paper
    Read More »
    ACL
    2010
    165views Computational Linguistics» more  ACL 2010»
    Efficient Third-Order Dependency Parsers
    13 years 10 months ago
    Efficient Third-Order Dependency Parsers
    Download  www.aclweb.org
    We present algorithms for higher-order dependency parsing that are "third-order" in the sense that they can evaluate substructures containing three dependencies, and &qu...
    Terry Koo, Michael Collins
    claim paper
    Read More »
    EMNLP
    2006
    128views Natural Language Processing» more  EMNLP 2006»
    Learning Phrasal Categories
    14 years 1 months ago
    Learning Phrasal Categories
    Download  www.cs.brown.edu
    In this work we learn clusters of contextual annotations for non-terminals in the Penn Treebank. Perhaps the best way to think about this problem is to contrast our work with that...
    William P. Headden III, Eugene Charniak, Mark John...
    claim paper
    Read More »
    ACL
    2006
    127views Computational Linguistics» more  ACL 2006»
    Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
    14 years 1 months ago
    Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
    Download  acl.ldc.upenn.edu
    This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
    Helmut Schmid
    claim paper
    Read More »
    ACL
    2004
    112views Computational Linguistics» more  ACL 2004»
    Using Linguistic Principles to Recover Empty Categories
    14 years 1 months ago
    Using Linguistic Principles to Recover Empty Categories
    Download  acl.ldc.upenn.edu
    This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
    Richard Campbell
    claim paper
    Read More »
    NAACL
    2007
    98views Computational Linguistics» more  NAACL 2007»
    Language Modeling for Determiner Selection
    14 years 1 months ago
    Language Modeling for Determiner Selection
    Download  acl.ldc.upenn.edu
    We present a method for automatic determiner selection, based on an existing language model. We train on the Penn Treebank and also use additional data from the North American New...
    Jenine Turner, Eugene Charniak
    claim paper
    Read More »
    12next ›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.