K-best suffix arrays

NAACL-HLT 2007 - Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, Companion Volume: Short Papers

Volumn , Issue , 2007, Pages 17-20

  Church, Kenneth ^a   Thiesson, Bo ^a   Ragno, Robert ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLICKTHROUGH RATES (CTR); K-D TREE; LOOKUP TIME; SUB-STRINGS; SUBLINEAR TIME; SUFFIX ARRAYS;

EID: 63349110851     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Jon Louis Bentley. 1975. Multidimensional Binary Search Trees Used for Associative Searching, Communications of the ACM, 18:9, pp. 509-517.
2. Kenneth Church and Bo Thiesson. 2005. The Wild Thing, ACL, pp. 93-96.
3. Udi Manber and Gene Myers. 1990. Suffix Arrays: A New Method for On-line String Searches, SODA, pp. 319-327.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, pp.73-90.