Can Short Queries Be Even Shorter?

Peilin Yang and Hui Fang. Can Short Queries Be Even Shorter?. In Proceedings of the 2017 ACM on International Conference on the Theory of Information Retrieval (ICTIR'2017). ACM, New York, NY, USA, 43-50.

@inproceedings{Yang:2017:SQE:3121050.3121056,
 author = {Yang, Peilin and Fang, Hui},
 title = {Can Short Queries Be Even Shorter?},
 booktitle = {Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval},
 series = {ICTIR '17},
 year = {2017},
 isbn = {978-1-4503-4490-6},
 location = {Amsterdam, The Netherlands},
 pages = {43--50},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/3121050.3121056},
 doi = {10.1145/3121050.3121056},
 acmid = {3121056},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {query reformulation, query representation},
 }