Sciweavers

35 search results - page 1 / 7
» Computation of distances for regular and context-free probab...
Sort
View
TCS
2008
13 years 4 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
DLT
2009
13 years 2 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
ACL
2010
13 years 2 months ago
Authorship Attribution Using Probabilistic Context-Free Grammars
In this paper, we present a novel approach for authorship attribution, the task of identifying the author of a document, using probabilistic context-free grammars. Our approach in...
Sindhu Raghavan, Adriana Kovashka, Raymond J. Moon...
STACS
2004
Springer
13 years 10 months ago
Active Context-Free Games
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
Anca Muscholl, Thomas Schwentick, Luc Segoufin
CAAP
1994
13 years 8 months ago
Some Results on Top-Context-Free Tree Languages
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
Dieter Hofbauer, Maria Huber, Gregory Kucherov