Sciweavers

446 search results - page 5 / 90
» A Combinatorial Theorem for Trees
Sort
View
EMNLP
2007
14 years 11 months ago
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...
ACL
2006
14 years 11 months ago
Speeding Up Full Syntactic Parsing by Leveraging Partial Parsing Decisions
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
Elliot Glaysher, Dan I. Moldovan
SIAMCOMP
2000
69views more  SIAMCOMP 2000»
14 years 9 months ago
A Finite State Version of the Kraft--McMillan Theorem
The main result is a finite-state version of the Kraft
Frédérique Bassino, Marie-Pierre B&e...
AML
2004
52views more  AML 2004»
14 years 9 months ago
Effectiveness for infinite variable words and the Dual Ramsey Theorem
We examine the Dual Ramsey Theorem and two related combinatorial principles VW(k, l) and OVW(k, l) from the perspectives of reverse mathematics and effective mathematics. We give a...
Joseph S. Miller, Reed Solomon