Results 51 to 60 of about 296,979 (166)

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

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  

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

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

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

Efficient combinator parsing for natural-language. [PDF]

, 2006
Rahmatullah Hafiz
openalex   +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

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), Pace, Gordon J.   +1 more
core  

explanation-based learning of data oriented parsing [PDF]

arXiv, 1997
This paper presents a new view of Explanation-Based Learning (EBL) of natural language parsing. Rather than employing EBL for specializing parsers by inferring new ones, this paper suggests employing EBL for learning how to reduce ambiguity only partially.
arxiv  

Exploiting Diversity for Natural Language Parsing [PDF]

arXiv, 2000
The popularity of applying machine learning methods to computational linguistics problems has produced a large supply of trainable natural language processing systems. Most problems of interest have an array of off-the-shelf products or downloadable code implementing solutions using various techniques. Where these solutions are developed independently,
arxiv