sibilant | detect speaking events from webRTC audio | Runtime Evironment library
kandi X-RAY | sibilant Summary
kandi X-RAY | sibilant Summary
detect speaking events from web audio.
Support
Quality
Security
License
Reuse
Top functions reviewed by kandi - BETA
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of sibilant
sibilant Key Features
sibilant Examples and Code Snippets
Community Discussions
Trending Discussions on sibilant
QUESTION
I have a question which I've been researching extensively these past few days, as you can tell by the title has to do with a text to speech type algorithm for parsing strings into phonemes.
I don't plan on using this for text to speech, mostly just text analysis for an upcoming project I'll be working on. I found some helpful information here:
http://www.dtic.mil/dtic/tr/fulltext/u2/a021929.pdf
Using this information, I was hoping to create a similar tool. Here is the way the software mentioned above works:
Essentially, starting with the first character of a string, we check the characters to the left and the right of it.
(for characters in the beginning of a word, the left character would be a blank space)
We set up rules based on the 44 English phonemes, and the graphemes that fit under each phoneme.
Here is where I got the data to make up these rules: http://www.boardman.k12.oh.us/userfiles/363/Phonological%20Awareness/44Phonemes.pdf - which I believe are different than some of the rules in the article before this one.
Here is an example of the rule object I've created thus far:
...ANSWER
Answered 2018-Jul-06 at 23:29I think you're mis-reading Table 2 from the article:
'#' One or more vowels
'*' (star) One or more consonants
'*' (circle) One of B, D, V, G, J, L, M, N, R, W, and Z: a voiced consonant
'$' One consonant followed by an E or I
'%' One of (ER, E, ES, ED, ING, ELY): a suffix
'&' One of (S, C, G, Z, X, J, CH, SH): a sibilant
'@' One of (T, S, R, D, L, Z, N, J, TH, CH, SH): a consonant influencing the sound of a following long u (cf. rule and mule)
'^' One consonant
'+' One of (E, I, Y): a front vowel
':' Zero or more consonants
The caption for that table says:
Special Symbols Appearing in the English-to-IPA Translation Rules
In other words, those aren't rules, but rather descriptions of the notation.
The real rules start on page 51 of the article. As I understand the algorithm, it will start by parsing the 't', and go to the TRULE.ENG section (page 58). The only rule that applies there is [T]=/T/
. Then it parses the 'a', and looks in ARULE.ENG (page 51). Scanning the rules there, the first one I see that applies is [AU]=/AO/
, which gives you the "au" as in "taught". From there it goes to the GRULE.ENG list and produces / /
for "gh", and then produces /T/
again for the final "t".
As for "laugh", from the rules I'd say that it's going to pronounce the "au" as in "taught". And because the rule is #[GH]=/ /
, there will be no other sound. "laugh" will probably sound like "law".
Community Discussions, Code Snippets contain sources that include Stack Exchange Network
Vulnerabilities
No vulnerabilities reported
Install sibilant
Support
Reuse Trending Solutions
Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items
Find more librariesStay Updated
Subscribe to our newsletter for trending solutions and developer bootcamps
Share this Page