Results 21 to 30 of about 17,493 (90)

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.
Hui Zhang 0066, Min Zhang 0005, Chew Lim Tan, Haizhou Li 0001   +3 more
openaire   +2 more sources

Mímico: a monadic combinator parser generator [PDF]

Journal of the Brazilian Computer Society, 2003
This article describes a compiler generator, called Mimico, that outputs code based on the use of monadic combinators. Mimico can parse infinite look-ahead and left-recursive context free grammars and defines a scheme for handling the precedence and associativity of binary infix operators, and monadic code in semantic rules. Mimico provides an easy way
Carlos Camarão 0001, Lucília Figueiredo, Hermann Rodrigues   +2 more
openaire   +4 more sources

On the Usability of Reactive Programming APIs: A Mixed Evaluation

Software: Practice and Experience, Volume 55, Issue 9, Page 1506-1538, September 2025.
ABSTRACT Context Reactive Programming (RP) provides powerful abstractions for managing asynchronous and event‐driven behaviors, but its APIs are often perceived as complex and difficult to use, particularly due to their reliance on functional programming concepts. Objective This study investigates the usability of two prominent JavaScript RP libraries,
Carlos Zimmerle, Kiev Gama
wiley   +1 more source

Adapting a WSJ-trained parser to grammatically noisy text [PDF]

, 2008
We present a robust parser which is trained on a treebank of ungrammatical sentences. The treebank is created automatically by modifying Penn treebank sentences so that they contain one or more syntactic errors.
Jennifer Foster, Joachim Wagner, Foster, Jennifer, Wagner, Joachim, Josef van Genabith, van Genabith, Josef   +5 more
core   +3 more sources

Parser combinators for Tigrinya and Oromo morphology

Proceedings of the Language Resources and Evaluation Conference, 2018
We present rule-based morphological parsers in the Tigrinya and Oromo languages, based on a parser-combinator rather than finite-state paradigm. This paradigm allows rapid development and ease of integration with other systems, although at the cost of non-optimal theoretical efficiency.
Littell, Patrick, McCoy, Tom, Han, Na-Rae, Rijhwani, Shruti, Sheikh, Zaid, Mortensen, David, Mitamura, Teruko, Levin, Lori   +7 more
openaire   +3 more sources

Expressing disambiguation filters as combinators [PDF]

, 2020
Contrarily to most conventional programming languages where certain symbols are used so as to create non-ambiguous grammars, most recent programming languages allow ambiguity. These ambiguities are solved using disambiguation rules, which dictate how the
Saraiva, João, Macedo, José Nuno, José Nuno Macedo, João Saraiva   +3 more
core   +1 more source

Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators [PDF]

, 2008
Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages.
Minas, Mark, Steffen Mazanek, Mazanek, Steffen, Mark Minas   +3 more
core   +1 more source

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, Seeger Fisher, Brian Roark   +2 more
openaire   +2 more sources

Parser Combinators for Extraction

Proceedings of the Amsterdam Colloquium, 2003
Dislocation phenomena in natural language can be, and often are, thought of as the effects of movement transformations. We propose to handle these phenomena in terms of parser combinators [3, 8] that transform recursive descent parsers for a 'deep structure language' into parsers for a 'surface structure language'.
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.
Daniel Zeman, Zdenek Zabokrtský
openaire   +2 more sources