Results 251 to 260 of about 595,495 (293)

Probabilistic Conjunctive Grammar

Lecture Notes in Computer Science, 2017
This 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.
Subramanian Arumugam
exaly   +3 more sources

Probabilistic Grammars for Natural Languages

SynthÈse, 1970
Although 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, 1977
The 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

Language Correction Using Probabilistic Grammars

IEEE Transactions on Computers, 1976
Error 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 GRAPH GRAMMARS

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

Solution of an Open Problem on Probabilistic Grammars

IEEE Transactions on Computers, 1983
It 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

Probabilistic Grammar-based Test Generation

2020
Given 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

Home - About - Disclaimer - Privacy