Abstract:
We study memory-based learning methods and show that they can be viewed as learning linear predictors over commonly used feature spaces. We suggest that this view allows one to study memory based methods and other successful learning algorithms used in NLP within the same computational framework and may result in improved algorithms and a better understanding for the role of learning in natural language inferences. 1
Citations
|
569
|
Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging
– Brill
- 1995
|
|
420
|
Toward Memorybased Reasoning
– Stanfill, Waltz
- 1986
|
|
195
|
A method for disambiguating word senses in a large corpus. Computers and the Humanities
– Gale, Church, et al.
- 1993
|
|
148
|
Learning to resolve natural language ambiguities: A unified approach
– Roth
- 1998
|
|
116
|
Prepositional Phrase Attachment through a Backed-Off Model
– Collins, Brooks
- 1995
|
|
115
|
A rule-based approach to prepositional phrase attachment disambiguation
– Brill, Resnik
- 1994
|
|
97
|
Forgetting exceptions is harmful in language learning
– Daelemans, Bosch, et al.
- 1999
|
|
95
|
A maximum entropy model for prepositional phrase attachment
– Ratnaparkhi, Reynar, et al.
- 1994
|
|
58
|
A winnow based approach to context-sensitive spelling correction
– Golding, Roth
- 1999
|
|
54
|
A Memory-based Approach to Learning Shallow Natural Language Patterns
– Argamon, Dagan, et al.
- 1998
|
|
51
|
Memory-based lexical acquisition and processing
– Daelemans
- 1995
|
|
47
|
A Bayesian Hybrid Method for Context-Sensitive Spelling Correction
– Golding
- 1995
|
|
39
|
Learning in natural language
– Roth
- 1999
|
|
22
|
Memory-based learning: Using similarity for smoothing
– Zavrel, Daelemans
- 1997
|
|
14
|
Incorporating knowledge in natural language learning: A case study
– Krymolowski, Roth
- 1998
|
|
3
|
Resolving pp attachment ambiguities with memory based learning
– Zavrel, Daelemans, et al.
- 1997
|
|
1
|
Private communication
– Krymolowski
- 1999
|