Results 41 to 50 of about 445,078 (279)
Pattern Activation/Recognition Theory of Mind
In his 2012 book How to Create a Mind, Ray Kurzweil defines a Pattern Recognition Theory of Mind that states that the brain uses millions of pattern recognizers, plus modules to check, organize, and augment them.
Bertrand edu Castel
doaj +1 more source
Probabilistic grammars and automata
A mathematical formulation of probabilistic grammars, as well as the random languages generated by probabilistic grammars, is introduced. Various types of probabilistic grammars are considered. The relations between these grammars and the corresponding types of probabilistic automata are examined.
openaire +3 more sources
Grammars for Games: A Gradient-Based Framework for Optimization in Deep Learning
Deep learning is currently the subject of intensive study. However, fundamental concepts such as representations are not formally defined -- researchers know them when they see them -- and there is no common language for describing and analyzing ...
David eBalduzzi
doaj +1 more source
Probabilistic and weighted grammars
Devices for the generation of languages, corresponding to the probabilistic recognition devices or probabilistic automata, are introduced and the resulting families of languages are investigated. Comparisons are made with some other recently introduced grammars, where restrictions are imposed not only on the form of the rewriting rules but also on the ...
openaire +1 more source
Systemic sclerosis (SSc) is a rare autoimmune disease defined by immune dysregulation, vasculopathy, and progressive fibrosis of the skin and internal organs. Despite advances in care, major complications such as interstitial lung disease (ILD) and myocardial involvement remain the leading causes of morbidity and mortality.
Cristiana Sieiro Santos +2 more
wiley +1 more source
Juvenile zebra finches learn the underlying structural regularities of their fathers’ song
Natural behaviors, such as foraging, tool use, social interaction, birdsong, and language, exhibit branching sequential structure. Such structure should be learnable if it can be inferred from the statistics of early experience.
Otilia eMenyhart +5 more
doaj +1 more source
Computation of distances for regular and context-free probabilistic languages [PDF]
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning.
Satta, Giorgio +5 more
core +1 more source
Objective We describe the frequency, risk factors, severity, and management of actionable and serious adverse events (AAE and SAE) in children with newly diagnosed Juvenile Idiopathic Arthritis (JIA) in Canada. Methods We enrolled patients within 3 months of JIA diagnosis in the Canadian Alliance of Pediatric Rheumatology Investigators (CAPRI) Registry,
Bashayer Alnuaimi +10 more
wiley +1 more source
Closing the gap between stochastic and rule-based LFG grammars [PDF]
Developing large-scale deep grammars in a constraint-based framework such as Lexical Functional Grammar (LFG) is time-consuming and requires significant linguistic insight.
Hautli, Annette +2 more
core +2 more sources
Consistency of Probabilistic Context-Free Grammars [PDF]
We present an algorithm for deciding whether an arbitrary proper probabilistic context-free grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity $\\\\mathcal O(n^3)$ in the unit-cost
Stüber, Torsten
core +3 more sources

