Results 81 to 90 of about 283,476 (338)
TAXON, Volume 71, Issue 6, Page 1151-1154, December 2022., 2022 Abstract Recent proposals to amend the International Code of Nomenclature for algae, fungi, and plants (the Code) to allow the rejection of names that honour historical individuals who committed crimes against humanity has sparked a counter‐reaction that we believe misrepresents both the intent and mechanism of the proposals.
Kevin R. Thiele +3 more
wiley +1 more source
Synthesis of nested loop exercises for practice in introductory programming
Egyptian Informatics Journal, 2023 Novice programmers struggle to comprehend specific programming constructs such as arrays, recursion, and loops. One way to address this challenge is to provide practice problems for students in these topics that are considered difficult to comprehend ...
Chinedu Wilfred Okonkwo +1 more
doaj
Australian Journal of Social Issues, EarlyView.Abstract Out‐of‐home care is associated with a range of negative social outcomes for the young people who experience it. The most promising path to improved life chances for care‐experienced young people is arguably through education, especially post‐secondary education.
Naomi Tootell, Andrew Harvey
wiley +1 more source
An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities [PDF]
, 1993 We describe an extension of Earley's parser for stochastic context-free grammars that computes the following quantities given a stochastic context-free grammar and an input string: a) probabilities of successive prefixes being generated by the grammar; b)
Stolcke, Andreas
core +4 more sources
Learning of Structurally Unambiguous Probabilistic Grammars
, 2021 The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule.
Fisman, Dana +2 more
core +1 more source
On ordered context-free grammars
Information and Control, 1973 An extension for the concept of the finite index of context-free grammars is introduced and regular control languages are derived for the resulting family of languages generated by ordered context-free grammars.
openaire +2 more sources
Long‐Term Safety and Efficacy of Mepolizumab in Eosinophilic Granulomatosis With Polyangiitis
Arthritis &Rheumatology, Accepted Article.Objectives Eosinophilic granulomatosis with polyangiitis (EGPA) is a rare, relapsing, inflammatory disease. Management of EGPA predominantly relies on oral corticosteroids (OCS), which are associated with many adverse effects. The Phase III MIRRA trial demonstrated efficacy and safety of mepolizumab, anti‐interleukin‐5 biologic, for EGPA.
Michael E Wechsler +34 more
wiley +1 more source
Grammar-Based Specification and Parsing of Binary File Formats
International Journal of Digital Curation, 2012 The capability to validate and view or play binary file formats, as well as to convert binary file formats to standard or current file formats, is critically important to the preservation of digital data and records. This paper describes the extension of
William Underwood
doaj +9 more sources
Hypergraph Lambek Calculus [PDF]
arXiv, 2020 It is known that context-free grammars can be extended to generating graphs resulting in graph grammars; one of such fundamental approaches is hyperedge replacement grammars. On the other hand there are type-logical grammars which also serve to describe string languages. In this paper, we investigate how to extend the Lambek calculus ($\mathrm{L}$) and
arxiv
Learning context-free grammars from structural data in polynomial time [PDF]
, 1990 We consider the problem of learning a context-free grammar from its structural descriptions. Structural descriptions of a context-free grammar are unlabelled derivation trees of the grammar.
Sakakibara, Yasubumi
core +1 more source