Memory-Based Grammatical Relation Finding (2002)
by
Sabine Buchholz
,
Te Braunschweig Duitsland
,
Promotores Prof
,
W. M. P. Daelemans
,
Printed Printpartners Ipskamp
| Citations: | 25 - 0 self |
BibTeX
@MISC{Buchholz02memory-basedgrammatical,
author = {Sabine Buchholz and Te Braunschweig Duitsland and Promotores Prof and W. M. P. Daelemans and Printed Printpartners Ipskamp},
title = {Memory-Based Grammatical Relation Finding},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This memory is called the instance base. For testing, those training instances that are most similar to the test instance are retrieved from memory and their labels are used to assign a label to the test instance. This direct use of all training instances (lazy learning) contrasts with the eager learning of e.g. decision tree or rule learning algorithms which derive an abstract representation from the training instances and then use only this representation when processing test instances
Citations
| 332 | Computer systems that learn - Weiss, Kulikowski - 1991 |
| 108 | The TREC-8 Question Answering Track Evaluation - Voorhees, Tice - 2000 |
| 60 | Overview of the TREC-9 Question Answering Track - Voorhees |
| 31 | Bias in information-based measures in decision tree induction - White, Liu - 1994 |
| 17 | Resolving PP Attachment Ambiguities with Memory-Based Learning - Zavrel, Daelemans, et al. - 1997 |
| 10 | Some properties of preposition and subordinate conjunction attachments - Yeh, Vilain - 1998 |
| 1 | Comparing two trainable grammatical relations - 2000a |
| 1 | More accurate tests for the statistical signi of result dierences - 2000b |
| 1 | Using existing systems to supplement small amounts of annotated grammatical relations training data - 2000c |
