任务

您的任务是将文本转换为中世纪的拼字法。

细节

1. j被转换为i与J向I。
2. u和U单词的开头分别转换为v和V。
3. v和V除单词开头以外的任何地方分别转换为u和U。
4. sſ除非在单词的末尾或另一个之前，否则将转换为（U + 017F）s。

眼镜

• 单词定义为中的字母序列abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ。
• 所有单词将至少包含两个字母。
• 输入将仅包含可打印的ASCII字符（U + 0020-U + 007E）。
• 连续出现的次数不会超过两次s。也就是说，sss将不会是输入的子字符串。

测试用例

个别词：

Input       Output
------------------------
Joy         Ioy
joy         ioy
Universe    Vniuerſe
universe    vniuerſe
Success     Succeſs
successfull ſucceſsfull
Supervise   Superuiſe
supervise   ſuperuiſe
Super-vise  Super-viſe
I've        I've
majors      maiors
UNIVERSE    VNIUERSE
0universe   0vniuerſe
0verify     0verify
I0ve        I0ve
_UU_          _VU_
_VV_          _VU_
ss_         ſs_

整个段落：

Input:  Christian Reader, I have for thy use collected this small Concordance, with no small labour. For being to comprise much in little roome, I was to make choyse of the most principall and usefull places, and to rank them under such words as I thought most essentiall and materiall in the sentence, because the scant roome allotted unto me, would not permit that I should expresse them under every word in the verse, as it is the manner in large Concordances.

Output: Chriſtian Reader, I haue for thy vſe collected this ſmall Concordance, with no ſmall labour. For being to compriſe much in little roome, I was to make choyſe of the moſt principall and vſefull places, and to rank them vnder ſuch words as I thought moſt eſsentiall and materiall in the ſentence, becauſe the ſcant roome allotted vnto me, would not permit that I ſhould expreſse them vnder euery word in the verſe, as it is the manner in large Concordances.

最后一个测试用例的输出的SHA-256哈希为：

5641899e7d55e6d1fc6e9aa4804f2710e883146bac0e757308afc58521621644

免责声明

Medievall拼字术不是那样的竞争者。如果您要用不同的拼字法对旧书进行折衷，请不要打扰。

SED，144140111字节

由于NoOneIsHere节省了29个字节

-r -e'y/j/i/g;y/J/I/g;s/ u/ v/g;s/ U/ V/g;s/^u/v/g;s/^U/V/g;s/([^s])s(\w)/\1ſ\2/g;s/(\w)v/\1u/g;s/(\w)V/\1U/g'

Python 3中（128 126个字节）

import re;lambda k:re.sub("(?<!s)s(?=[a-zA-Z])",'ſ',re.sub("(?i)j|(?<![a-z])u|(?<=[a-z])v",lambda c:chr(ord(c.group())^3),k))

chr(ord(c.group())^3)对单个字符的字符串进行异或运算会感到有点过分，但也许真正的Pythonista可以建议打高尔夫球。但是，^3足以互换i <-> j和u <-> v。

注意：这里唯一需要Python 3的是Unicode字符：Python 2抱怨Non-ASCII character '\xc5' <snip> but no encoding declared。

视网膜，55 54 50字节

