Using a Stack Decoder for Structured Search

We describe a novel and flexible method that translates free-text queries to structured queries for filling out web forms. This can benefit searching in web databases which only allow access to their information through complex web forms. We introduce boosting and discounting heuristics, and use the constraints imposed by a web form to find a solution both efficiently and effectively. Our method is more efficient and shows improved performance over a baseline system.

[1]  Jayant Madhavan,et al.  Google's Deep Web crawl , 2008, Proc. VLDB Endow..

[2]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[3]  Panayiotis Tsaparas,et al.  Structured annotations of web queries , 2010, SIGMOD Conference.

[4]  Ellen M. Voorhees.  Variations in relevance judgments and the measurement of retrieval effectiveness , 2000, Inf. Process. Manag..

[5]  Xiao Li,et al.  Extracting structured information from user queries with semi-supervised conditional random fields , 2009, SIGIR.

[6]  Alex Waibel,et al.  Readings in speech recognition , 1990 .

[7]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[8]  Thomas Demeester,et al.  What Snippets Say about Pages in Federated Web Search , 2012, AIRS.

[9]  Djoerd Hiemstra,et al.  Creating a Dutch Information Retrieval Test Corpus , 2001, CLIN.

[10]  Stephen Clark,et al.  Syntactic Processing Using the Generalized Perceptron and Beam Search , 2011, CL.

[11]  Ricardo A. Baeza-Yates,et al.  Challenges on Distributed Web Retrieval , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[12]  Eugene Agichtein,et al.  Unsupervised query segmentation using click data: preliminary results , 2010, WWW '10.

[13]  Djoerd Hiemstra,et al.  Creating an Information Retrieval test corpus for Dutch , 2002 .

[14]  Sunita Sarawagi,et al.  Automatic segmentation of text into structured records , 2001, SIGMOD '01.

[15]  ChengXiang Zhai,et al.  Unsupervised query segmentation using clickthrough for information retrieval , 2011, SIGIR '11.

[16]  Xiaohui Yu,et al.  Query segmentation using conditional random fields , 2009, KEYS '09.

[17]  Tie-Yan Liu,et al.  Information Retrieval Technology , 2014, Lecture Notes in Computer Science.

[18]  Matthias Hagen,et al.  Query segmentation revisited , 2011, WWW.

[19]  M. S. Ryan,et al.  The Viterbi Algorithm 1 1 The Viterbi Algorithm . , 2009 .

[20]  Andrew McCallum,et al.  Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.

[21]  Lalit R. Bahl,et al.  A Maximum Likelihood Approach to Continuous Speech Recognition , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Mitesh Patel,et al.  Structured databases on the web: observations and implications , 2004, SGMD.

[23]  Eugene Agichtein,et al.  Mining query structure from click data: a case study of product queries , 2011, CIKM '11.

[24]  Hugh E. Williams,et al.  Burst tries: a fast, efficient data structure for string keys , 2002, TOIS.