Sciweavers

    EACL
    1993
    ACL Anthology
    124views Natural Language Processing» more  EACL 1993»
    Ambiguity resolution in a reductionistic parser
    13 years 5 months ago
    Ambiguity resolution in a reductionistic parser
    Download  acl.ldc.upenn.edu
    We are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurallyunresolvable distinctionsin order to...
    Atro Voutilainen, Pasi Tapanainen
    claim paper
    Read More »
    ACL
    1996
    111views Computational Linguistics» more  ACL 1996»
    Chart Generation
    13 years 5 months ago
    Chart Generation
    Download  acl.ldc.upenn.edu
    Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures ar...
    Martin Kay
    claim paper
    Read More »
    COLING
    2000
    74views Computational Linguistics» more  COLING 2000»
    Parsing Schemata for Grammars with Variable Number and Order of Constituents
    13 years 6 months ago
    Parsing Schemata for Grammars with Variable Number and Order of Constituents
    Download  acl.ldc.upenn.edu
    We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
    Karl-Michael Schneider
    claim paper
    Read More »
    COLING
    2000
    85views Computational Linguistics» more  COLING 2000»
    An Experiment On Incremental Analysis Using Robust Parsing Techniques
    13 years 6 months ago
    An Experiment On Incremental Analysis Using Robust Parsing Techniques
    Download  acl.ldc.upenn.edu
    The results of an experiment are presented in which an approach for robust parsing has been applied incrementally. They confirm that due to the robust nature of the underlying tec...
    Kilian A. Foth, Wolfgang Menzel, Horia F. Pop, Ing...
    claim paper
    Read More »
    ANLP
    2000
    96views more  ANLP 2000»
    Efficient parsing strategies for syntactic analysis of closed captions
    13 years 6 months ago
    Efficient parsing strategies for syntactic analysis of closed captions
    Download  acl.ldc.upenn.edu
    We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...
    Krzysztof Czuba
    claim paper
    Read More »
    NAACL
    2003
    97views Computational Linguistics» more  NAACL 2003»
    A low-complexity, broad-coverage probabilistic Dependency Parser for English
    13 years 6 months ago
    A low-complexity, broad-coverage probabilistic Dependency Parser for English
    Download  acl.ldc.upenn.edu
    Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this ...
    Gerold Schneider
    claim paper
    Read More »
    IWPT
    2001
    105views System Software» more  IWPT 2001»
    Parsing the CHILDES Database: Methodology and Lessons Learned
    13 years 6 months ago
    Parsing the CHILDES Database: Methodology and Lessons Learned
    Download  www.cs.cmu.edu
    This paper discusses the process of parsing adult utterances directed to a child, in an effort to produce a syntactically annotated corpus of the verbal input to a human language ...
    Kenji Sagae, Alon Lavie, Brian MacWhinney
    claim paper
    Read More »
    EACL
    2003
    ACL Anthology
    129views Natural Language Processing» more  EACL 2003»
    Topological Parsing
    13 years 6 months ago
    Topological Parsing
    Download  www.cs.toronto.edu
    We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
    Gerald Penn, Mohammad Haji-Abdolhosseini
    claim paper
    Read More »
    EMNLP
    2006
    84views Natural Language Processing» more  EMNLP 2006»
    Is it Really that Difficult to Parse German?
    13 years 6 months ago
    Is it Really that Difficult to Parse German?
    Download  jones.ling.indiana.edu
    This paper presents a comparative study of probabilistic treebank parsing of German, using the Negra and T
    Sandra Kübler, Erhard W. Hinrichs, Wolfgang M...
    claim paper
    Read More »
    EACL
    2006
    ACL Anthology
    120views Natural Language Processing» more  EACL 2006»
    Online Learning of Approximate Dependency Parsing Algorithms
    13 years 6 months ago
    Online Learning of Approximate Dependency Parsing Algorithms
    Download  www.seas.upenn.edu
    In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
    Ryan T. McDonald, Fernando C. N. Pereira
    claim paper
    Read More »
    « first‹ previous12345678next ›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.