Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 (Tek) 9/26/83; site eros.UUCP
Path: utzoo!watmath!clyde!akgua!sdcsvax!bmcg!cepu!trwrba!trwrb!sdcrdcf!hplabs!tektronix!teklds!eros!speed
From: speed@eros.UUCP
Newsgroups: net.puzzle
Subject: Long vowel strings...
Message-ID: <5@eros.UUCP>
Date: Thu, 3-May-84 16:33:21 EDT
Article-I.D.: eros.5
Posted: Thu May  3 16:33:21 1984
Date-Received: Tue, 8-May-84 00:05:17 EDT
Organization: Tektronix, Beaverton OR
Lines: 22

.

I ran into an interesting puzzle the other day involving vowel
strings in words.  It has two parts and goes like this:

First, maximize the number of vowels in a row in any given
English word.  Prefixes and suffixes ARE allowed.
Then maximize the ratio between the number of vowels in a
row and the total number of letters in the word.
Bear in mind that you must maximize the first part and only then try
to maximize the second part.  A word with 3 vowels in a row beats a
word with 2 vowels in a row no matter what the length ratio is.

What is the maximun nuber of vowels in a row and what is the ratio?

Here are some examples:

boots  =  ( 2 , 3/5 )   while boot = ( 2 , 1/2 )

I have found one example that is 8 letters long and has 5 vowels in a row.
Can anyone do better, and can you find my example?