Kernel methods for word sense disambiguation and acronym expansion

Authors:
Mahesh Joshi;Ted Pedersen;Richard Maclin;Serguei Pakhomov
Affiliations:
Department of Computer Science, University of Minnesota, Duluth, MN;Department of Computer Science, University of Minnesota, Duluth, MN;Department of Computer Science, University of Minnesota, Duluth, MN;Division of Biomedical Informatics, Mayo College of Medicine, Rochester, MN
Venue:
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Year:
2006

Citing 5
Cited 1

An automatic method for generating sense tagged corpora

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Latent Semantic Kernels

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Semi-supervised Maximum Entropy based approach to acronym and abbreviation normalization in medical texts

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Domain kernels for word sense disambiguation

ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Effective use of WordNet semantics via kernel-based learning

CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning

Supervised word sense disambiguation using semantic diffusion kernel

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the ...