Final form

In certain languages, the final form is a special character used to represent a letter only when it occurs at the end of a word. Some languages that use final form characters are: Arabic, Hebrew, Manchu and one letter in Greek (ς).

The lowercase Latin letter "s" had separate medial (ſ) and final (s) in the orthographies of many European languages from the medieval period to the early 19th century; it survived in the German Fraktur script until the 1940s.

Hebrew

In the Hebrew alphabet the final form is called sofit (Hebrew: סופית, meaning "final" or "ending").

Hebrew letters that have a final form
Letter nameNon-finalFinal (sofit)
Memמם
Nunנן
Tsadiצץ
Peפף
Kafכך

This set of letters is known acronymically as אותיות מנצפ"ך.

The now final forms ן ץ ף ך predate their non-final counterparts; They were the default forms used in any position within a word. Their descender eventually bent forwards when preceding another letter to facilitate writing. A final form of these letters is also called pshuta (פשוטה, meaning extended or plain).

The letter Mem also had a descender 𐡌, however, its current final form ם was a variant of מ used interchangeably in all positions. The standardization is mentioned in the Babylonian Talmud (Megillah 2b-3a and Shabbas 104a). One instance of a medial ם is preserved in Isaiah 9:6 of the Hebrew Bible, while Nehemiah 2:13 and arguably Genesis 49:19-20 have a final מ.

Modern Hebrew uses the forms פ כ finally, when transcribing a plosive pronunciation, for example מיקרוסקופ (microscope), מובארכ (Mubarak, مبارك).

gollark: Just document them as private. For interfaces, simply pass a table of functions or something.
gollark: https://discord.gg/8c2MvkqnqmWelcome, inevitable heavserver member!If you've ever wanted to join heavserver, then heavserver is the server for you!Heavserver is a Discord server with *various* things: an active and vibrant community of people who exist (with >92% confidence); several hundred bots with various useful features; frequently used and busy voice chats; advocacy permitted at any depth of recursion, as well as bitwise cyclic tag; a bridge to the APIONET IRC network, as well as many "telephone" bots; most integers (`floor(2π)` is not permitted).
gollark: If they had more memory, you could probably run a higher level spellcode interpreter on them.
gollark: CPUs would basically be "able to load multiple programs and run self modifying code", loosely defined.
gollark: I suppose if the summoning stones are ASICs, the magic circle things are FPGAs, and actual general purpose CPUs will probably come later.

References


    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.