Sciweavers

1519 search results - page 9 / 304
» The Domain Dependence of Parsing
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 4 months ago
Incremental Sigmoid Belief Networks for Grammar Learning
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
James Henderson, Ivan Titov
ICCS
2001
Springer
14 years 2 months ago
Learning to Generate CGs from Domain Specific Sentences
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
Lei Zhang, Yong Yu
LREC
2010
167views Education» more  LREC 2010»
13 years 11 months ago
Hybrid Constituent and Dependency Parsing with Tsinghua Chinese Treebank
In this paper, we describe our hybrid parsing model on Mandarin Chinese processing. The model combines the mainstream constitute and dependency parsing and the dataset we use it t...
Rui Wang 0005, Yi Zhang 0003
ACL
2011
13 years 1 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
NAACL
2010
13 years 7 months ago
Automatic Domain Adaptation for Parsing
Current statistical parsers tend to perform well only on their training domain and nearby genres. While strong performance on a few related domains is sufficient for many situatio...
David McClosky, Eugene Charniak, Mark Johnson