Publications (7)

1Estimators for Stochastic "UnificationBased" Grammarssemantic constraints. However, developing Stochastic "Unificationbased" Grammars (SUBGs) has not proved as straightforward...

2Probabilistic Disambiguation Models for WideCoverage HPSG Parsing2005  Yusuke Miyao,Jun’ichi Tsujiirepresent in a packed form of HPSG parse trees. A parse tree of HPSG is represented as a set of tuples , where...

3Joint and Conditional Estimation of Tagging and Parsing Models2001  Johnson, Markfinding the value of some hidden variable Y (e.g., a tag or a parse tree) which maximizes a conditional probability distribution...

4Incremental Parsing with the Perceptron Algorithm2004  Michael John Collins,Brian Roarknumber of times the i’th contextfree rule appears in the parse tree (x, y). This is implicitly the representation used in ...

5Sentence Simplification for Semantic Role Labeling2008  David Vickrey,Daphne Koller943059010 {dvickrey,koller}@cs.stanford.edu Abstract Parsetree paths are commonly used to incorporate information from...the preposition “for.” The corresponding path through the parse tree likely occurs a relatively small number of times (or not...

6New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron2002  Michael John Collins,Nigel Duffyman NP D the N NP D N man Figure 2: a) An example parse tree. b) The subtrees of the NP covering the man. The tree...

7CoarsetoFine nBest Parsing and MaxEnt Discriminative Reranking2005  Eugene Charniak,Johnson, Markcounts the number of the other nonterminal nodes in the parse tree. Heavy (1049) This schema classifies nodes by their category...and Stefan Riezler. 1999. Estimators for stochastic “unificationbased” grammars. In The Proceedings of the 37th Annual Conference...