Probabilistic grammars acting as information sources are considered and concepts from information theory defined by other authors are partly redefined. A specific probability assignment for maximizing the rate of a language source is found. Further, the problem of coding a language source is treated
It is proved that for a probabilistic context-free language L(G), the population density of a charac...
We present a measure for evaluating Probabilistic Context Free Grammars (PCFG) based on their ambigu...
We consider several empirical estimators for probabilistic context-free grammars, and show that the ...
Probabilistic grammars acting as information sources are considered and concepts from information th...
The usual concepts from information theory are defined and related to probabilistic grammars. The en...
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus...
This paper examines the usefulness of corpus-derived probabilistic grammars as a basis for the autom...
• At least three ways to use probabilities in a parser – Probabilities for choosing between parses •...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
This paper examines the usefulness of corpus-derived probabilistic grammars as a basis for the auto-...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
Probabilistic context-free languages are defined by giving predetermined probabilities (preprobabili...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
It is proved that for a probabilistic context-free language L(G), the population density of a charac...
We present a measure for evaluating Probabilistic Context Free Grammars (PCFG) based on their ambigu...
We consider several empirical estimators for probabilistic context-free grammars, and show that the ...
Probabilistic grammars acting as information sources are considered and concepts from information th...
The usual concepts from information theory are defined and related to probabilistic grammars. The en...
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus...
This paper examines the usefulness of corpus-derived probabilistic grammars as a basis for the autom...
• At least three ways to use probabilities in a parser – Probabilities for choosing between parses •...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
This paper examines the usefulness of corpus-derived probabilistic grammars as a basis for the auto-...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
Probabilistic context-free languages are defined by giving predetermined probabilities (preprobabili...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
In this paper, we consider probabilistic context-free grammars, a class of generative devices that h...
It is proved that for a probabilistic context-free language L(G), the population density of a charac...
We present a measure for evaluating Probabilistic Context Free Grammars (PCFG) based on their ambigu...
We consider several empirical estimators for probabilistic context-free grammars, and show that the ...
DOI
Add to ORKG