161 search results - page 7 / 33 » Counting Distinct Strings |
COLING
1996
13 years 10 months ago
1996
This paper describes a new method for extracting open compounds (uninterrupted sequences of words) from text corpora of languages, such as Thai, Japanese and Korea that exhibit un...
AMSTERDAM
2009
13 years 6 months ago
2009
This paper offers an account of the semantics of count nous. I show that neither the atomic/nonatomic distinction nor the homogeneous/non-homogeneous distinction is sufficient to ...
ICDAR
1999
IEEE
14 years 25 days ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
JCT
2011
13 years 3 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
TOIS
2002
13 years 8 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...