Results 11 to 20 of about 17,493 (90)
Monadic parser combinators [PDF]
, 1996 In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition.
Hutton, Graham, Meijer, Erik
core +14 more sources
Parsley: optimising and improving parser combinators
, 2023 Parser combinators are a functional abstraction for parsing that abstracts hand-written recursive-descent parsers behind a high-level set of combinators. While these kinds of parsers are popular in the functional programming community, they have been historically criticised: * Parser combinator performance is sub-par compared with handwritten parsers. *
Willis, Jamie
openaire +3 more sources
Parser combinators in Scala [PDF]
, 2008 Parser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are implemented as a library in Scala, a functional object-oriented language. Thanks to Scala's flexible syntax, we are able to closely approximate the EBNF notation supported by dedicated parser generators. For the uninitiated, we
Moors, Adriaan +2 more
openaire +2 more sources
Lazy Functional Parser Combinators in Java [PDF]
, 2001 A parser is a program that checks if a text is a sentence of the language as described by a grammar. Traditionally, the program text of a parser is generated from a grammar description, after which it is compiled and subsequently run. The language accepted by such a parser is, by the nature of this process, hardcoded in the program.
Swierstra, D.S., Dijkstra, A.
openaire +5 more sources
Modeling Structure‐Building in the Brain With CCG Parsing and Large Language Models
Cognitive Science, Volume 47, Issue 7, July 2023., 2023 Abstract To model behavioral and neural correlates of language comprehension in naturalistic environments, researchers have turned to broad‐coverage tools from natural‐language processing and machine learning. Where syntactic structure is explicitly modeled, prior work has relied predominantly on context‐free grammars (CFGs), yet such formalisms are ...
Miloš Stanojević +4 more
wiley +1 more source
Parsing Chinese with Combinatory Categorial Grammar: A Linguistic and Computational Study
Complexity, Volume 2022, Issue 1, 2022., 2022 Parsing Chinese language with CCG is very difficult because the architecture and assumptions of CCG do not fit well with facts from Chinese. Based on the concept of “realization” proposed by Zhu Dexi (1920–1992), this study sheds light on the discrepancy between CCG and Chinese syntax and puts forward a refined schema for Chinese compositionality.
Haixia Man +4 more
wiley +1 more source
Combining constituent parsers [PDF]
Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers on - NAACL '09, 2009 Combining the 1-best output of multiple parsers via parse selection or parse hybridization improves f-score over the best individual parser (Henderson and Brill, 1999; Sagae and Lavie, 2006). We propose three ways to improve upon existing methods for parser combination.
Victoria Fossum, Kevin Knight
openaire +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 ...
Tomás Holan, Zdenek Zabokrtský
openaire +2 more sources
FliPpr: A Prettier Invertible Printing System [PDF]
, 2013 When implementing a programming language, we often write a parser and a pretty-printer. However, manually writing both programs is not only tedious but also error-prone; it may happen that a pretty-printed result is not correctly parsed. In this paper,
Wang, Meng, +4 more
core +1 more source
Lightweight multi-language syntax transformation with parser parser combinators [PDF]
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019 Automatically transforming programs is hard, yet critical for automated program refactoring, rewriting, and repair. Multi-language syntax transformation is especially hard due to heterogeneous representations in syntax, parse trees, and abstract syntax trees (ASTs).
Rijnard van Tonder, Claire Le Goues
openaire +1 more source