Results 21 to 30 of about 82,171 (148)
Layered Combinator Parsers with a Unique State [PDF]
, 2001 Contains fulltext : 207908.pdf (Author’s version preprint ) (Open Access)
Pieter Koopman, M.J. Plasmeijer
openalex +2 more sources
Predictive parser combinators need four values to report errors [PDF]
Journal of functional programming, 1996 Andrew Partridge, David A. Wright
openalex +2 more sources
Explicitly Recursive Grammar Combinators A Better Model for Shallow Parser DSLs
International Symposium on Practical Aspects of Declarative Languages, 2011 Dominique Devriese, Frank Piessens
openalex +3 more sources
Design patterns for parser combinators in scala [PDF]
Proceedings of the Scala Symposium, 2022 Jamie Willis, Nicolas Wu
openalex +2 more sources
flap: A Deterministic Parser with Fused Lexing [PDF]
Proc. ACM Program. Lang., 2023 Lexers and parsers are typically defined separately and connected by a token stream. This separate definition is important for modularity and reduces the potential for parsing ambiguity. However, materializing tokens as data structures and case-switching
J. Yallop, Ningning Xie, N. Krishnaswami
semanticscholar +1 more source
Idris TyRE: a dependently typed regex parser [PDF]
arXiv.org, 2023 Regular expressions -- regexes -- are widely used not only for validating, but also for parsing textual data. Generally, regex parsers output a loose structure, e.g.
Ohad Kammar, Katarzyna Marek
semanticscholar +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
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
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