Results 1 to 10 of about 64 (62)
Parser Combinators: A Practical Application for Generating Parsers for NMR Data [PDF]
2013 10th International Conference on Information Technology: New Generations, 2013 Nuclear Magnetic Resonance (NMR) spectroscopy is a technique for acquiring protein data at atomic resolution and determining the three-dimensional structure of large protein molecules. A typical structure determination process results in the deposition of a large data sets to the BMRB (Bio-Magnetic Resonance Data Bank).
Matthew, Fenwick +3 more
openaire +3 more sources
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 +1 more source
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
Staged selective parser combinators [PDF]
Proceedings of the ACM on Programming Languages, 2020 Parser combinators are a middle ground between the fine control of hand-rolled parsers and the high-level almost grammar-like appearance of parsers created via parser generators. They also promote a cleaner, compositional design for parsers. Historically, however, they cannot match the performance of their counterparts.
Jamie Willis +2 more
openaire +3 more sources
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
Practical, general parser combinators [PDF]
Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2016 Parser combinators are a popular approach to parsing where context-free grammars are represented as executable code. However, conventional parser combinators do not support left recursion, and can have worst-case exponential runtime. These limitations hinder the expressivity and performance predictability of parser combinators when constructing parsers
Anastasia Izmaylova +2 more
openaire +1 more source
Parser combination by reparsing [PDF]
Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX - NAACL '06, 2006 We present a novel parser combination scheme that works by reparsing input sentences once they have already been parsed by several different parsers. We apply this idea to dependency and constituent parsing, generating results that surpass state-of-the-art accuracy levels for individual parsers.
Kenji Sagae, Alon Lavie
openaire +1 more source
Design patterns for parser combinators (functional pearl) [PDF]
Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell, 2021 Parser combinators are a popular and elegant approach for parsing in functional languages. The design and implementation of such libraries are well discussed, but having a well-designed library is only one-half of the story. In this paper we explore several reusable approaches to writing parsers in combinator style, focusing on easy to apply patterns ...
Jamie Willis, Nicolas Wu
openaire +2 more sources
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