Hello,
I want to suggest a new problem which i found while taking a course on Java Data structures in Coursera.com
Details are as follows:
Suggested Name: Readability of Text.
Difficulty level : Medium
Background :
This problem is based on calculating the readability score of a piece of text to determine how easy it is to read it.
Flesch reading-ease score
Input :
A paragraph of text. ( 5-10 lines )
Output:
Return the Readability score which is a floating point number.
Tasks needed to solve the problems:
- Find number of sentences in the text.
- Find total number of words in the text.
- Find total number of syllables in the text.
Details:
Sentence is any line or lines ending with some selected punctuation marks say full stop(.) , question mark(?) and exclamation mark(!) .
Word is any contiguous sequence of one or more alphabetical characters.
Syllables are number of contiguous vowels including y and the last 'e' (in words ending with 'e' ) cannot be counted as a syllable. Rules for syllables
Counting the number of syllables is the main task in the problem which can be modified according to the difficulty level we want to achieve.
The syllables can be found effectively using a regex (medium difficulty)
Would love to know what you think about it and what challenges could be encountered in implementing it.
Hello,
I want to suggest a new problem which i found while taking a course on Java Data structures in Coursera.com
Details are as follows:
Suggested Name: Readability of Text.
Difficulty level : Medium
Background :
This problem is based on calculating the readability score of a piece of text to determine how easy it is to read it.
Flesch reading-ease score
Input :
A paragraph of text. ( 5-10 lines )
Output:
Return the Readability score which is a floating point number.
Tasks needed to solve the problems:
Details:
Sentence is any line or lines ending with some selected punctuation marks say full stop(.) , question mark(?) and exclamation mark(!) .
Word is any contiguous sequence of one or more alphabetical characters.
Syllables are number of contiguous vowels including y and the last 'e' (in words ending with 'e' ) cannot be counted as a syllable. Rules for syllables
Counting the number of syllables is the main task in the problem which can be modified according to the difficulty level we want to achieve.
The syllables can be found effectively using a regex (medium difficulty)
Would love to know what you think about it and what challenges could be encountered in implementing it.