90 search results - page 8 / 18 » Non-distributional Word Vector Representations |
CPM
1998
Springer
14 years 24 days ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
CIKM
2001
Springer
14 years 1 months ago
2001
Springer
The success of personal information agents depends on their ability to provide task-relevant information. This paper presents WordSieve, a new algorithm that generates context des...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Increasingly large text datasets and the high dimensionality associated with natural language create a great challenge in text mining. In this research, a systematic study is cond...
PAKDD
2009
ACM
14 years 3 months ago
2009
ACM
It is a challenging and important task to retrieve images from a large and highly varied image data set based on their visual contents. Problems like how to fill the semantic gap b...
CIVR
2007
Springer
14 years 2 months ago
2007
Springer
Large archives of Ottoman documents are challenging to many historians all over the world. However, these archives remain inaccessible since manual transcription of such a huge vo...