Results 51 to 60 of about 17,493 (90)
ParsecCore: A parser combinator library in the C# language
, 2023 In this thesis, we implement a parser combinator library in C# inspired by Parsec. Parser combinators refer to a style of parsing where a parser is modeled as function from string to some structured result.
Tichý, Michal
core
"gnparser": a powerful parser for scientific names based on Parsing Expression Grammar. [PDF]
BMC Bioinformatics, 2017 Mozzherin DY, Myltsev AA, Patterson DJ.
europepmc +1 more source
chemf: A purely functional chemistry toolkit. [PDF]
J Cheminform, 2012 Höck S, Riedl R.
europepmc +1 more source
"cba to check the spelling" investigating parser performance on discussion forum posts [PDF]
, 2010 We evaluate the Berkeley parser on text from an online discussion forum. We evaluate the parser output with and without gold tokens and spellings (using Sparseval and Parseval), and we compile a list of problematic phenomena for this domain.
Foster, Jennifer
core
A high-level language for rule-based modelling. [PDF]
PLoS One, 2015 Pedersen M, Phillips A, Plotkin GD.
europepmc +1 more source
Storage costs and heuristics interact to produce patterns of aphasic sentence comprehension performance. [PDF]
Front Psychol, 2012 Clark DG.
europepmc +1 more source
Neuro-symbolic NLP: taxonomy, assessment, and directions. [PDF]
Front Artif IntellChatzikyriakidis S, Lappin S.
europepmc +1 more source
NP-Completeness of a combinator optimisation problem [PDF]
We consider a deterministic rewrite system for combinatory logic over combinators S, K, I, B, C, S', B' and C'. Terms will be represented by graphs so that reduction of a duplicator will cause the duplicated expression to be "shared" rather than copied ...
Rayward-Smith, V. J., Joy, Mike
core
, 2004 The tedium of writing pickling and unpickling functions by hand is relieved using a combinator library similar in spirit to the well-known parser combinators.
Andrew J. Kennedy
core