103 search results - page 12 / 21 » Prototype-Driven Grammar Induction |
126
click to vote
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
100
Voted
SOFSEM
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. In this paper we describe an e cient and scalable implementation for grammar induction based on the EMILE approach ( 2], 3], 4], 5], 6]). The current EMILE 4.1 implementa...
118
click to vote
ACL
1998
15 years 3 months ago
1998
This paper reports a pilot study, in which Constraint Grammar inspiredruleswere learnt using the Progol machine-learning system. Rules discarding faulty readings of ambiguously ta...
105
Voted
NAACL
2010
14 years 11 months ago
2010
We show how features can easily be added to standard generative models for unsupervised learning, without requiring complex new training methods. In particular, each component mul...
108
click to vote
IDA
2007
Springer
15 years 1 months ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...