Using a stack decoder for structured search

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

18 Downloads (Pure)

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.
Original languageUndefined
Title of host publicationProceedings of the 10th International Conference on Flexible Query Answering Systems, FQAS 2013
Place of PublicationBerlin
PublisherSpringer
Pages519-530
Number of pages12
ISBN (Print)978-3-642-40768-0
DOIs
Publication statusPublished - Sep 2013

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume8132
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • EWI-24094
  • METIS-302566
  • IR-88556

Cite this

Tjin-Kam-Jet, K., Trieschnigg, R. B., & Hiemstra, D. (2013). Using a stack decoder for structured search. In Proceedings of the 10th International Conference on Flexible Query Answering Systems, FQAS 2013 (pp. 519-530). (Lecture Notes in Computer Science; Vol. 8132). Berlin: Springer. https://doi.org/10.1007/978-3-642-40769-7_45