Results 91 to 100 of about 296,979 (166)
Compiling a domain specific language for dynamic programming [PDF]
, 2006 Steffen P. Compiling a domain specific language for dynamic programming.
Steffen, Peter
core +1 more source
Error Reporting in Parsing Expression Grammars [PDF]
arXiv, 2014 Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow simulated.
arxiv
Better, Faster, Stronger Sequence Tagging Constituent Parsers [PDF]
arXiv, 2019 Sequence tagging models for constituent parsing are faster, but less accurate than other types of parsers. In this work, we address the following weaknesses of such constituent parsers: (a) high error rates around closing brackets of long constituents, (b) large label sets, leading to sparsity, and (c) error propagation arising from greedy decoding. To
arxiv
A tool written in Scala for preparation and analysis in MD simulation and 3D-RISM calculation of biomolecules. [PDF]
Biophys Physicobiol, 2019 Onishi I, Tsuji H, Irisa M.
europepmc +1 more source
Archetype Model-Driven Development Framework for EHR Web System. [PDF]
Healthc Inform Res, 2013 Kobayashi S, Kimura E, Ishihara K.
europepmc +1 more source
Task-based parser output combination : workflow and infrastructure
, 2018 This dissertation introduces the method of task-based parser output combination as a device to enhance the reliability of automatically generated syntactic information for further processing tasks. Parsers, i.e. tools generating syntactic analyses, are usually based on reference data. Typically these are modern news texts.
openaire +3 more sources
Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version) [PDF]
arXivWe present Dependent Lambek Calculus, a domain-specific dependent type theory for verified parsing and formal grammar theory. In $\textrm{Lambek}^D$, linear types are used as a syntax for formal grammars,and parsers can be written as linear terms. The linear typing restriction provides a form of intrinsic verification that a parser yields only valid ...
arxiv
Hindi CCGbank: A CCG treebank from the Hindi dependency treebank. [PDF]
Lang Resour Eval, 2018 Ambati BR, Deoskar T, Steedman M.
europepmc +1 more source
GLL parsing with flexible combinators [PDF]
, 2018 L. Thomas van Binsbergen +2 more
openalex +1 more source
Program extraction applied to monadic parsing [PDF]
, 2015 Monika Seisenberger, Ulrich Berger
core +1 more source