Results 31 to 40 of about 298,955 (157)

A Syntactic Approach to Macro-Grammars for Context-Free Languages [PDF]

open access: yes, 2009
We commence this thesis by setting a backdrop for the work. In [HN05] Herranz and Nogueira introduced the MTP (More Than Parsing) tool. They designed MTP to be an automatic parser generator.
Nuche Bascón, Jaime
core  

A generalized LR(1) parser for extended context-free grammars [PDF]

open access: yes, 2020
Tomita's Generalized LR(1) parser (GLR) algorithm for CF grammars runs in a linear time onLR(1) grammars and degrades to a polynomial bound otherwise.
Angelo Morzenti   +3 more
core  

Sentiment Analysis of Imbalanced Dataset Through Data Augmentation and Generative Annotation Using DistilBERT and Low‐Rank Fine‐Tuning

open access: yesApplied AI Letters, Volume 7, Issue 3, October 2026.
The proposed model takes an imbalanced English dataset as input and balances it by Generating Synthetic Tweets (GST) using GPT‐based paraphrasing. These new tweets are then annotated with one of 10 categorical labels representing their primary meaning, using another large language model like GPT.
Hossein Nekouei   +1 more
wiley   +1 more source

Parser evaluation across text types [PDF]

open access: yes, 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  

Deep Learning‐Based Quantification of Spontaneous Pain Behaviours in Mice

open access: yesEuropean Journal of Pain, Volume 30, Issue 9, October 2026.
ABSTRACT Background Accurate evaluation of pain‐related behaviours in rodent models is crucial for elucidating pain mechanisms and assessing the efficacy of novel analgesic compounds. Traditional nociceptive assays primarily measure evoked responses, which have limited translational relevance since spontaneous pain is the predominant symptom in pain ...
Michele Zanoletti   +9 more
wiley   +1 more source

scala-tptp-parser v1.7.1

open access: yes, 2023
scala-tptp-parser is a Scala library (for Scala 2.13.x) for parsing the input languages of the TPTP infrastructure. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different ...
Alexander Steen
core   +1 more source

Trace Data of Secondary Students and Linguistic Analysis to Predict Learner Performance in a Multi‐Text Writing Task

open access: yesJournal of Computer Assisted Learning, Volume 42, Issue 5, October 2026.
ABSTRACT Background Writing from multiple sources is a cognitively demanding task that requires students to integrate reading, planning, and composition processes. While prior research has demonstrated the importance of self‐regulated learning (SRL) and linguistic features in predicting writing performance, most studies have focused on university ...
Halima Alnashiri   +10 more
wiley   +1 more source

Comparing the use of edited and unedited text in parser self-training [PDF]

open access: yes, 2011
We compare the use of edited text in the form of newswire and unedited text in the form of discussion forum posts as sources for training material in a self-training experiment involving the Brown reranking parser and a test set of sentences from an ...
Foster, Jennifer   +3 more
core   +2 more sources

Machine‐learning prediction of urine‐culture positivity in a multicentre test‐ordered cohort: Model development and internal validation

open access: yesBJUI Compass, Volume 7, Issue 9, September 2026.
Abstract Objectives This study aim to develop, compare and internally validate machine‐learning models for predicting urine‐culture positivity in patients who had both urinalysis and culture ordered and to explore descriptive probability strata. Post hoc secondary analyses examined age subgroups, the incremental contribution of text‐derived features ...
Isaac Samir Wasfy   +14 more
wiley   +1 more source

A General LR(k) Parser Building Algorithm [PDF]

open access: yes, 1973
The problem is to find an efficient algorithm that, given the productions of a context-free grammar G, will discover whether G is LR(k) for given k and if it is build an efficient parser for G . The algorithm is given in Section 8.
Sager, Thomas Joshua
core  

Home - About - Disclaimer - Privacy