Program to Spoonerise words

Question

A spoonerisation is swapping the first letter/pronounceable syllable of two or more words.

Example: A lack of pies = A pack of lies. Bad salad = Sad ballad (ish) :)

Challenge: Write a program to spoonerise two words in the shortest characters possible.

Rules:

1. If the first letter is a consonant, you must include subsequent letters until you reach a vowel. (e.g. 'thanks' - the th gets removed and put on the front of the other word).
2. With words that start with vowels, do not remove anything from the start of the word.

Good luck :)

---

UPDATE: Multiple word spoonerisms are not strictly applicable, however from a programatic view we must cater for them so this is the rule: Every word must change. Example:

Weird Keen Monkey -> Meird Ween Konkey OR Keird Meen Wonkey NOT Meird Keen Wonkey

Also 'y' is treated as a vowel (just to simplify things a bit)

Answer 1

Ruby (60) (61) (93) (80) (75) (71) (69 / 57)

Program changed to handle the new requirement of handling multiple words.

EDIT: Golfed down to 80. 75. 71. 69.

w=[];gets.gsub(/(\S*?)([aeiouy]\S*)/i){w+=[$2,' ',$1]};$><<w.pop+w*''

If we're only spoonerizing words that start with a consonant, here's a solution in 73. 65. (I realized I can just use scan instead of gsub.) 57.

$><<gets.gsub(p=/\b[^aeiouy\s]+/i){($'+$`+$&).scan(p)[0]}

Old program (two words only):

p='(.*?)([aeiou].+)';puts gets.gsub(/#{p} #{p}/i,'\3\2 \1\4')

Answer 2

Haskell, 81

f[(a,b),(c,d)]=unwords[c++b,a++d]
main=interact$f.map(break(`elem`"aeiou")).words

Answer 3

Ruby, 57 56

This only works for the original problem (with only two words).

$><<gets.sub(/#{r='([^aeiou]*)(.+)'} #{r}/i,'\3\2 \1\4')

Answer 4

Perl, 43 (question v1), 91 79 (question v2) [107 to handle numerals in the phrase]

v1

Run with -p option (counted as 3 chars).

$p='([^aeiou]*)(.+)';s/$p $p/$3$2 $1$4/i

Same technique as the Ruby answers.

Using -p saves 9 characters over bracketing the code with $_=<>; and ;print for explicit IO.

v2

Run with -lp (counted as 4 chars).

push@a,$1while s/\b([^ aeiouy\d]+)(?=[aeiouy])/$n++/ei;unshift@a,pop@a;s/(\d+)/$a[$1]/g

Rotates all the consonant-starts of words one word forward.

Updated: Add vowel lookahead, so it handles "to the nth degree" more gracefully ("do te nth thegree", not "do te th nthegree").

Numerals: user unknown asked about handling "There is no winner in 2011", because of the numerals. Adding markers around the numbers my solution uses, it can handle that:

push@a,$1while s/\b([^ aeiouy\0\d]+)(?=[aeiouy])/"\0".$n++."\0"/ei;unshift@a,pop@a;s/\0(\d+)\0/$a[$1]/g

Small question, big discussion....

Answer 5

J, 77

Answers the original version of the question, "spoonerise two words"; a solution for the changed question may follow.

Couldn't shrink this to compete with the Ruby answers, so fell back on my more-familiar Perl.

exit([:;3 1 2 0 4{[:,({.@I.@e.&'aeiouAEIOU'({.;' ';~}.)]);._2@,&' ')&.stdin''

• ,&' ' appends a space

• (...);._2 splits on the last character (the space) and applies the parenthesized code to each element (i.e., each word)

• {. @ I. @ e.&'aeiouAEIOU' finds the index of the first vowel in that word

• ({.;' ';~}.) splits the word into leading consonants (if any) and a tail, with a space at the end (each in a "box", so J doesn't pad them to matching lengths)

• , flattens the 2r x 3c matrix formed by the preceding into a 6-element list

• 3 1 2 0 4{ takes all those elements but the trailing space, swapping the lead segments of the words

• ; unboxes and concatenates the elements

• (...)&.stdin'' does roughly the same as Perl's -p, reading stdin and echoing the result of "..." to stdout

• the explicit exit suppresses J's prompt for more input

Answer 6

CSharp - 236

List<string> f(string w) {var t="aeiou".ToCharArray();var q=w.Split(' ').Where(c=>!t.Contains(c[0]));var i=q.Count()-1;return q.Select(c=>q.Select(x=>x.Substring(0,x.IndexOfAny(t))).ToList()[i--]+c.Substring(c.IndexOfAny(t))).ToList();}

Answer 7

Scala 244

val s=readLine
def f(a:String,b:String)=a.replaceAll("^[^aeiouy]+",b.replaceAll("[aeiouy].*",""))
val l=("((^| )[^aeiouyAEIOUY]+)([^ ]+)".r findAllIn s map(_.trim)).toList
println(s.replaceAll(l(0),f(l(0),l(1))).replaceAll(l(1),f(l(1),l(0))))

My code contains 4 y (one of them lowercase) to handle why and rythm in a useful manner.

---

Scala 248, updated for new challenge (change all consonantic words)

val w=readLine.split(" ")
val c=w.filter(_.matches("[^aeiouyAEIOUY].*"))
val l=c.size
var k=0
println((for(i<-0 to w.size-1)yield{if(w(i)==c(k%l)){k+=1
c(k-1).replaceAll("^[^aeiouy]+",c(k%l).replaceAll("[aeiouy].*",""))}else w(i)}).mkString(" "))

ungolfed, and test cases:

val samples = List ("bad salad", "I tell smooth", "Sentence with vowel in the end", "tain bruck is faboo")
def konsInit (s: String) = s.matches ("[^aeiouyAEIOUY].*")
def flipInit (a: String, b: String) = a.replaceAll ("^[^aeiouy]+", b.replaceAll ("[aeiouy].*", "")) 
def spoonize (sentence: String) {
  val words = sentence.split (" ")
  val kwords = words.filter (konsInit);
  val len = kwords.size
  var k = 0
  val spoonies = for (i <- 0 to words.size-1) yield {
    if (words (i) == kwords (k%len)) {
      k += 1
      flipInit (kwords (k-1), kwords (k%len)) 
    } else words (i) 
  }
  println (spoonies.mkString (" ")) 
}
samples.foreach (spoonize)

sad balad
I smell tooth
wentence vith thowel in Se end

The last example can't be shown.