Sciweavers

50 search results - page 5 / 10
» A Stemming Algorithm for the Farsi Language
Sort
View
CLEF
2007
Springer
15 years 3 months ago
Domain-Specific IR for German, English and Russian Languages
In participating in this CLEF evaluation campaign, our first objective is to propose and evaluate various indexing and search strategies for the Russian language, in order to obta...
Claire Fautsch, Ljiljana Dolamic, Samir Abdou, Jac...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
15 years 4 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
DAGSTUHL
2006
14 years 11 months ago
A Cross-Language Approach to Historic Document Retrieval
Our cultural heritage, as preserved in libraries, archives and museums, is made up of documents written many centuries ago. Largescale digitization initiatives make these documents...
Jaap Kamps, Marijn Koolen, Frans Adriaans, Maarten...
CLEF
2009
Springer
14 years 10 months ago
Unsupervised Morpheme Discovery with Ungrade
Abstract. In this paper, we present an unsupervised algorithm for morpheme discovery called UNGRADE (UNsupervised GRAph DEcomposition). UNGRADE works in three steps and can be appl...
Bruno Golénia, Sebastian Spiegler, Peter A....
PPOPP
2012
ACM
13 years 5 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal