Worst-case synchronous grammar rules

NAACL HLT 2007 - Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Main Conference

Volumn , Issue , 2007, Pages 147-154

  Gildea, Daniel ^a   Stefankovic, Daniel ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPANDER GRAPHS; MARKOV RANDOM FIELDS; SYNCHRONOUS GRAMMARS;

COMPUTATIONAL LINGUISTICS;

FORMAL LANGUAGES;

EID: 84858412609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Albert V. Aho and Jeffery D. Ullman. 1972. The Theory of Parsing, Translation, and Compiling, volume 1. Prentice-Hall, Englewood Cliffs, NJ.
2. 1, isoperimetric inequalities for graphs and superconcentrators. J. of Combinatorial Theory, Ser. B, 38:73-88.
3. Stefen Arnborg, Derek G. Corneil, and Andrzej Proskurowski. 1987. Complexity of finding embeddings in a k-tree. SIAM Journal of Algebraic and Discrete Methods, 8:277-284, April.
4. L.S. Chandran and C.R. Subramanian. 2003. A spectral lower bound for the treewidth of a graph and its consequences. Information Processing Letters, 87:195-200.
5. Shlomo Hoory, Nathan Linial, and Avi Wigderson. 2006. Expander graphs and their applications. Bull. Amer. Math. Soc., 43:439-561. (Pubitemid 44448254)
6. Finn V. Jensen, Steffen L. Lauritzen, and Kristian G. Olesen. 1990. Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly, 4:269-282.
7. Giorgio Satta and Enoch Peserico. 2005. Some computational complexity results for synchronous context-free grammars. In Proceedings of HLT/EMNLP, pages 803-810, Vancouver, Canada, October.
8. G. Shafer and P. Shenoy. 1990. Probability propagation. Annals of Mathematics and Artificial Intelligence, 2:327-353.
9. R.M. Tanner. 1984. Explicit construction of concentrators from generalized n-gons. J. Algebraic Discrete Methods, 5:287-294.