MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Learning the past tense of english verbs using inductive logic programming (1996) [9 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Raymond J. Mooney, Mary Elaine Califf
Symbolic, Connectionist and Statistical Approaches to Learning for Natural Language Pr ocessing, Springer-Verlag
ftp://ftp.cs.utexas.edu/pub/mooney/papers/foidl-bkchapter-95.ps.Z
Add To MetaCart

Abstract:

Abstract. This paper presents results on using a new inductive logic programming method called Foidl to learn the past tense of English verbs. The past tense task has been widely studied in the context of the symbolic/connectionist debate. Previous papers have presented results using various neural-network and decision-tree learning methods. We have developed a technique for learning a special type of Prolog program called a first-order decision list, defined as an ordered list of clauses each ending in a cut. Foidl is based on Foil [19] but employs intensional background knowledge and avoids the need for explicit negative examples. It is particularly useful for problems that involve rules with specific exceptions, such as the past-tense task. We present results showing that Foidl learns a more accurate past-tense generator from significantly fewer examples than all previous methods. 1

Citations

843 Efficient induction of logic programs – Muggleton, Feng - 1990
747 Learning logical definitions from relations – Quinlan - 1990
619 The CN2 Induction Algorithm – Clark, Niblett - 1989
236 On learning the past tenses of English verbs – Rumelhart, McClelland - 1986
155 Foil: A midterm report – Quinlan, Cameron-Jones - 1993
152 Clausal discovery – Raedt, Dehaspe - 1997
101 Decision Lists for Lexical Ambiguity Resolution: Application to Accent Restoration in Spanish and French – Yarowsky - 1994
80 Learning logical de nitions from relations – Quinlan - 1990
64 Automated refinement of first-order horn-clause domain theories – Richards, Mooney - 1995
62 Induction of first-order decision lists : Results on learning the past tense of english verbs – Mooney, Califf - 1995
52 Efficient top-down induction of logic programs – Cameron-Jones, Quinlan - 1994
45 Compiling Prior Knowledge Into an Explicit Bias – Cohen - 1992
41 An interactive system to learn functional logic programs – Bergadano, Gunetti - 1993
37 Answering the connectionist challenge: a symbolic model of learning the past tenses of English verbs – Ling, Marinov - 1993
34 Learning the past tense of English verbs: The symbolic pattern associator vs. connectionist models – Ling - 1994
31 Combining top-down and bottom-up methods in inductive logic programming – Zelle, Mooney - 1994
27 E cient induction of logic programs – Muggleton, Feng - 1992
22 The utility of background knowledge in inductive learning – Pazzani, Kibler - 1992
15 Induction of rst-order decision lists: Results on learning the past tense of English verbs – Mooney, Cali - 1995
12 Automated re nement of rst-order horn-clause domain theories – Richards, Mooney - 1995
10 Implementations are not conceptualizations: Revising the verb model – MacWhinney, Leinbach - 1991
10 Learning decision lists by prepending inferred rules – Webb - 1993
9 The difficulties of learning logic programs with cut – Bergadano, Gunetti - 1993
6 Past tenses of verbs and first-order learning – Quinlan - 1994
4 Past tenses of verbs and rst-order learning – Quinlan - 1994
3 Learning the past tense of English verbs: An inductive logic programming approach. Unpublished project report – Califf - 1994
3 The di culties of learning logic programs with cut – Bergadano, Gunetti, et al. - 1993
1 Learning decision lists – L - 1987
1 Learning the past tense of English verbs: An inductive logic programming approach. Unpublished project report – Cali - 1994
View or Download | Add to My Collection | Correct Errors