Applying explanation-based learning to natural language processing (part 2)
Number of Authors: 2
1989 (English)Report (Refereed)
Explanation-based learning is a technique which attempts to optimize performance of a rule-based system by adding new rules constructed from generalizations of successfully-solved examples. The paper summarizes previous work showing how this idea can be used in natural language processing, and describes experiments in which the EBL method was applied to the CHAT-80 system of Pereira and Warren. In particular, we address the problem of assuring the utility of learning a rule, since the benefit of a learned rule may not outweigh the increased search time incurred in checking its applicability. We show that this problem can be overcome in the NL domain by indexing acquired rules by their lexical constraints, which in general vastly reduces the number of potentially applicable rules. Such an indexing method was implemented and timing studies were made comparing its access speed to that of normal linear search. The indexing scheme required an average access time of 35 - 40 ms independent of the number of learned rules. The results suggest that the overhead of the indexing scheme is small.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1989, 1. , 28 p.
SICS Research Report, ISSN 0283-3638 ; R89:15
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14020OAI: oai:DiVA.org:ri-14020DiVA: diva2:1035303