Problem 920. Eliminate Polysyllabics: Long live short words!

Created by Ned Gulley

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given a string s1, return s2 in which all the words with more than one syllable have been removed.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>To make things simple, we will (for the purposes of this problem) define a polysyllabic word as one in which at least two vowel groups are separated by a least one consonant group. Consider vowels to come from the set [aeiouy]. All other letters are considered consonants. There are many exceptions to the rules I have defined here, but I will keep the test suite consistent with these rules.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>So these words are polysyllabic:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ ANY BUSY POLICEMAN EXPECTS COUNTLESS INTERRUPTIONS]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>These words are monosyllabic:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ STRENGTH IS THE SUM OF ALL WE KNOW TO BE TRUE]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Here are some examples of one-syllable words that I WON'T use because they violate my rules:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ ONE ICED JUICE PLEASE]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>After you have removed the offending words, de-dupe the spaces. That is, any remaining words should be separated by exactly one space. There should be no spaces at the beginning or end of the output string s2. Letters may be upper or lower case.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ Input: 'The all day meetings will continue until we learn why productivity is so low'\n\n Output: 'The all day will we learn why is so low']]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Given a string s1, return s2 in which all the words with more than one syllable have been removed.To make things simple, we will (for the purposes of this problem) define a polysyllabic word as one in which at least two vowel groups are separated by a least one consonant group. Consider vowels to come from the set [aeiouy]. All other letters are considered consonants. There are many exceptions to the rules I have defined here, but I will keep the test suite consistent with these rules.So these words are polysyllabic:<pre> ANY BUSY POLICEMAN EXPECTS COUNTLESS INTERRUPTIONS</pre>These words are monosyllabic:<pre> STRENGTH IS THE SUM OF ALL WE KNOW TO BE TRUE</pre>Here are some examples of one-syllable words that I WON'T use because they violate my rules:<pre> ONE ICED JUICE PLEASE</pre>After you have removed the offending words, de-dupe the spaces. That is, any remaining words should be separated by exactly one space. There should be no spaces at the beginning or end of the output string s2. Letters may be upper or lower case.Example:<pre> Input: 'The all day meetings will continue until we learn why productivity is so low'</pre><pre> Output: 'The all day will we learn why is so low'</pre>

Given a string s1, return s2 in which all the words with more than one syllable have been removed.

To make things simple, we will (for the purposes of this problem) define a polysyllabic word as one in which at least two vowel groups are separated by a least one consonant group. Consider vowels to come from the set [aeiouy]. All other letters are considered consonants. There are many exceptions to the rules I have defined here, but I will keep the test suite consistent with these rules.

So these words are polysyllabic:

ANY BUSY POLICEMAN EXPECTS COUNTLESS INTERRUPTIONS

These words are monosyllabic:

STRENGTH IS THE SUM OF ALL WE KNOW TO BE TRUE

Here are some examples of one-syllable words that I WON'T use because they violate my rules:

ONE ICED JUICE PLEASE

After you have removed the offending words, de-dupe the spaces. That is, any remaining words should be separated by exactly one space. There should be no spaces at the beginning or end of the output string s2. Letters may be upper or lower case.

Example:

Input:  'The all day meetings will continue until we learn why productivity is so low'

Output: 'The all day will we learn why is so low'

Solve

Solution Stats

307 Solutions
69 Solvers

Last Solution submitted on Jul 12, 2022

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

@bmtran (Bryant Tran) on 21 Dec 2012

asserts are commented out in the test suite...

Ned Gulley on 21 Dec 2012

Whoops! Thanks for pointing that out. I might've eventually gotten suspicious after seeing absolutely everybody passing...

Solution Comments

Solution 6801938

2 Comments

2 Comments

Jan-Andrea Bard on 1 Nov 2021

The test cases seem to be case sensitive though.

Jonathan Metcalf on 12 Jul 2022 at 15:09

This one was fun!

Problem Recent Solvers69

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 920. Eliminate Polysyllabics: Long live short words!

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers69

Suggested Problems

More from this Author50

Problem Tags

Community Treasure Hunt

Problem 920. Eliminate Polysyllabics: Long live short words!

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers69

Suggested Problems

More from this Author50

Problem Tags

Community Treasure Hunt

Players