Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/23980
Title: Automatic grammar rule extraction and ranking for definitions
Authors: Borg, Claudia
Rosner, Mike
Pace, Gordon J.
Keywords: Web-based instruction -- Design
Genetic algorithms
Genetic programming (Computer science)
Rule-based programming
Issue Date: 2010
Publisher: University of Malta. Faculty of Information and Communication Technology
Citation: Borg, C., Rosner, M., & Pace, G. J. (2010). Automatic grammar rule extraction and ranking for definitions. LREC 2010 Proceedings, Valletta. 2577-2584.
Abstract: Learning texts contain much implicit knowledge which is ideally presented to the learner in a structured manner - a typical example being definitions of terms in the text, which would ideally be presented separately as a glossary for easy access. The problem is that manual extraction of such information can be tedious and time consuming. In this paper we describe two experiments carried out to enable the automated extraction of definitions from non-technical learning texts using evolutionary algorithms. A genetic programming approach is used to learn grammatical rules helpful in discriminating between definitions and non-definitions, after which, a genetic algorithm is used to learn the relative importance of these features, thus enabling the ranking of candidate sentences in order of confidence. The results achieved are promising, and we show that it is possible for a Genetic Program to automatically learn similar rules derived by a human linguistic expert and for a Genetic Algorithm to then give a weighted score to those rules so as to rank extracted definitions in order of confidence in an effective manner.
URI: https://www.um.edu.mt/library/oar//handle/123456789/23980
Appears in Collections:Scholarly Works - FacICTAI
Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
Automatic_Grammar_Rule_Extraction_and_Ranking_for_.pdf331.03 kBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.