Sciweavers

    360 search results - page 13 / 72
    » Dependency Parsing
    Sort
    View
    ACL
    2007
    97views Computational Linguistics» more  ACL 2007»
    Japanese Dependency Parsing Using Sequential Labeling for Semi-spoken Language
    13 years 9 months ago
    Japanese Dependency Parsing Using Sequential Labeling for Semi-spoken Language
    Download  acl.ldc.upenn.edu
    The amount of documents directly published by end users is increasing along with the growth of Web 2.0. Such documents often contain spoken-style expressions, which are difficult...
    Kenji Imamura, Gen-ichiro Kikui, Norihito Yasuda
    claim paper
    Read More »
    ACL
    2009
    102views Computational Linguistics» more  ACL 2009»
    Incremental Parsing with Monotonic Adjoining Operation
    13 years 5 months ago
    Incremental Parsing with Monotonic Adjoining Operation
    Download  www.aclweb.org
    This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
    Yoshihide Kato, Shigeki Matsubara
    claim paper
    Read More »
    ACL
    2006
    138views Computational Linguistics» more  ACL 2006»
    Annotation Schemes and their Influence on Parsing Results
    13 years 9 months ago
    Annotation Schemes and their Influence on Parsing Results
    Download  acl.ldc.upenn.edu
    Most of the work on treebank-based statistical parsing exclusively uses the WallStreet-Journal part of the Penn treebank for evaluation purposes. Due to the presence of this quasi...
    Wolfgang Maier
    claim paper
    Read More »
    COLING
    1996
    90views Computational Linguistics» more  COLING 1996»
    Restricted Parallelism in Object-Oriented Lexical Parsing
    13 years 9 months ago
    Restricted Parallelism in Object-Oriented Lexical Parsing
    Download  acl.ldc.upenn.edu
    We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm f...
    Peter Neuhaus, Udo Hahn
    claim paper
    Read More »
    NAACL
    2010
    238views Computational Linguistics» more  NAACL 2010»
    An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
    13 years 5 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 »
    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.