Careful abstraction from instance families in memory-based language learning

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 11, Issue 3, 1999, Pages 339-368

  Van Den Bosch, Antal ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Careful abstraction; Generalized exemplars; Memory based learning; Natural language processing

Indexed keywords

EID: 33749644573     PISSN: 0952813X     EISSN: None     Source Type: Journal    
DOI: 10.1080/095281399146454     Document Type: Article

References (64)

1. Abney, S., 1991, Parsing by chunks. Principle-Based Parsing (Dordrecht: Kluwer Academic Publishers).
2. Aha, D. W., 1992, Generalizing from case studies: a case study. Proceedings of the Ninth International Conference on Machine Learning (San Mateo, CA: Morgan Kaufmann), pp. 1-10.
3. Aha, D. W., 1997, Lazy learning: Special issue editorial. Artificial Intelligence Review, 11: 7-10.
4. Aha, D. W., Kibler, D., and Albert, M., 1991, Instance-based learning algorithms. Machine Learning, 6: 37-66.
5. Atkeson, C., Moore, A., and Schaal, S., 1997, Locally weighted learning. Artificial Intelligence Review, 11(1-5): 11-73.
6. Baayen, R. H., Piepenbrock, R., and van Rijn, H., 1993, The CELEX lexical data base on CD-ROM (Philadelphia, PA: Linguistic Data Consortium).
7. Blake, C., Keogh, E., and Merz, C. J., 1998, UCI repository of machine learning databases. Http://www.ics.uci.edu/AI/ML/MLDBRepository.html
8. Breiman, L., Friedman, J., Ohlsen, R., and Stone, C., 1984, Classification and Regression Trees (Belmont, CA: Wadsworth International Group).
9. Cardie, C., 1994, Domain specific knowledge acquisition for conceptual sentence analysis. PhD thesis, University of Massachusets, Amherst, MA, USA.
10. Cardie, C., 1996, Automatic feature set selection for case-based learning of linguistic knowledge. Proceedings of the Conference on Empirical Methods in NLP, University of Pennsylvania.
11. Church, K. W., 1988, A stochastic parts program and noun phrase parser for unrestricted text. Proceedings of the Second Applied NLP Conference (USA: ACL).
12. Clark, P., and Boswell, R., 1991, Rule induction with CN2: Some recent improvements. Proceedings of the Sixth European Working Session on Learning (Berlin: Springer Verlag), pp. 151-163.
13. Clark, P., and Niblett, T., 1989, The CN2 rule induction algorithm. Machine Learning, 3: 261-284.
14. Collins, M. J., and Brooks, J., 1995, Prepositional phrase attachment through a backed-off model. Proceedings of the Third Workshop on Very Large Corpora, Cambridge (USA: ACL).
15. Cost, S., and Salzberg, S., 1993, A weighted nearest neighbour algorithm for learning with symbolic features. Machine Learning, 10: 57-78.
16. Cover, T. M., and Hart, P. E., 1967, Nearest neighbor pattern classification. Institute of Electrical and Electronics Engineers Transactions on Information Theory, 13: 21-27.
17. Daelemans, W., Berck, P., and Gillis, S., 1997, Data mining as a method for linguistic analysis: Dutch diminutives. Folia Linguistica, XXXI(1-2).
18. Daelemans, W., and Van den Bosch, A., 1992a, Generalisation performance of backpropagation learning on a syllabification task. Proceedings of TWLT3: Connectionism and Natural Language Processing, edited by M. F. J. Drossaers and A. Nijholt (Enschede: Twente University), pp. 27-37
19. Daelemans, W., and Van den Bosch, A., 1992b, A neural network for hyphenation. Artificial Neural Networks 2, Vol. 2, edited by I. Aleksander and J. Taylor (Amsterdam: North-Holland), pp. 1647-1650,
20. Daelemans, W., Van den Bosch, A., and Weijters, A., 1997, IGTree: using trees for compression and classification in lazy learning algorithms. Artificial Intelligence Review, 11: 407-423.
21. Daelemans, W., Van den Bosch, A., and Zavrel, J., 1999, Forgetting exceptions is harmful in language learning. Machine Learning, 11: 11-43.
22. Daelemans, W., Zavrel, J., Berck, P., and Gillis, S., 1996, MBT: A memory-based part of speech tagger generator. Proceedings of the Fourth Workshop on Very Large Corpora, edited by E. Ejerhed and I. Dagan, Copenhagen, Denmark (USA: ACL SIGDAT), pp. 14-27.
23. Devijver, P. A., and Kittler, J., 1980, On the edited nearest neighbor rule. Proceedings of the Fifth International Conference on Pattern Recognition (The Institute of Electrical and Electronics Engineers).
24. Devijver, P. A., and Kittler, J., 1982, Pattern recognition. A statistical approach (London, UK: Prentice-Hall).
25. Dietterich, T. G., 1998, Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10(7).
26. Dietterich, T. G., Hild, H., and Bakiri, G., 1995, A comparison of ID3 and backpropagation for English text-to-speech mapping. Machine Learning, 19(1): 5-28.
27. Domingos, P., 1995, The RISE 2.0 system: a case study in multistrategy learning. Technical Report 95-2 (Irvine, CA: University of California at Irvine, Department of Information and Computer Science).
28. Domingos, P., 1996, Unifying instance-based and rule-based induction. Machine Learning, 24: 141-168.
29. Fix, E., and Hodges, J. L., 1951, Disciminatory analysis - nonparametric discrimination; consistency properties. Technical Report Project 21-49-004, Report No. 4 (Texas: USAF School of Aviation Medicine).
30. Gates, G. W., 1972, The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 18: 431-433.
31. Golding, A. R., and Roth, D., 1999, A Winnow-based approach to spelling correction. Machine Learning, 34: 107-130.
32. Hart, P. E., 1968, The condensed nearest neighbor rule. IEEE Transactions on Information Theory, 14: 515-516.
33. Kolodner, J., 1993, Case-Based Reasoning (San Mateo, CA: Morgan Kaufmann).
34. Langley, P., Iba, W., and Thompson, K., 1992, An analysis of Bayesian classifiers. Proceedings of the Tenth Annual Conference on Artificial Intelligence (Menlo Park, CA: AAAI Press; Cambridge, MA: MIT Press), pp. 223-228.
35. Lehnert, W., 1987, Case-based problem solving with a large knowledge base of learned cases. Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87) (Los Altos, CA: Morgan Kaufmann), pp. 301-306.
36. Marcus, M., Santorini, B., and Marcinkiewicz, M. A., 1993, Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2): 313-330.
37. Michalski, R. S., 1983, A theory and methodology of inductive learning. Artificial Intelligence, 11: 111-161.
38. Niblett, T., 1987, Constructing decision trees in noisy domains. Proceedings of the Second European Working Session on Learning (Bled, Yugoslavia: Sigma), pp. 67-78.
39. Quinlan, J. R., 1986, Induction of decision trees. Machine Learning, 1: 81-206.
40. Quinlan, J. R., 1993, c4.5: Programs for Machine Learning (San Mateo, CA: Morgan Kaufmann).
41. Ramshaw, L. A., and Marcus, M. P., 1995, Text chunking using transformation-based learning. Proceedings of the Third Workshop on Very Large Corpora, Cambridge, June (USA: ACL), pp. 82-94.
42. Ratnaparkhi, A., 1998, Maximum entropy models for natural language ambiguity resolution. PhD thesis, University of Pennsylvania, USA.
43. Ratnaparkhi, A., Reynar, J., and Roukos, S., 1994, A maximum entropy model for prepositional phrase attachment. Workshop on Human Language Technology, Plainsboro, NJ, March (ARPA) (San Mateo, CA: Morgan Kaufmann).
44. Salzberg, S., 1991, A nearest hyperrectangle learning method. Machine Learning, 6: 277-309.
45. Salzberg, S. L., 1997, On comparing classifiers: pitfalls to avoid and a recommended approach. Data Mining and Knowledge Discovery, 1(3).
46. Sejnowski, T. J., and Rosenberg, C. S., 1987, Parallel networks that learn to pronounce English text. Complex Systems, 1: 145-168.
47. Shavlik, J. W., and Dietterich, T. G. (eds), 1990, Readings in Machine Learning (San Mateo, CA: Morgan Kaufmann).
48. Shavlik, J. W., Mooney, R. J., and Towell, G. G., 1991, An experimental comparison of symbolic and connectionist learning algorithms. Machine Learning, 6: 111-143.
49. Stanfill, C., 1987, Memory-based reasoning applied to English pronunciation. Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87) (Los Altos, CA: Morgan Kaufmann), pp. 577-581.
50. Stanfill, C., and Waltz, D., 1986, Toward memory-based reasoning. Communications of the ACM, 29(12): 1213-1228.
51. Swonger, C. W., 1972, Sample set condensation for a condensed nearest neighbor decision rule for pattern recognition. Frontiers of Pattern Recognition, edited by S. Watanabe (Orlando, FL: Academic Press), pp. 511-519.
52. Tomek, I., 1976, An experiment with the edited nearest-neighbor rule. IEEE Transactions on Systems, Man, and Cybernetics, SMC-6(6): 448-452.
53. Van den Bosch, A., 1997, Learning to pronounce written words: a study in inductive language learning. PhD thesis, Universiteit Maastricht, The Netherlands.
54. Van den Bosch, A., Daelemans, W., and Weijters, A., 1996, Morphological analysis as classification: an inductive-learning approach. Proceedings of the Second International Conference on New Methods in Natural Language Processing, NeMLaP-2, Ankara, Turkey, edited by K. Oflazer and H. Somers (Ankara, Turkey: Bilkent University), pp. 79-89.
55. Vapnik, V., and Bottou, L., 1993, Local algorithms for pattern recognition and dependencies estimation. Neural Computation, 5(6): 893-909.
56. Veenstra, J. B., 1998, Fast NP chunking using memory-based learning techniques. Proceedings of BENE-LEARN'98, edited by F. Verdenius and W. van den Broek (Wageningen: ATO-DLO), pp. 71-79.
57. Weiss, S., and Kulikowski, C., 1991, Computer Systems that Learn (San Mateo, CA: Morgan Kaufmann).
58. Wettschereck, D., 1994, A study of distance-based machine learning algorithms. PhD thesis, Oregon State University, USA.
59. Wettschereck, D., Aha, D. W., and Mohri, T., 1997, A review and comparative evaluation of feature-weighting methods for a class of lazy learning algorithms. Artificial Intelligence Review, 11: 273-314 (special issue on Lazy Learning).
60. Wettschereck, D., and Dietterich, T. G., 1994, Locally adaptive nearest neighbor algorithms. Advances in Neural Information Processing Systems, Vol. 6, edited by J. D. Cowan, G. Tesauro, and J. Alspector (Palo Alto, CA: Morgan Kaufmann), pp. 184-191.
61. Wettschereck, D., and Dietterich, T. G., 1995, An experimental comparison of the nearest-neighbor and nearest-hyperrectangle algorithms. Machine Learning, 19: 1-25.
62. Wilson, D., 1972, Asymptotic properties of nearest neighbor rules using edited data. Institute of Electrical and Electronic Engineers Transactions on Systems, Man and Cybernetics, 2: 408-421.
63. Wolpert, D., 1989, Constructing a generalizer superior to NETtalk via mathematical theory of generalization. Neural Networks, 3: 445-452.
64. Zavrel, J., Daelemans, W., and Veenstra, J., 1997, Resolving PP attachment ambiguities with memory-based learning. Proceedings of the Workshop on Computational Language Learning (CoNLL'97), edited by M. Ellison (Madrid: ACL).