Results 191 to 200 of about 42,602 (238)
The Development and Validation of the Chinese Vocabulary Levels Test
International Journal of Applied Linguistics, EarlyView.ABSTRACT In response to the increasing need for effective Chinese vocabulary assessments, this study developed the Chinese Vocabulary Levels Test (CVLT), a test designed for intermediate‐level Chinese as a second or foreign language (CSL/FL) learners, based on the vocabulary lists (levels 4–6) from the Chinese Proficiency Grading Standards for ...
Shiwei Qi, Ailan Fu
wiley +1 more source
International Journal of Laboratory Hematology, EarlyView.ABSTRACT Background Circadian clock disruption has emerged as a relevant axis in cancer; however, the expression patterns and diagnostic relevance of BMAL1 and CLOCK in multiple myeloma (MM) remain insufficiently defined. Methods BMAL1 and CLOCK mRNA expression was quantified by RT‐qPCR in bone marrow samples from 46 newly diagnosed MM patients and 13 ...
Hamide Albayrak +6 more
wiley +1 more source
Information Systems Journal, EarlyView.ABSTRACT Artificial intelligence (AI)–enabled automation is often utilised in systems that perform human tasks. While useful, these technologies pose a risk of adverse consequences in the case of AI failures as they operate in open environments, learn and are subject to continuous updates.
Kari M. Koskinen +3 more
wiley +1 more source
Grammar Compression with Probabilistic Context-Free Grammar [PDF]
2020 Data Compression Conference (DCC), 2020 We propose a new approach for universal lossless text compression, based on grammar compression. In the literature, a target string $T$ has been compressed as a context-free grammar $G$ in Chomsky normal form satisfying $L(G) = \{T\}$. Such a grammar is often called a \emph{straight-line program} (SLP).
Diptarama Hendrian +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Probabilistic Conjunctive Grammar
Lecture Notes in Computer Science, 2017This paper extends conjunctive grammar to Probabilistic Conjunctive Grammar (PCG). This extension is motivated by the concept of probabilistic context free grammar which has many applications in the area of computational linguistics, computer science and bio-informatics.
S Arumugam
exaly +2 more sources
Fundamenta Informaticae, 1993
In a probabilistic graph grammar, each production has a probability attached to it. This induces a probability assigned to each derivation tree, and to each derived graph. Conditions for this probability function to be a probabilistic measure are discussed. The statistical properties of the generated language are investigated.
openaire +2 more sources
In a probabilistic graph grammar, each production has a probability attached to it. This induces a probability assigned to each derivation tree, and to each derived graph. Conditions for this probability function to be a probabilistic measure are discussed. The statistical properties of the generated language are investigated.
openaire +2 more sources
Solution of an Open Problem on Probabilistic Grammars
IEEE Transactions on Computers, 1983It has been proved that when the production probabilities of an unambiguous context-free grammar G are estimated by the relative frequencies of the corresponding productions in a sample S from the language L(G) generated by G, the expected derivation length and the expected word length of the words in L(G) are precisely equal to the mean derivation ...
Ranjan Chaudhuri +2 more
openaire +1 more source
Inference of Finite-State Probabilistic Grammars
IEEE Transactions on Computers, 1977The problem of the inference of finite-state probabilistic grammars is studied from two points of view. First, the theoretical aspects of grammatical inference are considered. Among the topics investigated are the structural and statistical properties of probabilistic grammars, methods for assigning probability measures to rewrite rules of ...
Fred J. Maryanski, Taylor L. Booth
openaire +1 more source
Probabilistic Grammar-based Test Generation
2020Given a program that has been tested on some sample input(s), what does one test next? To further test the program, one needs to construct inputs that cover (new) input features, in a manner that is different from the initial samples. This talk presents an approach that learns from past test inputs to generate new but different inputs. To achieve this,
Ezekiel O. Soremekun +4 more
openaire +1 more source