Non-taxonomic relations between concepts appear as a major building block in common ontology definitions. In fact, their definition consumes much of the time needed for engineering an ontology. We here describe a new approach for mining nontaxonomic conceptual relations from text building on shallow text processing techniques. We use a generalized association rule algorithm that does not only detect relations between concepts, but also determines the appropriate level of abstraction at which to define relations. This is crucial for an appropriate ontology definition in order that it be succinct and conceptually adequate and, hence, easy to understand, maintain, and extend. We also perform an empirical evaluation of our approach with regard to a manually engineered ontology. For this purpose, we present a new paradigm suited to evaluate the degree to which relations that are learned match relations in a manually engineered ontology.
[1]
Günter Neumann,et al.
An Information Extraction Core System for Real World German Text Processing
,
1997,
ANLP.
[2]
David Faure,et al.
A corpus-based conceptual clustering method for verb frames and ontology
,
1998
.
[3]
Yael Ravin,et al.
Identifying and extracting relations from text
,
1999
.
[4]
Udo Hahn,et al.
Towards Text Knowledge Engineering
,
1998,
AAAI/IAAI.
[5]
Martin Romacker,et al.
Lean Semantic Interpretation
,
1999,
IJCAI.
[6]
Peter Wiemer-Hastings,et al.
Inferring the Meaning of Verbs from Context
,
1999
.
[7]
Richard Hudson,et al.
English word grammar
,
1995
.
[8]
Ramakrishnan Srikant,et al.
Mining generalized association rules
,
1995,
Future Gener. Comput. Syst..
[9]
P. Resnik.
Selection and information: a class-based approach to lexical relationships
,
1993
.