skip to main content
10.1145/1386790.1386792acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
research-article

Natural language generation for sponsored-search advertisements

Published:08 July 2008Publication History

ABSTRACT

In sponsored search, advertisers bid on phrases representative of offered products or services. For large advertisers, these phrases often come from quasi-algorithmically generated lists of thousands of terms prone to poor linguistic construction. A bidded term by itself is usually unsuitable for direct insertion into an ad copy template; it must be rephrased and capitalized properly to fit the template, possibly with additional language to avoid semantic ambiguity. We develop a natural language generation system to automate these steps, preparing a list of terms for insertion into an ad template. For each input term, our system first finds a proper word ordering by mining a corpus of Web search query logs. Next it determines whether the term is ambiguous and--if semantics dictate--attaches a clarifying modifier culled from query logs. Finally, it applies proper capitalization by analyzing pages from Web search engine results. Each step yields a plausible set of displayable forms from which a machine-learned model selects the best. The models are trained and tested on a large set of human-labeled data. The overall system significantly outperforms baseline systems that use simple heuristics.

References

  1. H. Akaike. A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19(6):716--723, 1974.Google ScholarGoogle ScholarCross RefCross Ref
  2. I. Alegria, B. Arrieta, A. D. de Ilarraza, E. Izagirre, and M. Maritxalar. Using machine learning techniques to build a comma checker for basque. Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 1--8, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Arellano. Panel Data Econometrics. Oxford University Press, Oxford, UK, 2003.Google ScholarGoogle Scholar
  4. C. Chelba and A. Acero. Adaptation of maximum entropy capitalizer: Little data can help a lot. Computer Speech & Language, 20(4):382--399, 2006.Google ScholarGoogle Scholar
  5. D. Conway. An algorithmic approach to english pluralization. Proceedings of the Second Annual Perl Conference, 1998.Google ScholarGoogle Scholar
  6. B. DiEugenio, J. Moore, and M. Paolucci. Learning features that predict cue usage. Proceedings of the 35th Annual Meeting of the Association Computational Linguistics, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. C. Fain and J. O. Pedersen. Sponsored search: A brief history. Proceedings of the ACM Conference on Electronic Commerce: Second Workshop on Sponsored Search Auctions, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  8. D. Hardt. Comma checking in danish. Proceedings of the Corpus Linguistics 2001 Conference, pages 266--271, 2001.Google ScholarGoogle Scholar
  9. B. J. Jansen, A. Spink, and T. Saracevic. Real life, real users and real needs: A study and analysis of users' queries on the web. Information Processing and Management, 36(2):207--227, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. D. McFadden. Conditional logit analysis of qualitative choice behavior. In P. Zarembka, editor, Frontiers in Econometrics. Academic Press, New York, 1974.Google ScholarGoogle Scholar
  11. J. Oberlander and C. Brew. Stochastic text generation. Philosophical Transactions: Mathematical, Physical and Engineering Science, 358:1373--1387, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  12. M. Porter. An algorithm for suffix stripping. Program, 14(3):130--137, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  13. D. R. Radev and K. R. McKeown. Generating natural language summaries from multiple on-line sources. Computational Linguistics, 24(3):470--500, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. Reed and D. Long. Generating punctuation in written arguments. Technical Report RN/97/157, Department of Computer Science, University College, London, UK, 1997.Google ScholarGoogle Scholar
  15. C. Tillman and H. Ney. Word reordering and a dynamic programming beam search algorithm for statistical machine translation. Computational Linguistics, 29(1):97--133, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. K. Train. Discrete Choice Methods with Simulation. Cambridge University Press, Cambridge, UK, 2003.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Natural language generation for sponsored-search advertisements

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      EC '08: Proceedings of the 9th ACM conference on Electronic commerce
      July 2008
      332 pages
      ISBN:9781605581699
      DOI:10.1145/1386790

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 July 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate664of2,389submissions,28%

      Upcoming Conference

      EC '24
      The 25th ACM Conference on Economics and Computation
      July 8 - 11, 2024
      New Haven , CT , USA

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader