Efficient Algorithms for the Spoonerism Problem

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.

• Type: Conference
• Year: 2007
• Where: FUN
• Authors: Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
• Keywords: Algorithms, FUN 2007, Natural Language