Results 51 to 60 of about 169,488 (224)
Training with Exploration Improves a Greedy Stack LSTM Parser [PDF]
Conference on Empirical Methods in Natural Language Processing, 2016 We adapt the greedy Stack-LSTM dependency parser of Dyer et al. (2015) to support a training-with-exploration procedure using dynamic oracles(Goldberg and Nivre, 2013) instead of cross-entropy minimization. This form of training, which accounts for model
Miguel Ballesteros +3 more
semanticscholar +1 more source
PDP: protein domain parser [PDF]
Bioinformatics, 2003 Abstract Summary: We have developed a program for automatic identification of domains in protein three-dimensional structures. Performance of the program was assessed by three different benchmarks: (i) by comparison with the expert-curated SCOP database of structural domains; (ii) by comparison with a collection of manual domain ...
Nickolai, Alexandrov, Ilya, Shindyalov
openaire +2 more sources
FliPpr: A Prettier Invertible Printing System [PDF]
, 2013 When implementing a programming language, we often write a parser and a pretty-printer. However, manually writing both programs is not only tedious but also error-prone; it may happen that a pretty-printed result is not correctly parsed. In this paper,
A. Kühnemann +11 more
core +3 more sources
Parsing Chinese with Combinatory Categorial Grammar: A Linguistic and Computational Study
Complexity, 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
Haixia Man +3 more
doaj +1 more source
IEEE Access, 2022 Fully data-driven, deep learning-based models are usually designed as language-independent and have been shown to be successful for many natural language processing tasks. However, when the studied language is not high-resource and the amount of training
Saziye Betul Ozates +3 more
doaj +1 more source
Structure before meaning: sentence processing, plausibility, and subcategorization. [PDF]
PLoS ONE, 2013 Natural language processing is a fast and automatized process. A crucial part of this process is parsing, the online incremental construction of a syntactic structure.
Johannes Kizach +2 more
doaj +1 more source
Parser evaluation across text types [PDF]
, 2005 When a statistical parser is trained on one treebank, one usually tests it on another portion of the same treebank, partly due to the fact that a comparable annotation format is needed for testing.
Versley, Yannick
core
A study of the transferability of influenza case detection systems between two large healthcare systems. [PDF]
PLoS ONE, 2017 OBJECTIVES:This study evaluates the accuracy and transferability of Bayesian case detection systems (BCD) that use clinical notes from emergency department (ED) to detect influenza cases.
Ye Ye +15 more
doaj +1 more source
If the Current Clique Algorithms are Optimal, So is Valiant's Parser [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2015 The CFG recognition problem is: given a context-free grammar G and a string w of length n, decide if w can be obtained from G. This is the most basic parsing question and is a core computer science problem.
Amir Abboud, A. Backurs, V. V. Williams
semanticscholar +1 more source
A Scanner and Parser for Z Specifications
IJID (International Journal on Informatics for Development), 2018 Coding either a scanner or a parser from beginning has many disadvantages such as tedious, could raise many errors, needs much times and effort, etc. All of these could result less scanner or parser.
Maria Ulfah Siregar, John Derrick
doaj +1 more source