Change search
ReferencesLink to record
Permanent link

Direct link
Efficient Algorithms for the Spoonerism Problem
ETH Zurich.
ETH Zurich.
ETH Zurich.
ETH Zurich.
Show others and affiliations
2007 (English)In: Fun with Algorithms: 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Springer, 2007, Vol. 4475, 78-92 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer, 2007. Vol. 4475, 78-92 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 4475
Keyword [en]
spoonerism problem, efficient algorithms
National Category
Computer Science
URN: urn:nbn:se:kth:diva-51156DOI: 10.1007/978-3-540-72914-3\_9ISI: 000247837500009ISBN: 978-3-540-72913-6OAI: diva2:463561
4th international conference on fun with algorithms (FUN 2007), Castiglioncello, Italy, June 3-5, 2007
VEGA 1/3106/06EPSRC EP/D062012/1
QC 20120111Available from: 2012-01-11 Created: 2011-12-09 Last updated: 2012-01-11Bibliographically approved

Open Access in DiVA

fulltext(328 kB)275 downloads
File information
File name FULLTEXT01.pdfFile size 328 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full

Search in DiVA

By author/editor
Mömke, Tobias
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 275 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 35 hits
ReferencesLink to record
Permanent link

Direct link