Results 31 to 40 of about 81,160 (150)
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
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
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
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
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
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
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
Parsing Expression Grammars Made Practical
, 2015 Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
Laurent, Nicolas, Mens, Kim
core +1 more source
Feat: Functional Enumeration of Algebraic Types [PDF]
, 2012 In mathematics, an enumeration of a set S is a bijective function from (an initial segment of) the natural numbers to S. We define "functional enumerations" as efficiently computable such bijections.
Duregard, Jonas +2 more
core +2 more sources