Results 221 to 230 of about 10,677,937 (263)

Billion-Scale Deciphering of Human Gene Regulatory Grammar

open access: yes
Mayne J   +4 more
europepmc   +1 more source

Probabilistic Context-Free Grammars Estimated From Infinite Distributions [PDF]

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
In this paper, we consider probabilistic context-free grammars, a class of generative devices that has been successfully exploited in several applications of syntactic pattern matching, especially in statistical natural language parsing. We investigate the problem of training probabilistic context-free grammars on the basis of distributions defined ...
Giorgio Satta, Anna Corazza
exaly   +7 more sources

Grammar Compression With Probabilistic Context-Free Grammar [PDF]

open access: yes2020 Data Compression Conference (DCC), 2020
We propose a new approach for universal lossless text compression, based on grammar compression. In the literature, a target string $T$ has been compressed as a context-free grammar $G$ in Chomsky normal form satisfying $L(G) = \{T\}$. Such a grammar is often called a \emph{straight-line program} (SLP).
Naoki Kobayashi   +2 more
exaly   +4 more sources
Some of the next articles are maybe not open access.

Related searches:

Generalized Queries on Probabilistic Context-Free Grammars

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
Probabilistic context-free grammars (PCFGs) provide a simple way to represent a particular class of distributions over sentences in a context-free language. Efficient parsing algorithms for answering particular queries about a PCFG (i.e., calculating the probability of a given sentence, or finding the most likely parse) have been developed and applied ...
M P Wellman
exaly   +3 more sources

Home - About - Disclaimer - Privacy