Structuring Natural Language Data by Learning Rewriting Rules

  • Authors:
  • Guillaume Cleuziou;Lionel Martin;Christel Vrain

  • Affiliations:
  • LIFO, Laboratoire d'Informatique Fondamentale d'Orléans, Rue Léonard de Vinci B.P. 6759, 45067 Orléans cedex2, France;LIFO, Laboratoire d'Informatique Fondamentale d'Orléans, Rue Léonard de Vinci B.P. 6759, 45067 Orléans cedex2, France;LIFO, Laboratoire d'Informatique Fondamentale d'Orléans, Rue Léonard de Vinci B.P. 6759, 45067 Orléans cedex2, France

  • Venue:
  • Inductive Logic Programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The discovery of relationships between concepts is a crucial point in ontology learning (OL). In most cases, OL is achieved from a collection of domain-specific texts, describing the concepts of the domain and their relationships. A natural way to represent the description associated to a particular text is to use a structured term (or tree). We present a method for learning transformation rules, rewriting natural language texts into trees, where the input examples are couples (text, tree). The learning process produces an ordered set of rules such that, applying these rules to a textgives the corresponding tree.