Search results for "languages"
showing 10 items of 2101 documents
Additional file 14 of Development and validation of prediction model to estimate 10-year risk of all-cause mortality using modern statistical learnin…
2021
Additional file 14. The formula for the final model.
Grammar instruction in the Hispanic area with a special focus in Spain: a contribution towards a 'state-of-the-art'.
2018
Grammar instruction is an unresolved issue in the Hispanic area, having long been approached from within the disjunction between rhetoric (teaching how to use language, especially writing) and grammar (teaching the grammar content). Over time grammar instruction has generated an intense debate around two positions: direct instruction on grammar content, versus instruction devoted to prompting reflection on grammar and language use. There has been an insistent and recurring tendency towards the former, a situation that still prevails. More recently, however, certain research trends in Spain, albeit a minority, have crystallized in a research trajectory on metalinguistic activity, opening up …
The Insight of Empiricism. In Defense of a Hypothetical, but Propositional Given
2009
In this paper, I defend a hypothetical but propositional given as the fundamental insight of empiricism
Query automata
1999
A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases. We want to understand how the natural and well-studied computation model of tree automata can be used to compute such queries. We define a query automaton (QA) as a deterministic two-way finite automaton over trees that has the ability to select nodes depending on the state and the label at those nodes. We study QAs over ranked as well as over unranked trees. Unranked trees differ from ranked ones in that there is no bound on the num…
A Logic of Discovery
1998
A logic of discovery is introduced. In this logic, true sentences are discovered over time based on arriving data. A notion of expectation is introduced to reflect the growing certainty that a universally quantified sentence is true as more true instances are observed. The logic is shown to be consistent and complete. Monadic predicates are considered as a special case
On Diving in Trees Thomas Schwentick
2000
The paper is concerned with queries on tree-structured data. It defines fragments of first-order logic (FO) and FO extended by regular expressions along paths. These fragments have the same expressive power as the full logics themselves. On the other hand, they can be evaluated reasonably efficient, even if the formula which represents the query is considered as part of the input.
Automaton (Semi)groups (Basic Concepts)
2018
In this paper, we give an introduction to basic concepts of automaton semigroups. While we must note that this paper does not contain new results, it is focused on extended introduction in the subject and detailed examples.
A Supplementary Text to “Contextuality in Canonical Systems of Random Variables” by Ehtibar N. Dzhafarov, Víctor H. Cervantes, and Janne V. Kujala (P…
2017
Mathematical Proofs
A decidable multi-modal logic of context
1997
We give a logic for formulas Á¡± Ã, with the informal reading ”à is true in the context described by Á”. These are interpreted as binary modalities, by quantification over an enumerable set of unary modalities c¡± Ã, meaning ”à is true in context c”. The logic allows arbitrary nesting of contexts. A corresponding axiomatic presentation is given, and proven to be decidable, sound, and complete. Previously, quantificational logic of context restricted the nesting of contexts, and was only known to be decidable in very special cases.
Massively Parallel and Asynchronous Tsetlin Machine Architecture Supporting Almost Constant-Time Scaling
2021
Using logical clauses to represent patterns, Tsetlin Machine (TM) have recently obtained competitive performance in terms of accuracy, memory footprint, energy, and learning speed on several benchmarks. Each TM clause votes for or against a particular class, with classification resolved using a majority vote. While the evaluation of clauses is fast, being based on binary operators, the voting makes it necessary to synchronize the clause evaluation, impeding parallelization. In this paper, we propose a novel scheme for desynchronizing the evaluation of clauses, eliminating the voting bottleneck. In brief, every clause runs in its own thread for massive native parallelism. For each training e…