Results 241 to 250 of about 445,078 (279)
Some of the next articles are maybe not open access.
Probabilistic Grammars for Natural Languages
SynthÈse, 1970Although a fully adequate grammar for a substantial portion of any natural language does not exist, a vigorous and controversial discussion of how to choose among several competing grammars has already developed. On occasion, criteria of simplicity have been suggested as systematic scientific criteria for selection.
Patrick Suppes
exaly +2 more sources
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
exaly +3 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 +4 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 +4 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 +2 more sources
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers, 1976Error correction of programming languages has been effected in a heuristic fashion; error correction in the information-theoretic sense is very precise. The missing link is provided through probabilistic grammars. This paper provides the theoretical foundation for the precise construction of an error correcting compiler. The concept of code distance is
exaly +3 more sources
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
Probabilistic Parallel Communicating Grammar Systems
International Journal of Computer Mathematics, 2002Grammar systems are theoretical models of distributed computing which play a major role in modern Computer Science. In this paper, we define and study a variant of Parallel Communicating(PC) grammar systems namely, Probabilistic PC grammar systems which serves as a grammatical model for random distributed processing.
K. Arthi, Kamala Krithivasan
openaire +1 more source
Generalized Queries on Probabilistic Context-Free Grammars
—Probabilistic context-free grammars (PCFGs) provide a simple way to represent a particular class of distributions over sentences in a context-free language.
M P Wellman
exaly +1 more source
Probabilistic grammar-based deep neuroevolution
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019Designing deep neural networks by human engineers can be challenging because there are various choices of deep neural network structures. We developed a deep neuroevolution system to automatically design deep neural network structures using deep neuroevolution. Our approach defines a set of structures using a probabilistic grammar and searches for best
Pak-Kan Wong +2 more
openaire +1 more source
Probabilistic Feature Grammars
2000We present a new formalism, probabilistic feature grammar (PFG). PFGs combine most of the best properties of several other formalisms, including those of Collins, Magerman, and Charniak, and in experiments have comparable or better performance. PFGs generate features one at a time, probabilistically, conditioning the probabilities of each feature on ...
openaire +2 more sources

