Results 21 to 30 of about 81,160 (150)
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
Automatic definition extraction using parser combinators [PDF]
, 2008 The automatic extraction of definitions from natural language texts has various applications such as the creation of glossaries and question-answering systems.
Claudia Borg, Gordon J. Pace
openalex +2 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
Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle [PDF]
Software Language Engineering, 2014 Tom Ridge
openalex +2 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 +2 more sources
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.
Alon Lavie, Kenji Sagae
openaire +2 more sources
Happy-GLL: modular, reusable and complete top-down parsers for parameterized nonterminals [PDF]
arXiv.org, 2023 Parser generators and parser combinator libraries are the most popular tools for producing parsers. Parser combinators use the host language to provide reusable components in the form of higher-order functions with parsers as parameters.
L. T. V. Binsbergen, Damian Frölich
semanticscholar +1 more source
Memoizing a monadic mixin DSL [PDF]
, 2011 Modular extensibility is a highly desirable property of a domain-specific language (DSL): the ability to add new features without affecting the implementation of existing features.
Samulowitz, Horst +4 more
core +1 more source