Skip to main content

Lexical Matching of Queries and Ads Bid Terms in Sponsored Search

  • Conference paper
  • First Online:
String Processing and Information Retrieval (SPIRE 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9954))

Included in the following conference series:

Abstract

We present an algorithm that matches queries to a set of advertising bid terms, including lexical variants. We use an enhanced digital tree as index that allows to match misspelled words, word segmentation and splitting, and some stems. The results, both in quality and performance, are competitive and improved revenue in several percentage points. To the best of our knowledge, this is the first pure lexical matching algorithm for sponsored search.

This work was carried out when the first author was at Yahoo Labs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    See https://en.wikipedia.org/wiki/GeoPlanet.

References

  1. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval: The Concepts and Technology Behind Search, 2nd edn. Addison-Wesley, New York (2011)

    Google Scholar 

  2. Baeza-Yates, R.A., Gonnet, G.H.: Fast text searching for regular expressions or automaton searching on tries. J. ACM 43(6), 915–936 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baeza-Yates, R.A., Gonnet, G.H.: A fast algorithm on average for all-against-all sequence matching. In: Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, 21–24 September 1999, pp. 16–23 (1999)

    Google Scholar 

  4. Baeza-Yates, R.A., Navarro, G.: A faster algorithm for approximate string matching. In: 7th Annual Symposium on Combinatorial Pattern Matching CPM 1996, Laguna Beach, California, USA, 10–12 June 1996, pp. 1–23 (1996)

    Google Scholar 

  5. Broder, A., Ciccolo, P., Gabrilovich, E., Josifovski, V., Metzler, D., Riedel, L., Yuan, J.: Online expansion of rare queries for sponsored search. In: Proceedings of the 18th International Conference on World Wide Web, pp. 511–520. ACM (2009)

    Google Scholar 

  6. Davis, D.J., Derer, M., Garcia, J., Greco, L., Kurt, T.E., Kwong, T., Lee, J.C., Lee, K.L., Pfarner, P., Skovran, S., et al.: System and method for influencing a position on a search result list generated by a computer network search engine, US Patent 6,269,361, 31 July 2001

    Google Scholar 

  7. Grbovic, M., Djuric, N., Radosavljevic, V., Silvestri, F., Baeza-Yates, R., Feng, A., Ordentlich, E., Yang, L., Owens, G.: Scalable semantic matching of search queries to ads in sponsored search advertising. In: Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM (2016)

    Google Scholar 

  8. Grbovic, M., Djuric, N., Radosavljevic, V., Silvestri, F., Bhamidipati, N.: Context-and content-aware embeddings for query rewriting in sponsored search. In: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 383–392. ACM (2015)

    Google Scholar 

  9. Jansen, B.J., Flaherty, T., Baeza-Yates, R.A., Hunter, L., Kitts, B., Murphy, J.: The components and impact of sponsored search. IEEE Comput. 42(5), 98–101 (2009)

    Article  Google Scholar 

  10. Jansen, B.J., Mullen, T.: Sponsored search: an overview of the concept, history, and technology. Int. J. Electron. Bus. 6(2), 114–131 (2008)

    Article  Google Scholar 

  11. Levin, J., Milgrom, P.: Online advertising: heterogeneity and conflation in market design. Am. Econ. Rev. 100(2), 603–607 (2010)

    Article  Google Scholar 

  12. Navarro, G.: Approximate string matching. In: Kao, M-Y. (ed.) Encyclopedia of Algorithms, pp. 1–5. Springer, New York (2014)

    Google Scholar 

  13. Navarro, G., Baeza-Yates, R.A., Arcoverde, J.M.A.: Matchsimile: a flexible approximate matching tool for searching proper names. JASIST 54(1), 3–15 (2003)

    Article  Google Scholar 

  14. Radlinski, F., Broder, A., Ciccolo, P., Gabrilovich, E., Josifovski, V., Riedel, L.: Optimizing relevance and revenue in ad search: a query substitution approach. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 403–410. ACM (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ricardo Baeza-Yates .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Baeza-Yates, R., Wang, G. (2016). Lexical Matching of Queries and Ads Bid Terms in Sponsored Search. In: Inenaga, S., Sadakane, K., Sakai, T. (eds) String Processing and Information Retrieval. SPIRE 2016. Lecture Notes in Computer Science(), vol 9954. Springer, Cham. https://doi.org/10.1007/978-3-319-46049-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46049-9_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46048-2

  • Online ISBN: 978-3-319-46049-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics