S. Abney, D. McAllester, and F. Pereira. 1999. Relating probabilistic grammars and automata. In Proceedings of ACL '99. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exploiting Syntactic Structure for Natural Language Modeling - Chelba (2000) (11 citations) (Correct)
.... probability assignment than that in a PCFG grammar which is based on a different encoding of (W#T) A thorough comparison between the two classes of probabilistic languages PCFGs and shift reduce probabilistic push down automata, to which the SLM pertains has been presented in [1]. Regarding (W#T) as a graph, Figure 7.1 shows the dependencies in a regular CFG# in contrast, Figures (7.2 7.4) show the probabilistic dependencies for each model component in the SLM# a complete dependency structure is obtained by super imposing the three figures. To make the SLM directly ....
Steven Abney, David McAllester, and Fernando Pereira. Relating probabilistic grammars and automata. In Proceedings of ACL, volume 1, pages 541--549. College Park, Maryland, USA, 1999.
Grammatical Inference and First Language Acquisition - Alexander Clark Asc (Correct)
No context found.
S. Abney, D. McAllester, and F. Pereira. 1999. Relating probabilistic grammars and automata. In Proceedings of ACL '99.
Grammatical Inference and the Argument from the Poverty of the.. - Clark (2004) (Correct)
No context found.
Abney, S.; McAllester, D.; and Pereira, F. 1999. Relating probabilistic grammars and automata. In Proceedings of ACL '99.
Partially Distribution-Free Learning of Regular Languages.. - Clark, Thollard (2004) (Correct)
No context found.
S. Abney, D. McAllester, and F. Pereira. 1999. Relating probabilistic grammars and automata. In Proceedings of ACL '99.
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (1 citation) (Correct)
No context found.
A. Abney, D. McAllester, and F. Pereira. Relating probabilistic grammars and automata. In Proceedings of ACP'99, pages 542#549, 1999.
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (1 citation) (Correct)
No context found.
A. Abney, D. McAllester, and F. Pereira. Relating probabilistic grammars and automata. In Proceedings of ACP'99, pp. 542--549, 1999.
Theory. Pinter, London, 1997. '96, 1996. [36] Philip.. - Journal Of Linguistics (Correct)
No context found.
Steven Abney, David McAllester, and Fernando Pereira. Relating probabilistic grammars and automata. In Proceedings of ACL '99, pages 542--549, 1999. Loosely related: talks about the nonequivalence of probabilistic CFGs and PDAs.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC