The Improved Caesar Pig Latin Cipher

Question

The problem with the Caesar cipher is the resulting words are often unpronounceable. The problem with Pig Latin is that it is easy to decode. Why not combine them?

Input

A word consisting of the 26 english letters.

Output

First, change every consonant in the word to the next consonant in the alphabet. So, b goes to c, d goes to f, and z goes to b. Then, change every vowel to the next vowel in the alphabet (u goes to a). Last, only if the first letter of the word is a consonant, move that letter to the end of the word and add "ay" to the end of the word.

Examples:

cat -> evday  
dog -> uhfay   
eel -> iim

This is code-golf, so the shortest code wins.
Case does not matter.
Vowels that will be used are A, E, I, O, and U

jot ot e wisz opvisitvoph dupdiqv cav o fu puv vjopl ov jimqt xovj vji ecomovz vu qsupuapdi vji xusftvay — Shadow, Commented Sep 17, 2018 at 4:36
Suggested test case: the → jivay? (That is, if the word starts with multiple consonants, do we only move one of them?) — DLosc, Commented Sep 17, 2018 at 17:03

G B · Accepted Answer · 2018-09-17 11:19:33Z

7

Ruby, 96 69 bytes

->s{/^[^aeiou]/=~(r=s.tr'zb-yadehinotu','b-zefijopuva')?$'+$&+'ay':r}

Try it online!

Fun fact of the day: tr() matches strings right-to-left. I always assumed it was left-to-right.

edited Sep 17, 2018 at 11:19

answered Sep 17, 2018 at 11:07

G B

22.8k1 gold badge20 silver badges53 bronze badges

Add a comment |

J.Doe · Accepted Answer · 2018-09-17 13:42:55Z

6

R, 86 85 bytes

Simple way. chartr has the charming and useful property that it can specify letter ranges, which save a few bytes.

-1 bytes by stealing @GB's Ruby solution's translation strings - upvote it!

function(s)sub("^([^aeiou])(.*)","\\2\\1ay",chartr('zb-yadehinotu','b-zefijopuva',s))

Try it online!

edited Sep 17, 2018 at 13:42

answered Sep 16, 2018 at 20:48

J.Doe

2,62911 silver badges15 bronze badges

Add a comment |

Olivier Grégoire · Accepted Answer · 2019-11-13 08:47:54Z

5

Java (JDK), 167 bytes

s->{String r="",a="aeiouabcdfghjklmnpqrstvwxyzb",c=s.split("")[0];s=a.indexOf(c)>5?s.substring(1)+c+"ux":s;for(var d:s.split(""))r+=a.charAt(a.indexOf(d)+1);return r;}

Try it online!

Credits

-7 bytes thanks to Kevin Cruijssen, using better types.
-1 byte thanks to ceilingcat.

edited Nov 13, 2019 at 8:47

answered Sep 17, 2018 at 9:02

Olivier Grégoire

14.4k3 gold badges32 silver badges56 bronze badges

1

\$\begingroup\$ 168 bytes \$\endgroup\$
– Kevin Cruijssen
Commented Sep 19, 2018 at 13:13

Add a comment |

Emigna · Accepted Answer · 2018-09-16 20:23:23Z

4

05AB1E, 21 bytes

žMDÀ‡žNDÀ‡¬žNsåiÀ…ÿay

Try it online!

Explanation

žMDÀ‡                   # replace each vowel with the next vowel in the alphabet
     žNDÀ‡              # replace each consonant with the next consonant in the alphabet
          ¬žNsåi        # if the first letter is a consonant
                À…ÿay   # rotate the word left and add "ay"

answered Sep 16, 2018 at 20:23

Emigna

53k5 gold badges43 silver badges162 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

4

T-SQL, 169 bytes

SELECT IIF(CHARINDEX(LEFT(a,1),'aeiou')=0,SUBSTRING(a,2,99)+LEFT(a,1)+'ay',a)FROM
(SELECT TRANSLATE(v,'aeioubcdfghjklmnpqrstvwxyz','eiouacdfghjklmnpqrstvwxyzb')a FROM t)s

Input is via a pre-existing table, per our IO standards.

Performs the characters substitution first, using the (new to SQL 2017) TRANSLATE function, then checks the first character.

Annoying long mostly due to SQL keyword length.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Sep 17, 2018 at 16:51

BradC

6,8121 gold badge14 silver badges34 bronze badges

Add a comment |

Arnauld · Accepted Answer · 2018-09-18 11:53:58Z

Node.js 10.9.0, 121 116 bytes

Expects the input string in lower case.

s=>(v=n=>2130466>>n&1)((a=Buffer(s).map(n=>(g=i=>v(n=n%61?n+1:97)^i?g(i):n)(v(n))))[0],a+='')?a:a.slice(1)+a[0]+'ay'

Try it online!

Identifying vowels

To identify vowels, the helper function \$v\$ uses the following bitmask:

2130466 = 000001000001000001000100010
               ^     ^     ^   ^   ^
          zyxwvutsrqponmlkjihgfedcba-

And does:

(2130466 >> n) & 1

We don't need to mask out the relevant bits of \$n\$, because it is done implicitly. Below is the relevant quote from the ECMAScript specification:

Let shiftCount be the result of masking out all but the least significant 5 bits of rnum, that is, compute rnum & 0x1F.

Commented

s =>                      // s = input string
  ( v = n =>              // v = helper function taking n = ASCII code in [97..122]
    2130466 >> n & 1      //     and returning 1 if the corresponding character is a vowel
  )                       //     or 0 otherwise (see the previous paragraph)
  (                       // this statement will ultimately invoke v on a[0]
    ( a = Buffer(s)       //   convert s to a Buffer, holding ASCII codes
      .map(n =>           //   for each ASCII code n in there:
        ( g = i =>        //     g = recursive function taking i = vowel flag
          v(              //       update n and invoke v on the new value:
            n = n % 61 ?  //         if n is less than 122 (meaning less than 'z'):
              n + 1       //           increment n
            :             //         else:
              97          //           wrap around by setting n to 97 (meaning 'a')
          ) ^ i ?         //       if v(n) is not equal to i:
            g(i)          //         do recursive calls until it is
          :               //       else:
            n             //         stop recursion and return the new n
        )(v(n))           //     initial call to g with i = v(n)
      )                   //   end of map()
    )[0],                 //   invoke v on a[0]
    a += ''               //   coerce the updated Buffer back to a string
  ) ?                     // if a[0] is a vowel:
    a                     //   return the string as-is
  :                       // else:
    a.slice(1) + a[0]     //   move the leading consonant to the end
    + 'ay'                //   and append the 'ay' suffix

Chas Brown · Accepted Answer · 2019-11-14 04:14:01Z

4

Python 2, 153 121 110 99 91 bytes

lambda s:[s[1:]+s[0]+"ux",s][s[0]in'aeiou'].translate(8*".ecdfighjoklmnpuqrstvawxyzb.....")

Try it online!

8 bytes shaved off due to a suggestion by Matthew Jensen

edited Nov 14, 2019 at 4:14

answered Sep 16, 2018 at 21:39

Chas Brown

9,7571 gold badge13 silver badges39 bronze badges

\$\begingroup\$ You can save 8 bytes by using string.translate() function: lambda s:[s[1:]+s[0]+"ux",s][s[0]in'aeiou'].translate(8*".ecdfighjoklmnpuqrstvawxyzb.....") \$\endgroup\$
– Matthew Jensen
Commented Nov 13, 2019 at 23:50
\$\begingroup\$ @MatthewJensen Clever! Usually I avoid translate in Python 2... \$\endgroup\$
– Chas Brown
Commented Nov 14, 2019 at 4:11
\$\begingroup\$ Coincidentally, it now also works for upper case as well \$\endgroup\$
– Matthew Jensen
Commented Nov 17, 2019 at 19:35

Add a comment |

Multi · Accepted Answer · 2018-09-18 12:50:41Z

Stax, 20 bytes

ù≥±╘├*Lâ■8O±âΓ║Θæ%º•

Run and debug it

Explanation

Vc:tVv:tBcVc#{sL"ay"+}ML             #Full program, unpacked, implicit input
Vc:t                                 #Push consonants and ring translate input
    Vv:t                             #Push vowels and ring translate input
        BCvc#                        #Push first letter and tail of word, find number 
                                     #of occurrences to consonants
             {sL"ay"+}M              #If truthy (word starts with consonant)
                                     #swap stack, listify, add "ay"
                       L             #Listify stack (combines words that start with vowel)

I went through a few iterations and finally got it down to 20. My original solution was 53 bytes.

Ángel · Accepted Answer · 2018-09-17 23:52:33Z

3

Shell script, 70 bytes

tr a-z b-{|tr eiou{bfjpv fjpvbeioua|sed -E 's/^([^aeiou])(.*)/\2\1ay/'

Try it online!

answered Sep 17, 2018 at 23:52

Ángel

6564 silver badges7 bronze badges

Add a comment |

crb233 · Accepted Answer · 2018-09-18 22:17:13Z

3

Haskell, 102 97 bytes

h(c:r)|elem c"aeiou"=c:r|True=r++c:"ay"
f s=h["ecdfighjoklmnpuqrstvawxyzb"!!(fromEnum y-97)|y<-s]

Try it online!

edited Sep 18, 2018 at 22:17

answered Sep 18, 2018 at 22:08

crb233

6413 silver badges10 bronze badges

Add a comment |

Neil · Accepted Answer · 2018-09-17 00:49:58Z

Retina 0.8.2, 50 bytes

T`uo`aei\oub-df-hj-np-tv-zb
^([^aeiou])(.*)
$2$1ay

Try it online! Link includes test cases. Similar approach to the R answer. Explanation:

T`uo`aei\oub-df-hj-np-tv-zb

o refers to the other set, i.e. aei\oub-df-hj-np-tv-zb, which expands to aeioubcdfghjlkmnpqrstvwxyzb, so uo expands to uaeioubcdfghjlkmnpqrstvwxyzb. This results in the following transliteration:

uaeioubcdfghjlkmnpqrstvwxyzb
aeioubcdfghjlkmnpqrstvwxyzb

The second u and b are ignored as they can never be matched, so this provides the desired cipher. (Note that in Retina 1 you can of course use v instead of aei\ou for a 5 byte saving.)

^([^aeiou])(.*)
$2$1ay

If the first letter is not a vowel, rotate it to the end and suffix ay.

Mr. Xcoder · Accepted Answer · 2018-09-17 07:23:49Z

2

Jelly, 24 bytes

,ṙ¥1y
ØẹçØḄçṙḢe©ØḄƊ®⁾ayx

Try it online!

Saved 1 byte thanks to Jonathan Allan (use the two-char syntax rather than quotes).

edited Sep 17, 2018 at 7:23

answered Sep 16, 2018 at 21:36

Mr. Xcoder

42.5k9 gold badges81 silver badges214 bronze badges

\$\begingroup\$ Unfortunately far longer sane, non-sneaky version (1-byte shorter sneaky equivalent). I won't be able to update this within the next few hours, but do point out if you find improvements. \$\endgroup\$
– Mr. Xcoder
Commented Sep 16, 2018 at 22:01
\$\begingroup\$ Use ⁾ay for a byte. The © could go after the e since that is what you are storing. I have ØẹØḄ,żṙ€¥1ẎyṙḢe©ØḄƊ®⁾ayẋ. \$\endgroup\$
– Jonathan Allan
Commented Sep 17, 2018 at 1:09

Add a comment |

Sok · Accepted Answer · 2018-09-18 07:25:39Z

2

><>, 94 92 bytes

i:0(?v"a"%
2%?!v\~r:5g
a2r}<vr+ad*
ol?!;>4g
ecdfighjoklmnpuqrstvawxyzb
1   1   1     1     1

Try it online!

Edit: Saved 2 bytes by taking input mod 97 rather than 32, so the dictionary could start at the beginning of the line. Previous version:

i:0(?v84*%
2%?!v\~r:5g
37r}<vr*46*
ol?!;>4g
 ecdfighjoklmnpuqrstvawxyzb
 1   1   1     1     1

edited Sep 18, 2018 at 7:25

answered Sep 17, 2018 at 9:54

Sok

6,1641 gold badge17 silver badges30 bronze badges

Add a comment |

Galen Ivanov · Accepted Answer · 2018-09-17 08:37:17Z

1

Red, 149 bytes

func[s][c:"aeioua.bcdfghjklmnpqrstvwxyzb"t: copy""foreach p s[append t c/(1
+ index? find c p)]if 7 < index? find c t/1[move t tail t append t"ay"]t]

Try it online!

As (almost) always, the longest entry

answered Sep 17, 2018 at 8:37

Galen Ivanov

21.2k3 gold badges24 silver badges61 bronze badges

Add a comment |

user80007user80007 · Accepted Answer · 2018-09-18 18:52:56Z

1

F# (Mono), 197 bytes

let f(s:string)=
 let a="aeiouabcdfghjklmnpqrstvwxyzb"
 new string(s|>Seq.map(fun c->a.[a.IndexOf(c)+1])|>Seq.toArray)|>(fun x->if a.IndexOf(x.[0])>5 then x.Substring(1)+(string x.[0])+"ay"else x)

Try it online!

answered Sep 18, 2018 at 18:52

user80007

Add a comment |

hobbs · Accepted Answer · 2018-09-19 02:57:00Z

1

Perl 5, 56 bytes

y/a-z/ecdfighjok-npuq-tvaw-zb/;s/^([^aeiou])(.*)/$2$1ay/

Try it online!

edited Sep 19, 2018 at 2:57

answered Sep 18, 2018 at 0:45

hobbs

2,5311 gold badge15 silver badges15 bronze badges

1

\$\begingroup\$ Do you need the -s between c and d or g and h? \$\endgroup\$
– Neil
Commented Sep 18, 2018 at 9:37
\$\begingroup\$ @Neil no I don't. I wrote a program to compress the ranges... and got the logic wrong :) Thanks. \$\endgroup\$
– hobbs
Commented Sep 19, 2018 at 2:56
\$\begingroup\$ Normally in such cases you write <s>58</s> 56 bytes in the header and many people add a "Edit: Saved 2 bytes thanks to @Neil." or some such when they are helped in a comment. \$\endgroup\$
– Neil
Commented Sep 19, 2018 at 8:14

Add a comment |

Yair Rand · Accepted Answer · 2018-09-26 11:11:46Z

1

JavaScript (SpiderMonkey), 107 bytes

x=>x.replace(/./g,y=>(z='aeiouabcdfghjklmnpqrstvwxyzb')[z.search(y)+1]).replace(/^([^aeiou])(.+)/,'$2$1ay')

Try it online!

Expects input in lowercase.

Replaces each character of the string with a the one after it in the string 'aeiouabcdfghjklmnpqrstvwxyzb', and then piglatinifies anything with an initial consonant.

answered Sep 26, 2018 at 11:11

Yair Rand

4212 silver badges5 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

PHP, 112 bytes

<?=strtr(($s=strstr(aeiou,($s=$argn)[0])?$s:substr($s,1).$s[0].ux),join(range(a,z)),ecdfighjoklmnpuqrstvawxyzb);

or

<?=strtr(($s=strstr(aeiou,($argn)[0])?$argn:substr($s,1).$s[0].ux),join(range(a,z)),ecdfighjoklmnpuqrstvawxyzb);

assume lower case input. Run as pipe with -nR or try them online.

You could as well use
strtr($s,uzbcadfgehjklminpqrsotvwxy,range(a,z)) instead of
strtr($s,range(a,z),ecdfighjoklmnpuqrstvawxyzb).

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Sep 26, 2018 at 12:04

Titus

14.8k1 gold badge24 silver badges41 bronze badges

Add a comment |

akhmorn · Accepted Answer · 2019-11-13 15:01:11Z

Dyalog APL (SBCS), 57 bytes

{a←⎕A{(⍺~⍵)⍵}'AEIOU'⋄('AY',⍨1⌽⊢)⍣(∊/⊃¨⍵a)⊢(⊂⍵⍳⍨∊a)⌷∊1⌽¨a}

Try it online!

Takes input in uppercase only! (Because ⎕A is uppercase alphabet)

⎕A{(⍺~⍵)⍵}'AEIOU': Vector of consonants and vowels
(⊂⍵⍳⍨∊a)⌷∊1⌽¨a: Uses indices of each letter of the word in the normal alphabet (⊂⍵⍳⍨∊a) to index (⌷) into the cipher ∊1⌽¨a.
('AY',⍨1⌽⊢)⍣(∊/⊃¨⍵a): Moves first letter to the end and appends 'AY', if the first letter is a consonant.

Thanks for the cool challenge!

bigyihsuan · Accepted Answer · 2022-09-30 14:33:11Z

1

Lexurgy, 202 bytes

class C {b,c,d,f,g,h,j,k,l,m,n,p,q,r,s,t,v,w,x,y,z} 
class V {a,e,i,o,u}
c:
{@C,@V}=>{{c,d,f,g,h,j,k,l,m,n,p,q,r,s,t,v,w,x,y,z,b},{e,i,o,u,a}}
p:
([]+)$1 *=>$1/$ @V _
(@C+)$1 ([]*)$2=>$2 $1 ay/$ _

answered Sep 30, 2022 at 14:33

bigyihsuan

10.8k1 gold badge23 silver badges66 bronze badges

Add a comment |

Stack Exchange Network

The Improved Caesar Pig Latin Cipher

20 Answers 20

Ruby, 96 69 bytes

R, 86 85 bytes

Java (JDK), 167 bytes

Credits

05AB1E, 21 bytes

T-SQL, 169 bytes

Node.js 10.9.0, 121 116 bytes

Identifying vowels

Commented

Python 2, 153 121 110 99 91 bytes

Stax, 20 bytes

Shell script, 70 bytes

Haskell, 102 97 bytes

Retina 0.8.2, 50 bytes

Jelly, 24 bytes

><>, 94 92 bytes

Red, 149 bytes

F# (Mono), 197 bytes

Perl 5, 56 bytes

JavaScript (SpiderMonkey), 107 bytes

PHP, 112 bytes

Dyalog APL (SBCS), 57 bytes

Lexurgy, 202 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
string
cipher
or ask your own question.

Hot Network Questions

The Improved Caesar Pig Latin Cipher

20 Answers 20

Ruby, 96 69 bytes

R, 86 85 bytes

Java (JDK), 167 bytes

Credits

05AB1E, 21 bytes

T-SQL, 169 bytes

Node.js 10.9.0, 121 116 bytes

Identifying vowels

Commented

Python 2, 153 121 110 99 91 bytes

Stax, 20 bytes

Shell script, 70 bytes

Haskell, 102 97 bytes

Retina 0.8.2, 50 bytes

Jelly, 24 bytes

><>, 94 92 bytes

Red, 149 bytes

F# (Mono), 197 bytes

Perl 5, 56 bytes

JavaScript (SpiderMonkey), 107 bytes

PHP, 112 bytes

Dyalog APL (SBCS), 57 bytes

Lexurgy, 202 bytes

Your Answer

Sign up or log in

Post as a guest

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

Related

Hot Network Questions

Not the answer you're looking for? Browse other questions tagged
code-golf
string
cipher
or ask your own question.