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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Böckenhauer, H. J., Hromkovič, J., Královič, R., Mömke, T., & Steinhöfel, K. (2007). Efficient algorithms for the spoonerism problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4475 LNCS, pp. 78–92). Springer Verlag. https://doi.org/10.1007/978-3-540-72914-3_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
