Sciweavers

1269 search results - page 4 / 254
» Learning Correction Grammars
Sort
View
ICCV
2005
IEEE
15 years 3 months ago
Learning Non-Generative Grammatical Models for Document Analysis
— We present a general approach for the hierarchical segmentation and labeling of document layout structures. This approach models document layout as a grammar and performs a glo...
Michael Shilman, Percy Liang, Paul A. Viola
EMNLP
2007
14 years 11 months ago
What is the Jeopardy Model? A Quasi-Synchronous Grammar for QA
This paper presents a syntax-driven approach to question answering, specifically the answer-sentence selection problem for short-answer questions. Rather than using syntactic fea...
Mengqiu Wang, Noah A. Smith, Teruko Mitamura
NLPRS
2001
Springer
15 years 1 months ago
Learning Strategies In A Grammar Induction Framework
This work extends a semi-automatic grammar induction approach previously proposed in [1]. We investigate the use of Information Gain (IG) in place of Mutual Information (MI) for g...
Chin-Chung Wong, Helen M. Meng, Kai-Chung Siu
ACL
2009
14 years 7 months ago
Bayesian Learning of a Tree Substitution Grammar
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
Matt Post, Daniel Gildea
ECML
2000
Springer
15 years 1 months ago
Learning Context-Free Grammars with a Simplicity Bias
We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a rational reconstruction of Wol 's SNPR { the Gridssys...
Pat Langley, Sean Stromsten