论文信息 - Using ALLiS for clausing

Using ALLiS for clausing

We present the result of a symbolic machine learning system, ALLiS 2.0 for the CoNLL-2001 shared task. ALLiS 2.0 is a theory refinement system using hierarchical data. Results are F=89.04 for subtask 1, F=68.02 for subtask 2 and F=67.70 for subtask 3 (development test). Adding manual rules improves considerably results specially for task 2 (F=79.44). For the test data, results are slightly worst (F=62.27 for subtask 3).

Hervé Déjean

[1] Hervé Déjean,et al. Theory Refinement and Natural Language Learning , 2000, COLING.

[2] Raymond J. Mooney,et al. Inductive Logic Programming for Natural Language Processing , 1996, Inductive Logic Programming Workshop.

[3] Andreas Abecker,et al. From Theory Refinement to KB Maintenance: a Position Statement , 1996 .

[4] Hervé Déjean,et al. Introduction to the CoNLL-2001 shared task: clause identification , 2001, CoNLL.

[5] Clifford Alan Brunk. An investigation of knowledge intensive approaches to concept learning and theory refinement , 1996 .