Results 61 to 70 of about 169,488 (224)
Joint Syntacto-Discourse Parsing and the Syntacto-Discourse Treebank
, 2017 Discourse parsing has long been treated as a stand-alone problem independent from constituency or dependency parsing. Most attempts at this problem are pipelined rather than end-to-end, sophisticated, and not self-contained: they assume gold-standard ...
Huang, Liang, Zhao, Kai
core +1 more source
Turku Neural Parser Pipeline: An End-to-End System for the CoNLL 2018 Shared Task
Conference on Computational Natural Language Learning, 2018 In this paper we describe the TurkuNLP entry at the CoNLL 2018 Shared Task on Multilingual Parsing from Raw Text to Universal Dependencies. Compared to the last year, this year the shared task includes two new main metrics to measure the morphological ...
Jenna Kanerva +4 more
semanticscholar +1 more source
Towards case-based parsing : are chunks reliable indicators for syntax trees? [PDF]
, 2006 This paper presents an approach to the question whether it is possible to construct a parser based on ideas from case-based reasoning. Such a parser would employ a partial analysis of the input sentence to select a (nearly) complete syntax tree and then ...
Kübler, Sandra
core
QuestionBank: creating a corpus of parse-annotated questions [PDF]
, 2006 This paper describes the development of QuestionBank, a corpus of 4000 parse-annotated questions for (i) use in training parsers employed in QA, and (ii) evaluation of question parsing. We present a series of experiments to investigate the effectiveness
Cahill, Aoife +2 more
core +2 more sources
Incremental Parser Generation for Tree Adjoining Grammars
, 1998 This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far.
Sarkar, Anoop
core +1 more source
Unsupervised Dependency Parsing: Let's Use Supervised Parsers
, 2015 We present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms. Our approach, called `iterated reranking' (IR), starts with dependency trees generated by an unsupervised parser ...
Le, Phong, Zuidema, Willem
core +1 more source
Lightweight multi-language syntax transformation with parser parser combinators [PDF]
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019 Automatically transforming programs is hard, yet critical for automated program refactoring, rewriting, and repair. Multi-language syntax transformation is especially hard due to heterogeneous representations in syntax, parse trees, and abstract syntax trees (ASTs).
Rijnard van Tonder, Claire Le Goues
openaire +1 more source
Parser Combinators: A Practical Application for Generating Parsers for NMR Data [PDF]
2013 10th International Conference on Information Technology: New Generations, 2013 Nuclear Magnetic Resonance (NMR) spectroscopy is a technique for acquiring protein data at atomic resolution and determining the three-dimensional structure of large protein molecules. A typical structure determination process results in the deposition of a large data sets to the BMRB (Bio-Magnetic Resonance Data Bank).
Matthew, Fenwick +3 more
openaire +2 more sources
COD::CIF::Parser: an error-correcting CIF parser for the Perl language
Journal of Applied Crystallography, 2016 A syntax-correcting CIF parser, COD::CIF::Parser, is described that can parse CIF 1.1 files and accurately report the position and nature of the discovered syntactic problems while automatically correcting the most common and the most obvious syntactic ...
Andrius Merkys +5 more
semanticscholar +1 more source
Low Resource Dependency Parsing: Cross-lingual Parameter Sharing in a Neural Network Parser
Annual Meeting of the Association for Computational Linguistics, 2015 Training a high-accuracy dependency parser requires a large treebank. However, these are costly and time-consuming to build. We propose a learning method that needs less data, based on the observation that there are underlying shared structures across ...
Long Duong +3 more
semanticscholar +1 more source