Sciweavers

451 search results - page 2 / 91
» Partial Learning Using Link Grammars Data
Sort
View
ACL
2008
13 years 6 months ago
Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
Adaptor grammars (Johnson et al., 2007b) are a non-parametric Bayesian extension of Probabilistic Context-Free Grammars (PCFGs) which in effect learn the probabilities of entire s...
Mark Johnson
ICALT
2005
IEEE
13 years 10 months ago
The Design for a Collaborative System of English as Foreign Language Composition Writing of Senior High School Students in Taiwa
The authors will propose system integrated mechanisms, a Wiki platform for peer-reviewing, Link Grammar for automatically checking the students’ papers, and a RSS reader to peri...
Yi-Fan Chang, Diane L. Schallert
ICTAI
2007
IEEE
13 years 11 months ago
Constructing VEGGIE: Machine Learning for Context-Sensitive Graph Grammars
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
Keven Ates, Kang Zhang
ALT
2006
Springer
14 years 1 months ago
Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
Takeshi Shibata, Ryo Yoshinaka, Takashi Chikayama
JMLR
2010
137views more  JMLR 2010»
12 years 11 months ago
Covariance in Unsupervised Learning of Probabilistic Grammars
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
Shay B. Cohen, Noah A. Smith