Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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, Published 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.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4475
Keyword [en]
spoonerism problem, efficient algorithms
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-51156DOI: 10.1007/978-3-540-72914-3\_9ISI: 000247837500009ISBN: 978-3-540-72913-6 (print)OAI: oai:DiVA.org:kth-51156DiVA: diva2:463561
Conference
4th international conference on fun with algorithms (FUN 2007), Castiglioncello, Italy, June 3-5, 2007
Projects
VEGA 1/3106/06EPSRC EP/D062012/1
Note
QC 20120111Available from: 2012-01-11 Created: 2011-12-09 Last updated: 2012-01-11Bibliographically approved

Open Access in DiVA

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

Other links

Publisher's full textwww.Springerlink.com

Search in DiVA

By author/editor
Mömke, Tobias
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 319 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

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 60 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf