CODEWITHSUNDEEP
speech
Yasser1984
Yasser1984

Reputation: 2451

Is there a way to rank the difficulty of pronunciation of a word?

I'm trying to build a collection English words that are difficult to pronounce.

I was wondering if there is an algorithm of some kind or a theory, that can be used to show how difficult a word is to pronounce.

Does this appear to you as something that can be computed?

As this seems to be a very subjective thing, let me make it more objective, let's say hardest words to pronounce by text to speech technologies.

Upvotes: 8

Views: 1341

Answers (4)

Shadrack Kimutai
Shadrack Kimutai

Reputation: 143

Suggestion

Fortunately Pronunciation as a process is dependent on a two factors these include

  1. the phones making up the words and the location of vowels and semi vowels i.e

/a/,/ae/,/e/,/i/,/o/,/u/,/w/,/j/...

  1. length of the word.

the first relates to the mechanics of phone sound production as the velum, cheeks tongue have to be altered to produce various sounds related to individual phones i.e nasal etc. this makes some words more difficult to pronounce as the movement required may be a lot. Refer to books about phonetics to find positions of pronouncing each phone.

Algorithm

a weighted spanning tree with weight being the difficulty of pronouncing two consecutive phones i.e l and r or /sh/ and /s/

good luck.

Upvotes: 0

rflood89
rflood89

Reputation: 715

Great problem! Off the top of my head you could create a system which contains all the letters from the phonetic alphabet and with connected weights betweens every combination based on difficulty (highly specific so may need multiple people testing and take averages etc) then have a list of all words from the English dictionary stored on disk and call a script which cycles through each entry and performs web scraping on wikipedia for the phonetic spelling and ranks their difficulty. This could take into consideration the length of the word as well as the difficulty between joining phonetics then order the list based on the difficulty.

Thats what I would try and do :P

Upvotes: 1

hatchet - done with SOverflow
hatchet - done with SOverflow

Reputation: 16257

One approach would be to build a list with two versions of each word. One the correct spelling, and the other being the word spelled using the simplest of phonetic spelling. Apply a distance function on the two words (like Levenshtein distance http://en.wikipedia.org/wiki/Levenshtein_distance). The greater the distance between the two words, the harder the word would be to pronounce.

Upvotes: 4

Robbie Dee
Robbie Dee

Reputation: 1977

To a certain extent...

Speech programs for example use a system of phonetics to try and pronounce words.

For example, "grasp" would be split into:

Gr-A-Sp

However, for foreign words (or words that don't follow this pattern), exception lists have to be kept e.g. Yacht

Upvotes: 0

Related Questions