Results 11 to 20 of about 147 (106)
Efficient parsing with parser combinators
Science of Computer Programming, 2017 Parser combinators offer a universal and flexible approach to parsing. They follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, these advantages introduce a noticeable performance overhead mainly because the same powerful
Jan Kurš +4 more
openalex +5 more sources
Morpheus: Automated Safety Verification of Data-dependent Parser Combinator Programs
, 2023 41 ...
Ashish Mishra, Suresh Jagannathan
openalex +6 more sources
Predictive parser combinators need four values to report errors [PDF]
Journal of Functional Programming, 1996 AbstractA combinator-based parser is a parser constructed directly from a BNF grammar, using higher-order functions (combinators) to model the alternative and sequencing operations of BNF. This paper describes a method for constructing parser combinators that can be used to build efficient predictive parsers which accurately report the cause of parsing
Andrew Partridge, David A. Wright
openalex +4 more sources
Ramble: Parser Combinator for R
The Journal of Open Source Software, 2017 Chapman Siu
openalex +3 more sources
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.
Graham Hutton, Erik Meijer
+5 more sources
Lazy functional parser combinators in Java
, 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.
Doaitse Swierstra, Atze Dijkstra
openalex +4 more sources
Strategic Entrepreneurship Journal, Volume 17, Issue 4, Page 886-924, December 2023., 2023 Abstract Research Summary Recently, the venture capital (VC) industry has experienced the entry of several new capital providers. Using US data on investors and their portfolio startups from 2000 to 2022, we document the emergence of a new type of investors: the micro VC.
Mario Daniele Amore +2 more
wiley +1 more source
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