# phonetic-languages-simplified-generalized-examples-array: Helps to create texts with the given phonetic properties (e. g. poetic).

Is rewritten from the modules of the phonetic-languages-simplified-examples-array package. Can be used not only for Ukrainian, but also for other languages.

[Skip to Readme]
Versions [RSS] [faq] 0.1.0.0, 0.1.0.1, 0.1.1.0, 0.2.0.0, 0.2.0.1, 0.2.1.0, 0.3.0.0 (info) ChangeLog.md base (>=4.8 && <4.15), heaps (>=0.3.6.1 && <1), mmsyn2-array (>=0.1.3 && <1), parallel (>=3.2.0.6 && <4), phonetic-languages-constraints-array (>=0.1 && <1), phonetic-languages-filters-array (>=0.1 && <1), phonetic-languages-permutations-array (>=0.1 && <1), phonetic-languages-phonetics-basics (>=0.7 && <1), phonetic-languages-plus (>=0.2 && <1), phonetic-languages-simplified-base (>=0.2 && <1), , , subG (>=0.4.2 && <1) [details] MIT Oleksandr Zhabenko Oleksandr Zhabenko olexandr543@yahoo.com Language, Math, Game https://hackage.haskell.org/package/phonetic-languages-simplified-generalized-examples-array by OleksandrZhabenko at 2021-06-04T19:05:54Z 418 total (327 in the last 30 days) (no votes yet) [estimated by Bayesian average] λ λ λ Docs available Last success reported on 2021-06-04

## Downloads

#### Maintainer's Corner

For package maintainers and hackage trustees

Candidates

• No Candidates

## Readme for phonetic-languages-simplified-generalized-examples-array-0.3.0.0

[back to package description]

The version 0.2.0.0 is prepared to the Day of the Saints Cyril and Methodius, the 'Apostles to the Slavs', and to the Day of Slavic writing systems and culture.

The functions in the modules Phonetic.Languages.General.Simple.Parsing, Phonetic.Languages.General.Lines.Parsing, Phonetic.Languages.General.GetInfo.Parsing highly depend on the data types in the phonetic-languages-phonetics-basics package.

They use the parsing with the failing possibilities, so for them, to work properly, you need to specify every piece of data accordingly to the specifications in the imported modules and in the new modules themselves.

Otherwise, the functions definitely will not work correctly.

Are provided mainly for testing purposes, may be not enough performant for production usage.

# Espeak-ng Additional Usage and IPA

You can use additionally the espeak-ng program (see: https://github.com/espeak-ng/espeak-ng) and in the Unix / Linux terminal (bash shell) you can enter as a command something like:

cat - | tr -d [:punct:] | espeak-ng -v{lang} -x -g 1 -s 130 --ipa

where {lang} is the needed language code (see, the output of the espeak-ng --voices and besides the manual page for the espeak-ng).

The IPA symbols information can be taken from the https://www.internationalphoneticassociation.org/content/full-ipa-chart or the https://www.internationalphoneticassociation.org/sites/default/files/phonsymbol.pdf Please, take into account the license information: the IPA chart and all its subparts are copyright 2018/2005 by the International Phonetic Association. As of July 2012, they are made freely available under a Creative Commons Attribution-Sharealike 3.0 Unported License (CC-BY-SA). This license allows any kind of re-use (including commercial reproduction and derivative works), as long as attribution is given and the reproduction or derivative work is under the same license. See http://creativecommons.org/licenses/by-sa/3.0/ for further description.

It is rather easy to create the corresponding GWritingSystemPRPLX information using the IPA, but you can use some other respesentation. The idea for this is that you can use IPA line produced by the espeak-ng as the input 'String'.

# Some Ideas to Be Checked (Hypotheses)

The phonetic-languages-simplified-generalized-examples-array library is based on the idea of the defined phonetic phenomenae durations in time while speaking. Definitely, they have some durations, the question of interest is that there are no stable ones, immutable ones. The durations vary not only from situation to situation, from one speaker to another one, from circumstances etc., but also the durations for some phonemes can vary depending on their neighbouring ones and, therefore, being some (probably, a new one in every case) function of the neighbour phonemes. This fact is not taken into account in this version of the package and library, but it has some meaning.

# A Child Learns to Read, or Somebody New to the Language

When a child just begins to read words in the language (or, there can be just somebody new to the language) he or she starts with phonemes pronunciation for every meaningful written (and, hence, read) symbol. Afterwards, after some practice, he / she starts to read smoothly. Nevertheless, if the text is actually a poetic piece, e. g. some poem, it is OFTEN (may be, usually, or sometimes, or occasionally, etc.) just evident that the text being read in such a manner has some rhythmicity properties, despite the fact that the phonemes are read and pronounced in a manner of irregular and to some extent irrelevant to the normal speech mode lengths (durations). We can distinguish (often) the poetic text from the non-poetic one just by some arrangement of the elements.

The same situation occurs when a person with an accent (probably, strong, or rather uncommon) reads a poetic text. Or in other situations. The library design works just as in these situations. It assumes predefined durations, but having several reasonable (sensible) ones we can evaluate (approximately, of course) the rhythmicity properties and some other ones, just as the algorithms provided here.

This, to the mind of the author, is a ground for using the library and its functionality in such cases.