Results 71 to 80 of about 42,602 (238)

Statistical properties of probabilistic context-sensitive grammars

open access: yesPhysical Review Research
Probabilistic context-free grammars (PCFGs), which are commonly used to generate trees randomly, have been well analyzed theoretically, leading to applications in various domains.
Kai Nakaishi, Koji Hukushima
doaj   +1 more source

Probabilistic hyperedge replacement grammars

open access: yesTheoretical Computer Science, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

MicroCT reinvestigation of the only articulated fossil anostomid fish reveals synonymy of Arhinolemur Ameghino, 1898 and Megaleporinus Ramirez et al., 2017

open access: yesThe Anatomical Record, EarlyView.
Abstract Arhinolemur scalabrinii† Ameghino, 1898 was originally described as a strepsirrhine primate (Mammalia) but has been recognized as an anostomid fish since 2012. It remains the only extinct anostomid species known from complete cranial material.
Karen M. Panzeri   +8 more
wiley   +1 more source

From Harmony to Probability: The Problem of Identifiability and a Bayesian Inference Perspective on Greek Nominal Stress

open access: yesApplied Sciences
Maximum Entropy and Gradient Harmonic Grammar are well-established grammatical models for the analysis of linguistic phenomena, but we demonstrate that their probabilistic versions are inherently unidentifiable, employing parameters that cannot be ...
Kosmas Kosmidis   +2 more
doaj   +1 more source

Single‐Cell Level Characterization of B Cell Depletion and Repopulation Following Rituximab in Systemic Lupus Erythematosus

open access: yesArthritis &Rheumatology, EarlyView.
Objective Rituximab, a CD20+ B cell depletion therapy, is frequently used to treat systemic lupus erythematosus (SLE). However, variability in patient response highlights the need for a deeper understanding of the underlying immune cell dynamics of B cell depletion and repopulation.
Haerin Jang   +9 more
wiley   +1 more source

Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization [PDF]

open access: yes, 2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by “Viterbi training.” We show that solving and even approximating Viterbi ...
Cohen, S. B., Smith, N. A.
core   +2 more sources

Estimation of consistent probabilistic context-free grammars [PDF]

open access: yesProceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics -, 2006
We consider several empirical estimators for probabilistic context-free grammars, and show that the estimated grammars have the so-called consistency property, under the most general conditions. Our estimators include the widely applied expectation maximization method, used to estimate probabilistic context-free grammars on the basis of unannotated ...
NEDERHOF M. J, SATTA, GIORGIO
openaire   +3 more sources

Lung Ultrasound for the Detection of Radiologic Progression of Interstitial Lung Abnormalities in Patients With Rheumatoid Arthritis

open access: yesArthritis &Rheumatology, EarlyView.
Objective Interstitial lung disease (ILD) is an important extra‐articular manifestation of rheumatoid arthritis (RA) associated with high mortality and morbidity. Lung ultrasonography (LUS) has recently emerged as a possible screening tool. We assessed the role of LUS in monitoring radiologic progression and the development of new interstitial lung ...
Marie Vermant   +15 more
wiley   +1 more source

Covariance in Unsupervised Learning of Probabilistic Grammars

open access: yesJ. Mach. Learn. Res., 2010
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while their probabilistic component helps resolve ambiguity. They also permit the use of well-understood, generalpurpose learning algorithms.
Cohen, S. B., Smith, Noah A.
openaire   +3 more sources

ChatGPT for complex text evaluation tasks

open access: yesJournal of the Association for Information Science and Technology, Volume 76, Issue 4, Page 645-648, April 2025.
Abstract ChatGPT and other large language models (LLMs) have been successful at natural and computer language processing tasks with varying degrees of complexity. This brief communication summarizes the lessons learned from a series of investigations into its use for the complex text analysis task of research quality evaluation.
Mike Thelwall
wiley   +1 more source

Home - About - Disclaimer - Privacy