A Stochastic Search Approach to Grammar Induction

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.

• Type: Conference
• Year: 1998
• Where: ICGI
• Authors: Hugues Juillé, Jordan B. Pollack
• Keywords: DFA Learning Competition, Heuristic, ICGI 1998, Natural Language Processing, Search Named Sage