Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R., Castillo, C., Junqueira, F., Plachouras, V., Silvestri, F.: Challenges on distributed web retrieval. In: ICDE 2007, pp. 6–20 (April 2007)
Bahl, L.R., Jelinek, F., Mercer, R.L.: A maximum likelihood approach to continuous speech recognition. In: Readings in Speech Recognition, pp. 308–319. Morgan Kaufmann Publishers Inc., San Francisco (1990)
Borkar, V., Deshmukh, K., Sarawagi, S.: Automatic segmentation of text into structured records. In: SIGMOD 2001, pp. 175–186. ACM, New York (2001)
Chang, K.C.-C., He, B., Li, C., Patel, M., Zhang, Z.: Structured databases on the web: observations and implications. SIGMOD Record 33(3), 61–70 (2004)
Demeester, T., Nguyen, D., Trieschnigg, D., Develder, C., Hiemstra, D.: What snippets say about pages in federated web search. In: Hou, Y., Nie, J.-Y., Sun, L., Wang, B., Zhang, P. (eds.) AIRS 2012. LNCS, vol. 7675, pp. 250–261. Springer, Heidelberg (2012)
Forney Jr., G.D.: The viterbi algorithm. Proc. of the IEEE 61(3), 268–278
Hagen, M., Potthast, M., Stein, B., Braeutigam, C.: Query segmentation revisited. In: WWW 2011, pp. 97–106. ACM, New York (2011)
Heinz, S., Zobel, J., Williams, H.E.: Burst tries: a fast, efficient data structure for string keys. In: TOIS 2002, vol. 20(2), pp. 192–223 (2002)
Hiemstra, D., van Leeuwen, D.A.: Creating an information retrieval test corpus for dutch. In: CLIN 2001, Amsterdam, The Netherlands. Language and Computers - Studies in Practical Linguistics, vol. 45, pp. 133–147. Rodopi (2002)
Kiseleva, J., Guo, Q., Agichtein, E., Billsus, D., Chai, W.: Unsupervised query segmentation using click data: preliminary results. In: WWW 2010, pp. 1131–1132. ACM, New York (2010)
Kiseleva, J., Agichtein, E., Billsus, D.: Mining query structure from click data: a case study of product queries. In: CIKM 2011, pp. 2217–2220. ACM, New York (2011)
Lafferty, J.D., McCallum, A., Pereira, F.C.N.: Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: ICML 2001, San Francisco, CA, USA, pp. 282–289. Morgan Kaufmann Publishers Inc. (2001)
Li, X., Wang, Y.-Y., Acero, A.: Extracting structured information from user queries with semi-supervised conditional random fields. In: SIGIR 2009, pp. 572–579. ACM, New York (2009)
Li, Y., Hsu, B.-J.P., Zhai, C., Wang, K.: Unsupervised query segmentation using clickthrough for information retrieval. In: SIGIR 2011, pp. 285–294. ACM, New York (2011)
Madhavan, J., Ko, D., Kot, L., Ganapathy, V., Rasmussen, A., Halevy, A.: Google’s deep web crawl. Proc. VLDB Endow. 1(2), 1241–1252 (2008)
Rabiner, L.R.: A tutorial on hidden markov models and selected applications in speech recognition. Proc. of the IEEE 77(2), 257–286 (1989)
Sarkas, N., Paparizos, S., Tsaparas, P.: Structured annotations of web queries. In: SIGMOD 2010, pp. 771–782. ACM, New York (2010)
Voorhees, E.M.: Variations in relevance judgments and the measurement of retrieval effectiveness. Inf. Processing and Management 36(5), 697–716 (2000)
Yu, X., Shi, H.: Query segmentation using conditional random fields. In: KEYS 2009, pp. 21–26. ACM, New York (2009)
Zhang, Y., Clark, S.: Syntactic processing using the generalized perceptron and beam search. Computational Linguistics 37(1), 105–151 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tjin-Kam-Jet, K., Trieschnigg, D., Hiemstra, D. (2013). Using a Stack Decoder for Structured Search. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2013. Lecture Notes in Computer Science(), vol 8132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40769-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-40769-7_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40768-0
Online ISBN: 978-3-642-40769-7
eBook Packages: Computer ScienceComputer Science (R0)