2003
INDEED: a System for Relational Rule Induction in Domains with Rich Space of Constant Terms
NEPIL, MiloslavZákladní údaje
Originální název
INDEED: a System for Relational Rule Induction in Domains with Rich Space of Constant Terms
Autoři
NEPIL, Miloslav
Vydání
Szeged, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, od s. 40-49, 10 s. 2003
Nakladatel
Department of Informatics, University of Szeged
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Maďarsko
Utajení
není předmětem státního či obchodního tajemství
Kód RIV
RIV/00216224:14330/03:00008944
Organizační jednotka
Fakulta informatiky
Klíčová slova anglicky
relational rule induction; morphological disambiguation
Změněno: 9. 10. 2003 15:10, Mgr. Miloslav Nepil, Ph.D.
Anotace
V originále
This paper presents INDEED, a new ILP system suitable for relational rule induction in domains with rich and possibly structured space of constant terms. These constants can be arbitrary terms, not only atoms. INDEED efficiently introduces the constants into a body of a clause and is capable of refining them with respect to a given background knowledge and user-defined specification. The primary application field for INDEED is morpho-syntactic tagging of highly inflectional (e.g. Slavic) languages. Nevertheless, INDEED has been applied also to well-known benchmarks in the area of ILP with highly competitive results. This paper presents experiments with tagging the Slovene version of the Multext-East corpus and two structure-activity relationship tasks from molecular biology: mutagenesis and carcinogenesis.
Návaznosti
| MSM 143300003, záměr |
|