ACM Home Page
Please provide us with feedback. Feedback
Query segmentation using conditional random fields
Full text PdfPdf (395 KB)
Source
International Conference on Management of Data archive
Proceedings of the First International Workshop on Keyword Search on Structured Data table of contents
Providence, Rhode Island
SESSION: Keyword query disambiguation table of contents
Pages 21-26  
Year of Publication: 2009
ISBN:978-1-60558-570-3
Authors
Xiaohui Yu  York University, Toronto, ON, Canada
Huxia Shi  York University, Toronto, ON, Canada
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557670.1557680
What is a DOI?

ABSTRACT

A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this paper, we address the problem of keyword query segmentation, i.e., how to group nearby keywords in a query into segments. This operation can greatly benefit both the quality and the efficiency of the subsequent search operations. Compared with previous work, the proposed approach is based on Conditional Random Fields (CRF), and provides a principled statistical model that can be learned from query logs and easily adapt to user preferences. Extensive experiments on two real datasets confirm the effectiveness the efficiency of the proposed approach.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. Finding top-k min-cost connected trees in databases. In ICDE, pages 836--845, 2007.
3
 
4
 
5
 
6
7
 
8
9
10
11
 
12
13
14