5
\$\begingroup\$

Write a program which accepts a sentence into stdin, and writes that sentence to stdout in pig latin.

Here are some test cases which your program should handle:

Input:
    Read your script
Output:
    ead-Ray our-yay ipt-scray

Hyphenation is mandatory. Note that multiple consonants at the start of the word must all be moved to the end. Capitalization of the output does not matter; Ead-ray or ead-ray are also valid translations of Read

Input:
    An utterance is allowed an opening vowel
Output:
    An-way utterance-way is-way allowed-way an-way opening-way owel-vay

Words starting with vowels have -way appended in their pig latin form (don't forget to handle capital opening vowels)

Input:
    sky
    -skyay

Words consisting entirely of consonants should have a hyphen prepended, and ay appended

Punctuation is undefined; I don't care if leading or trailing punctuation ends up inside the pig latin word.

This is code golf; the shortest program by character count wins. I've written a solution myself which handles all these cases which I shall post as a response.

| improve this question | |
\$\endgroup\$
  • \$\begingroup\$ And what if there is a language that has a built-in piglatinify function? The Odegolfpay language springs to mind. You should add a clause that penalises the use of libraries like that. \$\endgroup\$ – Mr Lister Oct 24 '12 at 21:18
  • \$\begingroup\$ @MrLister I think it's better to not add a bunch of little restrictions to the puzzle unless it's actually a problem. Besides, an answer in such a language really isn't very interesting and I doubt it would get many upvotes. \$\endgroup\$ – Peter Olson Oct 31 '12 at 2:20
  • 1
    \$\begingroup\$ @PeterOlson O-Kay. \$\endgroup\$ – Mr Lister Oct 31 '12 at 7:08
  • \$\begingroup\$ -151 point bonus if an input of caribou lou gives aribou-kay, ou-lay, terrible day, you pay the liquor store teller with no hair or toupe \$\endgroup\$ – cat Feb 4 '16 at 16:34

11 Answers 11

Active Oldest Votes
3
\$\begingroup\$

Perl (53)

s/(.*?)([aeiou].*)/$1||=w;print"$2-$1ay "/iefor split
| improve this answer | |
\$\endgroup\$
3
\$\begingroup\$

Python, 89

import re
print re.sub('-a','-wa',re.sub('(?i)([^aeiou ]*)(\w*)',r'\2-\1ay',raw_input()))
| improve this answer | |
\$\endgroup\$
3
\$\begingroup\$

Perl, 41 excluding switches

A simple modification of Timwi's answer. Runs with perl -p. Does not meet the spec for 'sky', but the original doesn't either.

s/(\S*?)([aeiou]\S*)/"$2-".($1||w).ay/ige
| improve this answer | |
\$\endgroup\$
2
\$\begingroup\$

Perl (60)

Use perl -n. The -n switch is counted (as two characters).

s/(.*?)([aeiou].*)/print"$2-$1"."w"x!$1."ay "/iefor split
| improve this answer | |
\$\endgroup\$
2
\$\begingroup\$

Perl 6,  78  66 bytes

put get.words.map: {samecase S:i/(.*?)(<[aeiou]>.*)|(.*)/$1-{~$0||'w'}ay/, $_}
put get.words.map: {~S:i/(.*?)(<[aeiou]>.*)|(.*)/$1-{~$0||'w'}ay/}

( You would use the samecase one if you cared about capitalization )

$ perl6 -e 'put get.words.map: {~S:i/(.*?)(<[aeiou]>.*)|(.*)/$1-{~$0||"w"}ay/}'
Read your script
ead-Ray our-yay ipt-scray

$ perl6 -e 'put get.words.map: {~S:i/(.*?)(<[aeiou]>.*)|(.*)/$1-{~$0||"w"}ay/}'
An utterance is allowed an opening vowel
An-way utterance-way is-way allowed-way an-way opening-way owel-vay

$ perl6 -e 'put get.words.map: {~S:i/(.*?)(<[aeiou]>.*)|(.*)/$1-{~$0||"w"}ay/}'
sky
-skyay
| improve this answer | |
\$\endgroup\$
  • \$\begingroup\$ auto +1 for Perl 6! \$\endgroup\$ – cat Feb 4 '16 at 16:31
1
\$\begingroup\$

Python - 122 85 characters

import re
print re.sub("-a","-wa",re.sub("([^aeiou ]*)(\w*)",r"\2-\1ay",raw_input()))

122 -> 85: Improved use of regexes; running regex on whole sentence rather than individual words, and doing all the processing with regexes rather than a conditional expression. This ended up making it pretty similar to grc's answer

| improve this answer | |
\$\endgroup\$
  • \$\begingroup\$ I would switch to Python 3 and shave off 2 characters :) \$\endgroup\$ – nneonneo Oct 25 '12 at 17:19
1
\$\begingroup\$

Cojure - 376 characters

Obviously not winning this one, but figured I'd take a shot at it.

Minified:

(defn n [a b] (reduce #(and % %2) (map #(= (.indexOf a %) -1) (map string/lower-case (rest b)))))
(defn t [a] (let [vowels ["a" "e" "i" "o" "u"] x "ay"] (if (> (.indexOf vowels (string/lower-case (first a))) -1) (str a "-way") (if (n vowels a) (str a x) (str (reduce str (rest a)) "-" (first a) x)))))
(defn ay-ya [a] (reduce str (map #(str (t %) " ") (string/split a #" "))))

Actual:

(defn no-vowel [a b]
    (reduce #(and % %2) (map #(= (.indexOf a %) -1) (map string/lower-case (rest b)))))

(defn transform [text]
  (let [vowels ["a" "e" "i" "o" "u"]]
    (if (> (.indexOf vowels (string/lower-case (first text))) -1)
        (str text "-way")
        (if (no-vowel vowels text)
          (str text "ay")
          (str (reduce str (rest text)) "-" (first text) "ay")))))


(defn ay-ya [text]
    (reduce str
        (map #(str (transform %) " ")  
             (clojure.string/split text #" "))))
| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

K, 95

" "/:{$[&/~x in v:v,_v:"AEIOU";"-",x,"ay";("-"/:|_[;x]0,*&t),$[*t:x in v;"way";"ay"]]}'" "\:0:0
| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

Clojure - 113 chars

(clojure.string/replace(read-line)#"([^aeiouAEIOU ]*)(\w*)"(fn[[a c r]](if(=""a)""(str r"-"(if(=""c)\w c)"ay"))))
| improve this answer | |
\$\endgroup\$
0
\$\begingroup\$

Ruby 1.9, 68

puts ARGV.map{|w|w[/^([^aeiou]+)(.*)/i]?$2+"-"+$1+"ay":w+"-way"}*" "
| improve this answer | |
\$\endgroup\$
  • \$\begingroup\$ I counted 68 characters ... \$\endgroup\$ – codeporn Nov 20 '12 at 8:47
0
\$\begingroup\$

C, 134 bytes

char w[99],*p;c;main(l){for(;c^10;c=getchar())scanf("%s",w),p=strpbrk(w,"aeiouAEIOU"),l=p-w,printf("%s-%.*say ",p?p:"",l+!l,l?w:"w");}
| improve this answer | |
\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.