sibilant | Just another compile-to-js LISP-like language

by jbr JavaScript Version: Current License: MIT

X-Ray Key Features Code Snippets Community Discussions(1)Vulnerabilities Install Support

kandi X-RAY | sibilant Summary

sibilant is a JavaScript library. sibilant has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can install using 'npm i sibilant' or download it from GitHub, npm.

Just another compile-to-js LISP-like language

Support

Quality

Security

License

Reuse

Support

sibilant has a low active ecosystem.

It has 374 star(s) with 52 fork(s). There are 19 watchers for this library.

It had no major release in the last 6 months.

There are 24 open issues and 63 have been closed. On average issues are closed in 647 days. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of sibilant is current.

Quality

sibilant has 0 bugs and 0 code smells.

Security

sibilant has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

sibilant code analysis shows 0 unresolved vulnerabilities.

There are 0 security hotspots that need review.

License

sibilant is licensed under the MIT License. This license is Permissive.

Permissive licenses have the least restrictions, and you can use them in most projects.

Reuse

sibilant releases are not available. You will need to build from source code and install.

Deployable package is available in npm.

Installation instructions, examples and code snippets are available.

Top functions reviewed by kandi - BETA

kandi has reviewed sibilant and discovered the below as its top functions. This is intended to give you an instant insight into sibilant implemented functionality, and help decide if they suit your requirements.

Default prefender function .
Called when a request completes
Sizzle through a selector .
Create an animation animation
Creates a new matcher matcher .
Creates a new matcher handler .
workaround for AJAX requests
Creates a new matcher instance .
Add a combinator function
Based on the jquery response

Get all kandi verified functions for this library.

sibilant Key Features

No Key Features are available at this moment for sibilant.

sibilant Examples and Code Snippets

No Code Snippets are available at this moment for sibilant.

Community Discussions

Trending Discussions on sibilant

Parsing text to phonemes - Javascript

QUESTION

Parsing text to phonemes - Javascript

Asked 2018-Jul-06 at 23:29

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:29

I 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".

Source https://stackoverflow.com/questions/51202619

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install sibilant

First, install node.js [ github ] and npm [ github ]. Then, it's as simple as:.

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: