Results 41 to 50 of about 80,039 (149)
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
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
Higher-Order Functions for Parsing [PDF]
, 1992 In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white-space, and parsers with separate lexical and syntactic phases. In particular,
Hutton, Graham
core
A typed, algebraic approach to parsing
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2019 In this paper, we recall the definition of the context-free expressions (or µ-regular expressions), an algebraic presentation of the context-free languages.
N. Krishnaswami, J. Yallop
semanticscholar +1 more source
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
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
Monadic compositional parsing with context using Maltese as a case study [PDF]
, 2004 Combinator-based parsing using functional programming provides an elegant, and compositional approach to parser design and development. By its very nature, sensitivity to context usually fails to be properly addressed in these approaches. We identify two
2nd Computer Science Annual Workshop (CSAW’04) +1 more
core
cclib 2.0: An updated architecture for interoperable computational chemistry.
Journal of Chemical PhysicsInteroperability in computational chemistry is elusive, impeded by the independent development of software packages and idiosyncratic nature of their output files.
Eric J. Berquist +16 more
semanticscholar +1 more source
'Galculator': functional prototype of a Galois-connection based proof assistant [PDF]
, 2008 Galculator is the name of the prototype of a proof assistant of a special brand: it is solely based on the algebra of Galois connections. When combined with the pointfree transform and tactics such as the indirect equality principle, Galois connections ...
Oliveira, José Nuno Fonseca +1 more
core +1 more source