Results 31 to 40 of about 42,602 (238)
Evolutionary models for insertions and deletions in a probabilistic modeling framework
BMC Bioinformatics, 2005 Background Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterparts for structural RNAs) often assume a fixed degree of divergence. Ideally
Rivas Elena
doaj +1 more source
Grammatical Probability In Issues Related to Syntax [PDF]
دراسات في اللغة العربيّة وآدابها, 2015 Â Many different opinions about Arabic grammar and variety of grammatical types have contributed to probabilistic orientations in Arabic grammar. The dominant logic amongst grammarians, which asserts syntactic rules are not fixed and unchangeable, has ...
Sami Awad, Yusuf Abbood
doaj +1 more source
A Theoretical Foundation for Syntactico-Semantic Pattern Recognition
IEEE Access, 2021 Conventionally syntactic pattern recognition tasks have been driven by grammars defining a syntactic structure. Syntactic Pattern recognition tasks were primarily relying on the ability of parsing algorithms to recognize the patterns in the input data ...
Shrinivasan Patnaikuni, Sachin Gengaje
doaj +1 more source
On Repair with Probabilistic Attribute Grammars
CoRR, 2017 Program synthesis and repair have emerged as an exciting area of research, driven by the potential for revolutionary advances in programmer productivity. Among most promising ideas emerging for synthesis are syntax-driven search, probabilistic models of code, and the use of input-output examples.
Manos Koukoutos +3 more
openaire +2 more sources
Compound Probabilistic Context-Free Grammars for Grammar Induction [PDF]
Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, 2019 We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our grammar's rule probabilities are modulated by a per-sentence continuous latent variable, which induces marginal ...
Yoon Kim, Chris Dyer, Alexander M. Rush
openaire +2 more sources
Grammar induction for mildly context sensitive languages using variational Bayesian inference
, 2014 The following technical report presents a formal approach to probabilistic minimalist grammar induction. We describe a formalization of a minimalist grammar. Based on this grammar, we define a generative model for minimalist derivations.
Bergen, Leon +4 more
core +3 more sources
Entropies of probabilistic grammars
Information and Control, 1974 The usual concepts from information theory are defined and related to probabilistic grammars. The entropies of a derivation, a sentence and the average terminal symbol in a stream of sentences are calculated. How to maximize the information rate is shown, and the maximum is related to the classical notion of the capacity of a language.
openaire +2 more sources
Data-oriented parsing with discontinuous constituents and function tags
Journal of Language Modelling, 2016 Statistical parsers are e ective but are typically limited to producing projective dependencies or constituents. On the other hand, linguisti- cally rich parsers recognize non-local relations and analyze both form and function phenomena but rely on ...
Andreas van Cranenburgh +2 more
doaj +1 more source
Probabilistic grammars and automata
Information and Control, 1972 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 +2 more sources