Sciweavers

80 search results - page 1 / 16
» Kernelized Sorting for Natural Language Processing
Sort
View
AAAI
2010
13 years 6 months ago
Kernelized Sorting for Natural Language Processing
Kernelized sorting is an approach for matching objects from two sources (or domains) that does not require any prior notion of similarity between objects across the two sources. U...
Jagadeesh Jagarlamudi, Seth Juarez, Hal Daum&eacut...
ACL
2004
13 years 6 months ago
Convolution Kernels with Feature Selection for Natural Language Processing Tasks
Convolution kernels, such as sequence and tree kernels, are advantageous for both the concept and accuracy of many natural language processing (NLP) tasks. Experiments have, howev...
Jun Suzuki, Hideki Isozaki, Eisaku Maeda
EACL
2006
ACL Anthology
13 years 6 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
NIPS
2003
13 years 6 months ago
Kernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Jun Suzuki, Yutaka Sasaki, Eisaku Maeda