901 search results - page 135 / 181 » On Anonymization of String Data |
129
click to vote
EMNLP
2004
15 years 2 months ago
2004
We present a new approach to intrinsic summary evaluation, based on initial experiments in van Halteren and Teufel (2003), which combines two novel aspects: comparison of informat...
106
click to vote
EACL
2003
ACL Anthology
15 years 2 months ago
2003
ACL Anthology
In this paper, a word alignment approach is presented which is based on a combination of clues. Word alignment clues indicate associations between words and phrases. They can be b...
SODA
2004
ACM
15 years 2 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
NAACL
2003
15 years 2 months ago
2003
This paper describes an application of active learning methods to the classification of phone strings recognized using unsupervised phonotactic models. The only training data req...
103
click to vote
TCS
2008
15 years 1 months ago
2008
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...