Results 31 to 40 of about 82,171 (148)
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.
Kenji Sagae, Alon Lavie
openaire +1 more source
Happy-GLL: modular, reusable and complete top-down parsers for parameterized nonterminals [PDF]
arXiv.org, 2023 Parser generators and parser combinator libraries are the most popular tools for producing parsers. Parser combinators use the host language to provide reusable components in the form of higher-order functions with parsers as parameters.
L. T. V. Binsbergen, Damian Frölich
semanticscholar +1 more source
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
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
Parser combinators for Tigrinya and Oromo morphology
, 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.
Patrick Littell +7 more
openalex +2 more sources
Matching objects without language extension [PDF]
, 2006 Pattern matching is a powerful programming concept which has proven its merits in declarative programming. The absence of pattern-matching in object-oriented programming languages is felt especially when tackling source code processing problems.
Visser, Joost
core +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.
Hui Zhang +3 more
openaire +1 more source
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Bernardy, Jean-Philippe, Jansson, Patrik
core +2 more sources
Error Reporting in Parsing Expression Grammars
, 2016 Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow ...
Ierusalimschy, Roberto +3 more
core +1 more source
Verified Subtyping with Traits and Mixins
, 2014 Traits allow decomposing programs into smaller parts and mixins are a form of composition that resemble multiple inheritance. Unfortunately, in the presence of traits, programming languages like Scala give up on subtyping relation between objects.
Sharma, Asankhaya
core +4 more sources