T`jJvV`iIuU
Ti01`uUp`vVp`[a-z]+
s(s*[a-zA-Z])
ſ$1

在线尝试！（第一行启用了一个单独的换行测试套件。）

蟒3.5，124个 116 111 118 125 144 142字节：

import re;lambda k:re.sub("J|j|(?<![a-zA-Z])[uU]|(?<=[a-zA-Z])[Vv]|(?<!s)s(?=[a-zA-Z])",lambda g:dict(zip('jJuUvVs','iIvVuUſ'))[g.group()],k)

好吧，这似乎是正则表达式的完美选择！

JavaScript（ES6），154

使用parseInt识别字母字符。注意：随便，但幸运的parseInt('undefined',36)|0是<0

s=>[...s].map((c,i)=>((n=v(c))-19?n==31&p>9?'uU':n!=30|p>9?c=='s'&s[i-1]!=c&v(s[i+1])>9?'?':c+c:'vV':'iI')[p=n,c<'a'|0],p=0,v=c=>parseInt(c,36)|0).join``

少打高尔夫球

s=>
  [...s].map(
  (c,i)=>
  ((n=v(c))-19
  ?n==31&p>9
    ?'uU'
    :n!=30|p>9
      ?c=='s'&s[i-1]!=c&v(s[i+1])>9
        ?'ſ'
        :c+c
      :'vV'
  :'iI')[p=n,c<'a'|0],
  p=0,
  v=c=>parseInt(c,36)|0
).join``

测试

F=
s=>[...s].map((c,i)=>((n=v(c))-19?n==31&p>9?'uU':n!=30|p>9?c=='s'&s[i-1]!=c&v(s[i+1])>9?'ſ':c+c:'vV':'iI')[p=n,c<'a'|0],p=0,v=c=>parseInt(c,36)|0).join``

out=(a,b,c)=>O.textContent+=a+'\n'+b+'\n'+c+'\n\n'

ti='Christian Reader, I have for thy use collected this small Concordance, with no small labour. For being to comprise much in little roome, I was to make choyse of the most principall and usefull places, and to rank them under such words as I thought most essentiall and materiall in the sentence, because the scant roome allotted unto me, would not permit that I should expresse them under every word in the verse, as it is the manner in large Concordances.'
to='Chriſtian Reader, I haue for thy vſe collected this ſmall Concordance, with no ſmall labour. For being to compriſe much in little roome, I was to make choyſe of the moſt principall and vſefull places, and to rank them vnder ſuch words as I thought moſt eſsentiall and materiall in the ſentence, becauſe the ſcant roome allotted vnto me, would not permit that I ſhould expreſse them vnder euery word in the verſe, as it is the manner in large Concordances.'
r=F(ti)
out(to==r?'OK':'KO',ti,r)

test=`Joy         Ioy
joy         ioy
Universe    Vniuerſe
universe    vniuerſe
Success     Succeſs
successfull ſucceſsfull
Supervise   Superuiſe
supervise   ſuperuiſe
Super-vise  Super-viſe
I've        I've
majors      maiors
UNIVERSE    VNIUERSE
0universe   0vniuerſe
0verify     0verify
I0ve        I0ve
_UU_          _VU_
_VV_          _VU_
ss_         ſs_`
.split('\n').map(t=>{
  var [i,o]=t.split(/\s+/),r=F(i)
  out(o==r?'OK':'KO',i,r)
})

#O {width:90%; overflow:auto; white-space: pre-wrap}

<pre id=O></pre>

JavaScript（ES6），111个字节

s=>s.replace(/[a-z]+/gi,w=>w.replace(/j|J|^u|^U|\Bv|\BV|ss|s(?!$)/g,c=>"iIvVuUſ"["jJuUvVs".search(c)]||"ſs"))

说明：因为JavaScript regexp没有后顾之忧，所以我将字符串分解为单词，然后允许我使用^和\B作为负数和正数字母lookbehinds。ss通过单独匹配来处理，替换表达式稍显笨拙，与只替换两个字符串的第一个字符c或向s两个字符串添加一个额外的字符以及使用匹配的子字符串相比，占用更少的字节。

CJam（89 88字节）

{32|_'`>\'{<*}:A;SqS++3ew{_1="jJuUvVs"#[-4_{_0=A!3*}_{_0=A3*}_{_)A\0='s=>268*}W]=~f^1=}%

在线演示

我从来不明白为什么CJam没有正则表达式，但是因为它不存在，所以这里没有使用它们的解决方案。

Ruby，85 + 1 = 86字节

运行ruby -p（p标志为+1字节）。在stdin上接受输入。

gsub(/j|(?<=^|[^a-z])u|(?<=[a-z])v|(?<=^|[^s])s(?=[a-z])/i){$&.tr"jJsUuVv","iIfVvUu"}

在ideone上运行测试（包装在lambda中，因为您不能给ideone标记）：http ://ideone.com/AaZ8ya