Using a stack decoder for structured search

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tjin-Kam-Jet, K., Trieschnigg, D., & Hiemstra, D. (2013). Using a stack decoder for structured search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8132 LNAI, pp. 519–530). https://doi.org/10.1007/978-3-642-40769-7_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free