Results 21 to 30 of about 147 (106)
Parser combination by reparsing [PDF]
Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX - NAACL '06, 2006 We present a novel parser combination scheme that works by reparsing input sentences once they have already been parsed by several different parsers. We apply this idea to dependency and constituent parsing, generating results that surpass state-of-the-art accuracy levels for individual parsers.
Alon Lavie, Kenji Sagae
openaire +2 more sources
K-best combination of syntactic parsers [PDF]
Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 3 - EMNLP '09, 2009 In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previous system combination and re-ranking techniques in parsing by integrating them into a linear model.
Min Zhang +3 more
openaire +2 more sources
Combining Czech Dependency Parsers [PDF]
, 2006 In this paper we describe in detail two dependency parsing techniques developed and evaluated using the Prague Dependency Treebank 2.0 Then we propose two approaches for combining various existing parsers in order to obtain better accuracy The highest parsing accuracy reported in this paper is 85.84 %, which represents 1.86 % improvement compared to ...
Zdeněk Žabokrtský, Tomáš Holan
openaire +2 more sources
Improving parsing accuracy by combining diverse dependency parsers [PDF]
Proceedings of the Ninth International Workshop on Parsing Technology - Parsing '05, 2005 This paper explores the possibilities of improving parsing results by combining outputs of several parsers. To some extent, we are porting the ideas of Henderson and Brill (1999) to the world of dependency structures. We differ from them in exploring context features more deeply.
Zdenėk Żabokrtsk'y, Daniel Zeman
openaire +2 more sources
An implementation of combined partial parser and morphosyntactic disambiguator [PDF]
Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop on - ACL '07, 2007 The aim of this paper is to present a simple yet efficient implementation of a tool for simultaneous rule-based morphosyntactic tagging and partial parsing formalism. The parser is currently used for creating a tree-bank of partial parses in a valency acquisition project over the IPI PAN Corpus of Polish.
openaire +2 more sources
Comparing and combining finite-state and context-free parsers [PDF]
Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05, 2005 In this paper, we look at comparing high-accuracy context-free parsers with high-accuracy finite-state (shallow) parsers on several shallow parsing tasks. We show that previously reported comparisons greatly under-estimated the performance of context-free parsers for these tasks.
Kristy Hollingshead +2 more
openaire +2 more sources
Syntactic parser combination for improved dependency analysis [PDF]
Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data - ROMAND '04, 2004 The goal of this article is to present our work about a combination of several syntactic parsers to produce a more robust parser. We have built a platform which allows us to compare syntactic parsers for a given language by splitting their results in elementary pieces, normalizing them, and comparing them with reference results.
openaire +2 more sources
byteparsing: a functional parser combinator for mixed ASCII/binary data [PDF]
, 2023 Johan Hidding +1 more
openalex +1 more source
Emotion Analysis of Cross-Media Writing Text in the Context of Big Data. [PDF]
Front Psychol, 2022 Ren R.
europepmc +1 more source
Parsley: optimising and improving parser combinators
, 2023 Parser combinators are a functional abstraction for parsing that abstracts hand-written recursive-descent parsers behind a high-level set of combinators. While these kinds of parsers are popular in the functional programming community, they have been historically criticised: * Parser combinator performance is sub-par compared with handwritten parsers. *
openaire +2 more sources