103 search results - page 7 / 21 » Prototype-Driven Grammar Induction |
NAACL
2010
14 years 9 months ago
2010
This paper describes an efficient sampler for synchronous grammar induction under a nonparametric Bayesian prior. Inspired by ideas from slice sampling, our sampler is able to dra...
110
click to vote
JMLR
2010
14 years 6 months ago
2010
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
101
click to vote
CADE
2008
Springer
15 years 12 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
IJCNLP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties of pa...
98
Voted
TNN
1998
14 years 11 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...