Sciweavers

252 search results - page 13 / 51
» Automata for Data Words and Data Trees
Sort
View
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 2 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
LREC
2010
170views Education» more  LREC 2010»
13 years 9 months ago
Arabic Word Segmentation for Better Unit of Analysis
The Arabic language has a very rich morphology where a word is composed of zero or more prefixes, a stem and zero or more suffixes. This makes Arabic data sparse compared to other...
Yassine Benajiba, Imed Zitouni
ACSC
2001
IEEE
13 years 11 months ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
14 years 2 days ago
On-Line Construction of Compact Directed Acyclic Word Graphs
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...
ECML
2007
Springer
13 years 11 months ago
Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble
Abstract. Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the deci...
Anneleen Van Assche, Hendrik Blockeel