Write a program [in any language] to find all 'humanly pronounceable' variations of a given word.

Write a program [in any language] to find all 'humanly pronounceable' variations of a given word.

1. For the sake of simplicity, assume that every 'humanly pronounceable' word requires that every consonant should have atleast one vowel next to it.
2. Each variation must contain all of the letters of the original word

Examples:

Input: abc
Output: bac, cab

Input: abce
Output: bace, cabe, beca, beac, ... [you get the picture]

Input: abcd
Output: [no results]  

Select ratingPoorOkayGoodGreatAwesome

No votes yet