Sciweavers

19 search results - page 4 / 4
» Intricacies of Collins' Parsing Model
Sort
View
EACL
2003
ACL Anthology
13 years 9 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
ICML
2002
IEEE
14 years 8 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi
UAI
2004
13 years 9 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...
JMLR
2008
230views more  JMLR 2008»
13 years 7 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...