Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

ICGI
1998
Springer

favoriteEmaildiscussreport

83views Natural Language Processing» more ICGI 1998»

A Stochastic Search Approach to Grammar Induction

13 years 10 months ago

A Stochastic Search Approach to Grammar Induction

Download www.demo.cs.brandeis.edu

This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has been inspired by the Abbadingo DFA learning competition [14] which took place between Mars and November 1997. SAGE ended up as one of the two winners in that competition. The second winning algorithm, rst proposed by Rodney Price, implements a new evidence-driven heuristic for state merging. Our own version of this heuristic is also described in this paper and compared to SAGE.

Hugues Juillé, Jordan B. Pollack

Real-time Traffic

DFA Learning Competition | Heuristic | ICGI 1998 | Natural Language Processing | Search Named Sage |

claim paper

Related Content

» Learning ContextFree Grammars with a Simplicity Bias

» Induction of Greedy Controllers for Deterministic Treebank Parsers

» Learning Stochastic Logic Programs

» Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming

» Inference of node replacement graph grammars

» Memory efficient alignment between RNA sequences and stochastic grammar models of pseudokn...

» Inducing Combinatory Categorial Grammars with Genetic Algorithms

» Learning Probabilistic Hierarchical Task Networks to Capture User Preferences

» Rhythm and Tempo Recognition of Music Performance from a Probabilistic Approach

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ICGI
Authors	Hugues Juillé, Jordan B. Pollack

Comments (0)