Sciweavers

773 search results - page 91 / 155
» Suffix Trees on Words
Sort
View
MFCS
1998
Springer
15 years 4 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
EACL
2003
ACL Anthology
15 years 1 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
ICML
2009
IEEE
16 years 20 days ago
Incorporating domain knowledge into topic modeling via Dirichlet Forest priors
Users of topic modeling methods often have knowledge about the composition of words that should have high or low probability in various topics. We incorporate such domain knowledg...
David Andrzejewski, Xiaojin Zhu, Mark Craven
DATESO
2004
165views Database» more  DATESO 2004»
15 years 1 months ago
Multi-dimensional Sparse Matrix Storage
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
Jiri Dvorský, Michal Krátký
DBA
2004
106views Database» more  DBA 2004»
15 years 1 months ago
Classification of Websites as Sets of Feature Vectors
The world wide web is the largest source for all kind of information currently available. Due to its enormous size retrieving relevant information is a difficult task for which us...
Hans-Peter Kriegel, Matthias Schubert