Efficient Algorithms for the Spoonerism Problem

  • Hans-Joachim Böckenhauer
  • Juraj Hromkovič
  • Richard Královič
  • Tobias Mömke
  • Kathleen Steinhöfel
Conference paper

DOI: 10.1007/978-3-540-72914-3_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)
Cite this paper as:
Böckenhauer HJ., Hromkovič J., Královič R., Mömke T., Steinhöfel K. (2007) Efficient Algorithms for the Spoonerism Problem. In: Crescenzi P., Prencipe G., Pucci G. (eds) Fun with Algorithms. FUN 2007. Lecture Notes in Computer Science, vol 4475. Springer, Berlin, Heidelberg

Abstract

A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algorithms for deciding whether a given sentence, made up from words of a given dictionary, is a spoonerism or not.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Hans-Joachim Böckenhauer
    • 1
  • Juraj Hromkovič
    • 2
  • Richard Královič
    • 1
    • 3
  • Tobias Mömke
    • 1
  • Kathleen Steinhöfel
    • 2
  1. 1.Department of Computer Science, ETH ZurichSwitzerland
  2. 2.Department of Computer Science, King’s College LondonUnited Kingdom
  3. 3.Department of Computer Science, Comenius UniversitySlovakia

Personalised recommendations