Results 41 to 50 of about 81,160 (150)

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  

Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms

, 2019
We introduce Meta-F*, a tactics and metaprogramming framework for the F* program verifier. The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well ...
Ahman, Danel, Dumitrescu, Victor, Giannarakis, Nick, Hawblitzel, Chris, Hritcu, Catalin, Martínez, Guido, Narasimhamurthy, Monal, Paraskevopoulou, Zoe, Pit-Claudel, Clément, Protzenko, Jonathan, Ramananandro, Tahina, Rastogi, Aseem, Swamy, Nikhil   +12 more
core   +2 more sources

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

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

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

How functional programming mattered [PDF]

, 2015
In 1989 when functional programming was still considered a niche topic, Hughes wrote a visionary paper arguing convincingly ‘why functional programming matters’. More than two decades have passed. Has functional programming really mattered? Our answer is
Abelson, Armstrong, Armstrong, Arts, Arts, Axelsson, Baars, Backus, Bahr, Barthe, Bertot, Bird, Bird, Bird, Bird, Bird RS Moor, Blelloch, Blelloch, Bringert, Carette, Chakravarty, Chakravarty MMT Leshchinskiy, Chetali, Chin, Claessen, Claessen, Cole, Cole, de Moor, Dean, Devriese, Dijkstra, Dybvig, Elliott, Elliott, Epstein, Farmer, Fegaras, Felleisen, Ford, Gibbons, Gibbons, Gill, Halloway, Hammond, Hansen MR Rischel, Harris, Hinze, Hinze, Hu, Hu, Hu, Hu, Hu, Hudak, Hudak, Hudak, Hudak, Hudak, Hudak, Hughes, Hughes, Hughes, Hughes JM Bolinder, Hutton, Hutton, Jones, Katayama, Katayama, Kiselyov, Launchbury, Launchbury, Leijen, Leroy, Liang, Lindley, Loidl HW Rubio, Matsuzaki, Mcbride, Meijer, Meijer, Milner, Minsky, Minsky, Moggi, Moggi, Morita, Mu, Naiman, Norell, Odersky, Oliveira BCS Moors, Paterson, Paulson, Persson, Peyton Jones, Peyton Jones, Peyton Jones SL Wadler, Reynolds, Sagonas, Schrijvers, Sculthorpe, Seibel, Sheard, Skillicorn, Smith, Snyder, Steele, Steele, Svenningsson, Svenningsson, Swierstra, Swierstra SD Duponcheel, Takano, Takano, Tesson, Wadler, Wadler, Wadler, Wadler, Wampler, Yang   +121 more
core   +1 more source

Constructing applicative functors [PDF]

, 2012
Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads. First used in parser libraries, they are now seeing a wide range of applications.
A.I. Baars, C. McBride, J. Hughes, J. Lambek, J. Voigtländer, K. Matlage, M. Abbott, P. Johann, P. Wadler, R. Atkey, R. Hinze, S.D. Swierstra, S.M. Lane   +12 more
core   +2 more sources

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

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

Constraint Generation for the Jeeves Privacy Language [PDF]

, 2014
Our goal is to present a completed, semantic formalization of the Jeeves privacy language evaluation engine, based on the original Jeeves constraint semantics defined by Yang et al at POPL12, but sufficiently strong to support a first complete ...
Rose, Eva
core