Results 31 to 40 of about 296,979 (166)
Combining constituent parsers [PDF]
Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers on - NAACL '09, 2009 Combining the 1-best output of multiple parsers via parse selection or parse hybridization improves f-score over the best individual parser (Henderson and Brill, 1999; Sagae and Lavie, 2006). We propose three ways to improve upon existing methods for parser combination.
Victoria Fossum, Kevin Knight
openaire +2 more sources
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
Explicitly recursive grammar combinators: a better model for shallow parser DSLs
International Symposium on Practical Aspects of Declarative Languages, 2011 Dominique Devriese, Frank Piessens
openalex +2 more sources
Action semantics in retrospect [PDF]
, 2009 This paper is a themed account of the action semantics project, which Peter Mosses has led since the 1980s. It explains his motivations for developing action semantics, the inspirations behind its design, and the foundations of action semantics based on ...
D.A. Watt +13 more
core +1 more source
Purely functional GLL parsing [PDF]
, 2020 Generalised parsing has become increasingly important in the context of software language design and several compiler generators and language workbenches have adopted generalised parsing algorithms such as GLR and GLL. The original GLL parsing algorithms
Johnstone, Adrian +2 more
core +2 more sources
Memoizing a monadic mixin DSL [PDF]
, 2011 Modular extensibility is a highly desirable property of a domain-specific language (DSL): the ability to add new features without affecting the implementation of existing features.
Samulowitz, Horst +4 more
core +1 more source
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
Montague Grammar Induction [PDF]
, 2021 We propose a computational model for inducing full-fledged combinatory categorial grammars from behavioral data. This model contrasts with prior computational models of selection in representing syntactic and semantic types as structured (rather than ...
Kim, Gene Louis, White, Aaron Steven
core +2 more sources
A Verified Packrat Parser Interpreter for Parsing Expression Grammars [PDF]
, 2020 Parsing expression grammars (PEGs) offer a natural opportunity for building verified parser interpreters based on higher-order parsing combinators. PEGs are expressive, unambiguous, and efficient to parse in a top-down recursive descent style. We use the rich type system of the PVS specification language and verification system to formalize the ...
arxiv +1 more source
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