Sciweavers

32 search results - page 2 / 7
» Improved count suffix trees for natural language data
Sort
View
EMNLP
2008
13 years 6 months ago
A Dependency-based Word Subsequence Kernel
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...
Rohit J. Kate
ICASSP
2010
IEEE
13 years 5 months ago
Language model adaptation using Random Forests
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
Anoop Deoras, Frederick Jelinek, Yi Su
COLING
2010
12 years 11 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens
CIKM
2008
Springer
13 years 6 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
JMLR
2008
148views more  JMLR 2008»
13 years 4 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov