Find words which contains more than 3 e vowels

From Rosetta Code
Find words which contains more than 3 e vowels is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
Task

Use the dictionary   unixdict.txt

Find words which contains more than three   e   vowels   and   contains only   e   vowels.

Show the output here on this page.


Other tasks related to string operations:
Metrics
Counting
Remove/replace
Anagrams/Derangements/shuffling
Find/Search/Determine
Formatting
Song lyrics/poems/Mad Libs/phrases
Tokenize
Sequences



11l[edit]

Translation of: Python
V aiou = ‘aiou’ // to get round ‘bug in MSVC 2017’[https://developercommunity.visualstudio.com/t/bug-with-operator-in-c/565417]

L(word) File(‘unixdict.txt’).read().split("\n")
   I !any(word.map(c -> c C :aiou)) & sum(word.map(c -> Int(c == ‘e’))) > 3
      print(word)
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

8080 Assembly[edit]

puts:	equ	9	; CP/M syscall to print a string
fopen:	equ	15	; Open file
fread:	equ	20	; Read block
FCB1:	equ	5Ch	; File given on command line
dma:	equ	80h
	org	100h
	lxi	d,FCB1	; Try to open file
	mvi	c,fopen
	call	5
	inr	a	; A=FF = error
	jz	err
	lxi	h,word 	; Word buffer
block:	push	h
	lxi	d,FCB1	; Read 128-byte block
	mvi	c,fread
	call	5
	pop	h	; Restore word buffer pointer
	lxi	d,dma	; Start of block
	dcr	a	; If A=1, we're done
	rz
	inr	a	; Otherwise, if A<>0, error
	jnz	err
char:	ldax	d	; Get character from block
	mov	m,a	; Copy into word buffer
	inx	h
	cpi	10	; End of line?
	cz	line	; Then test this line
	inr	e	; Next character in block
	jnz	char	; If rollover, read next block
	jmp	block
line:	mvi	m,'$'	; CP/M string terminator
	lxi	h,word	; Start at beginning
	mvi	c,0	; 'E' counter 
letter:	mov	a,m	; Get letter from word
	inx	h
	cpi	'$'	; End of string?
	jz	done
	cpi	'a'	; A / I / O / U = not valid
	jz	no
	cpi	'i'
	jz	no
	cpi	'o'
	jz	no
	cpi	'u'
	jz	no
	cpi	'e'	; E?
	jnz	letter	; If not, try next letter
	inr	c	; If so, count the E
	jmp	letter
done:	mvi	a,3	; More than 3 Es?
	cmp	c
	jnc	no	; If not, then don't print
	push	d	; Keep buffer pointer
	lxi	d,word	; Print word
	mvi	c,puts 
	call	5
	pop	d	; Restore buffer pointer
no:	lxi	h,word	; Start reading at begin of word buffer
	ret
err:	lxi	d,emsg	; Print error
	mvi	c,puts
	jmp	5
emsg:	db	'Error$'
word:	equ	$
Output:
A>ewords unixdict.txt
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Action![edit]

In the following solution the input file unixdict.txt is loaded from H6 drive. Altirra emulator automatically converts CR/LF character from ASCII into 155 character in ATASCII charset used by Atari 8-bit computer when one from H6-H10 hard drive under DOS 2.5 is used.

BYTE FUNC Count(CHAR ARRAY text CHAR c)
  BYTE i,n

  i=1 n=0
  FOR i=1 TO text(0)
  DO
    IF text(i)=c THEN
      n==+1
    FI
  OD
RETURN (n)

BYTE FUNC IsValidWord(CHAR ARRAY word)
  IF Count(word,'a)#0 THEN RETURN(0) FI
  IF Count(word,'e)<=3 THEN RETURN(0) FI
  IF Count(word,'i)#0 THEN RETURN(0) FI
  IF Count(word,'o)#0 THEN RETURN(0) FI
  IF Count(word,'u)#0 THEN RETURN(0) FI
RETURN (1)

PROC FindWords(CHAR ARRAY fname)
  CHAR ARRAY line(256)
  CHAR ARRAY tmp(256)
  BYTE dev=[1]

  Close(dev)
  Open(dev,fname,4)
  WHILE Eof(dev)=0
  DO
    InputSD(dev,line)
    IF IsValidWord(line) THEN
      PrintE(line)
    FI
  OD
  Close(dev)
RETURN

PROC Main()
  CHAR ARRAY fname="H6:UNIXDICT.TXT"

  FindWords(fname)
RETURN
Output:

Screenshot from Atari 8-bit computer

belvedere dereference elsewhere erlenmeyer evergreen everywhere exegete freewheel
nevertheless persevere preference referee seventeen seventeenth telemeter tennessee

Ada[edit]

with Ada.Text_Io;
with Ada.Strings.Maps;
with Ada.Strings.Fixed;

procedure Find_Three_E is
   use Ada.Text_Io;
   use Ada.Strings;
   use type Ada.Strings.Maps.Character_Set;

   Filename   : constant String  := "unixdict.txt";
   Y_Is_Vowel : constant Boolean := False;
   Set_E      : constant Maps.Character_Set := Maps.To_Set ("eE");
   Set_Y      : constant Maps.Character_Set := Maps.To_Set ("yY");
   Set_Others : constant Maps.Character_Set :=
     Maps.To_Set ("aiouAIOU") or (if Y_Is_Vowel then Set_Y else Maps.Null_Set);
   File       : File_Type;
begin
   Open (File, In_File, Filename);
   while not End_Of_File (File) loop
      declare
         Word         : constant String  := Get_Line (File);
         Count_E      : constant Natural := Fixed.Count (Word, Set_E);
         Count_Others : constant Natural := Fixed.Count (Word, Set_Others);
      begin
         if Count_E > 3 and Count_Others = 0 then
            Put_Line (Word);
         end if;
      end;
   end loop;
   Close (File);
end Find_Three_E;

ALGOL 68[edit]

Interesting to note the word with the most es is "dereference" - a term first used (I believe) in Algol 68...

# find words that contain more than 3 es and no other vowels         #

# read the list of words and look for suitable words                 #
IF  FILE input file;
    STRING file name = "unixdict.txt";
    open( input file, file name, stand in channel ) /= 0
THEN
    # failed to open the file #
    print( ( "Unable to open """ + file name + """", newline ) )
ELSE
    # file opened OK #
    BOOL at eof := FALSE;
    # set the EOF handler for the file #
    on logical file end( input file, ( REF FILE f )BOOL:
                                     BEGIN
                                         # note that we reached EOF on the #
                                         # latest read #
                                         at eof := TRUE;
                                         # return TRUE so processing can continue #
                                         TRUE
                                     END
                       );
    INT eeee words := 0;
    WHILE STRING word;
          get( input file, ( word, newline ) );
          NOT at eof
    DO
        INT e count := 0, other vowel count := 0;
        FOR w pos FROM LWB word TO UPB word DO
            CHAR c = word[ w pos ];
            IF   c = "e"
            THEN e count +:= 1
            ELIF c = "a"
              OR c = "i"
              OR c = "o"
              OR c = "u"
            THEN other vowel count +:= 1
            FI
        OD;
        IF e count > 3 AND other vowel count = 0 THEN
           eeee words +:= 1;
           print( ( whole( eeee words, -5 ), ": ", word, "   (", whole( e count, 0 ), ")", newline ) )
        FI
    OD;
    close( input file )
FI
Output:
    1: belvedere   (4)
    2: dereference   (5)
    3: elsewhere   (4)
    4: erlenmeyer   (4)
    5: evergreen   (4)
    6: everywhere   (4)
    7: exegete   (4)
    8: freewheel   (4)
    9: nevertheless   (4)
   10: persevere   (4)
   11: preference   (4)
   12: referee   (4)
   13: seventeen   (4)
   14: seventeenth   (4)
   15: telemeter   (4)
   16: tennessee   (4)

Arturo[edit]

words: read.lines relative "unixdict.txt"
otherVowels: ["a" "i" "o" "u"]
containsMoreThan3Es?: function [w][
    if 4 > size match w "e" -> return false

    loop otherVowels 'v [
        if contains? w v -> return false
    ]
    return true
]

loop words 'word [
    if containsMoreThan3Es? word ->
        print word
]
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

AutoHotkey[edit]

FileRead, db, % A_Desktop "\unixdict.txt"
vowelsLessE := ["a", "i", "o", "u"]
oRes := []
main:
for i, word in StrSplit(db, "`n", "`r")
{
    for j, v in vowelsLessE
    {
        StrReplace(word, v, v, c)
        if c
            continue main
    }
    StrReplace(word, "e", "e", c)
    if c > 3
        result .= word "`n"
}
MsgBox, 262144, , % result
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

AWK[edit]

/e.*e.*e.*e/ && !/a|i|o|u/ {print}
Output:
$ awk -f ewords.awk unixdict.txt
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

BCPL[edit]

get "libhdr"

let reads(v) = valof
$(  v%0 := 0
    $(  let ch = rdch()
        if ch = endstreamch resultis false
        if ch = '*N' resultis true
        v%0 := v%0 + 1
        v%(v%0) := ch
    $) repeat
$)

let testword(v) = valof
$(  let e = 0
    for i = 1 to v%0
    $(  if v%i='e' then e := e+1
        if v%i='a' | v%i='i' | v%i='u' | v%i='o' resultis false
    $)
    resultis e > 3
$)

let start() be
$(  let word = vec 256/BYTESPERWORD
    selectinput(findinput("unixdict.txt"))
    while reads(word) if testword(word) do writef("%S*N",word)
    endread()
$)
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

C[edit]

#include <stdio.h>
#define SIZE 256

int check(char *word) {
    int e = 0, ok = 1;
    for(; *word && ok; word++) {
        switch(*word) {
            case 'a':
            case 'i':
            case 'o':
            case 'u': ok = 0; break;
            case 'e': e++;
        }
    }
    
    return ok && e > 3;
}
    
int main() {
    FILE *f;
    char line[SIZE];
    
    if (!(f = fopen("unixdict.txt", "r"))) {
        fprintf(stderr, "Cannot open unixdict.txt\n");
        return 1;
    }
    
    while (!feof(f)) {
        fgets(line, SIZE, f);
        if (check(line)) printf("%s", line);
    }
    
    fclose(f);
    return 0;
}
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

C++[edit]

#include <iostream>
#include <fstream>

bool test(const std::string &line) {
    unsigned int e = 0;
    for (char c : line) {
        switch(std::tolower(c)) {
            case 'a': return false;
            case 'i': return false;
            case 'o': return false;
            case 'u': return false;
            case 'e': ++e;
        }
    }
    return e > 3;
}

int main() {
    std::ifstream dict{"unixdict.txt"};
    
    if (! dict.is_open()) {
        std::cerr << "Cannot open unixdict.txt\n";
        return 3;
    }
    
    for (std::string line; std::getline(dict, line);) {
        if (test(line)) std::cout << line << std::endl;
    }
    
    return 0;
}
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

CLU[edit]

e_word = proc (s: string) returns (bool)
    e: int := 0
    for c: char in string$chars(s) do
        if string$indexc(c, "aiou") ~= 0 then
            return (false)
        end
        if c = 'e' then e := e + 1 end
    end
    return (e > 3)
end e_word
    

start_up = proc ()
    po: stream := stream$primary_output()
    dict: stream := stream$open(file_name$parse("unixdict.txt"), "read")
    
    while true do
        word: string := stream$getl(dict)
            except when end_of_file: break end
        if e_word(word) then stream$putl(po, word) end
    end
    stream$close(dict)
end start_up
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

COBOL[edit]

       IDENTIFICATION DIVISION.
       PROGRAM-ID. E-WORDS.
       
       ENVIRONMENT DIVISION.
       INPUT-OUTPUT SECTION.
       FILE-CONTROL.
           SELECT DICT ASSIGN TO DISK
           ORGANIZATION LINE SEQUENTIAL.
           
       DATA DIVISION.
       FILE SECTION.
       FD DICT 
           LABEL RECORD STANDARD
           VALUE OF FILE-ID IS "unixdict.txt".
       01 WORD            PIC X(64).
       
       WORKING-STORAGE SECTION.
       01 E               PIC 99.
       01 OTHER           PIC 99.
       
       PROCEDURE DIVISION.
       BEGIN.
           OPEN INPUT DICT.
           
       READ-WORD.
           READ DICT, AT END CLOSE DICT, STOP RUN.
           PERFORM CHECK-WORD.
           GO TO READ-WORD.
           
       CHECK-WORD.
           MOVE ZERO TO E, OTHER.
           INSPECT WORD TALLYING OTHER FOR ALL 'a'.
           INSPECT WORD TALLYING E FOR ALL 'e'.
           INSPECT WORD TALLYING OTHER FOR ALL 'i'.
           INSPECT WORD TALLYING OTHER FOR ALL 'o'.
           INSPECT WORD TALLYING OTHER FOR ALL 'u'.
           IF E IS GREATER THAN 3 AND OTHER IS EQUAL TO ZERO,
               DISPLAY WORD.
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Cowgol[edit]

include "cowgol.coh";
include "file.coh";

interface LineCb(line: [uint8]);
sub ForEachLine(file: [FCB], cb: LineCb) is
    var buf: uint8[256];
    var ptr := &buf[0];
    
    var length := FCBExt(file);
    while length != 0 loop
        var ch := FCBGetChar(file);
        [ptr] := ch;
        ptr := @next ptr;
        if ch == '\n' then
            [ptr] := 0;
            ptr := &buf[0];
            cb(&buf[0]);
        end if;
        length := length - 1;
    end loop;
end sub;

sub CheckWord implements LineCb is
    var ch := line; 
    var e: uint8 := 0;
    loop
        case [ch] is
            when 0: break;
            when 'a': return;
            when 'i': return;
            when 'o': return;
            when 'u': return;
            when 'e': e := e + 1;
        end case;
        ch := @next ch;
    end loop;
    
    if e > 3 then
        print(line);
    end if;
end sub;

var file: FCB;
if FCBOpenIn(&file, "unixdict.txt") != 0 then
    print("Cannot open unixdict.txt\n");
    ExitWithError();
end if;

ForEachLine(&file, CheckWord);
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Draco[edit]

proc eword(*char line) bool:
    word e;
    char c;
    bool ok;
    ok := true;
    e := 0;
    while 
        c := line*;
        line := line + 1;
        ok and c ~= '\e'
    do
        if c='a' or c='i' or c='o' or c='u' then
            ok := false
        elif c='e' then
            e := e + 1
        fi
    od;
    ok and e>3
corp

proc nonrec main() void:
    file(1024) dictfile;
    [32] char buf;
    *char line;
    channel input text dict;
    
    open(dict, dictfile, "unixdict.txt");
    line := &buf[0];
    
    while readln(dict; line) do
        if eword(line) then writeln(line) fi
    od;
    
    close(dict)
corp
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

F#[edit]

// Words contains more than 3 e vowels. Nigel Galloway: February 11th., 2021.
let fN g=let n=Map.ofSeq (Seq.countBy id g) in let fN g=not(n.ContainsKey g) in fN 'a' && fN 'i' && fN 'o' && fN 'u' && not(fN 'e') && n.['e']>3
seq{use n=System.IO.File.OpenText("unixdict.txt") in while not n.EndOfStream do yield n.ReadLine()}|>Seq.filter fN|>Seq.iter(printfn "%s")
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Factor[edit]

USING: formatting io io.encodings.ascii io.files kernel math
sequences ;

"unixdict.txt" ascii file-lines
[ [ "aiou" member? ] any? ] reject
[ [ CHAR: e = ] count 3 > ] filter
[ 1 + "%2d: " printf print ] each-index
Output:
 1: belvedere
 2: dereference
 3: elsewhere
 4: erlenmeyer
 5: evergreen
 6: everywhere
 7: exegete
 8: freewheel
 9: nevertheless
10: persevere
11: preference
12: referee
13: seventeen
14: seventeenth
15: telemeter
16: tennessee

Forth[edit]

Works with: Gforth
: e3 ( addr u -- ? )
  0 { ecount }
  0 do
    dup c@ case
      'a' of false endof
      'e' of ecount 1+ to ecount true endof
      'i' of false endof
      'o' of false endof
      'u' of false endof
      true swap
    endcase
    invert if unloop drop false exit then
    1+
  loop
  drop
  ecount 3 > ;

256 constant max-line

: main
  0 0 { count fd-in }
  s" unixdict.txt" r/o open-file throw to fd-in
  begin
    here max-line fd-in read-line throw
  while
    here swap 2dup e3 if
      count 1+ to count
      count 2 .r ." . " type cr
    else
      2drop
    then
  repeat
  drop
  fd-in close-file throw ;

main
bye
Output:
 1. belvedere
 2. dereference
 3. elsewhere
 4. erlenmeyer
 5. evergreen
 6. everywhere
 7. exegete
 8. freewheel
 9. nevertheless
10. persevere
11. preference
12. referee
13. seventeen
14. seventeenth
15. telemeter
16. tennessee

FreeBASIC[edit]

open "unixdict.txt" for input as #1

dim as string s, c
dim as integer e, i

while not eof(1)
    line input #1, s
    e = 0
    for i = 1 to len(s)
        c = mid(s,i,1)
        if c="e" then e+=1
        if c="a" or c="i" or c="o" or c="u" then continue while
    next i
    if e>3 then print s
wend
Output:

belvedere dereference elsewhere erlenmeyer evergreen everywhere exegete freewheel nevertheless persevere preference referee seventeen seventeenth telemeter tennessee

Frink[edit]

for word = lines["https://web.archive.org/web/20180611003215if_/http://www.puzzlers.org:80/pub/wordlists/unixdict.txt"]
{
   d = countToDict[charList[word]]
   if d.get["a",0] == 0 and d.get["e",0] > 3 and d.get["i",0] == 0 and d.get["o",0] == 0 and d.get["u",0] == 0
      println[word]
}
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Go[edit]

package main

import (
    "bytes"
    "fmt"
    "io/ioutil"
    "log"
    "strings"
    "unicode/utf8"
)

func main() {
    wordList := "unixdict.txt"
    b, err := ioutil.ReadFile(wordList)
    if err != nil {
        log.Fatal("Error reading file")
    }
    bwords := bytes.Fields(b)
    var words []string
outer:
    for _, bword := range bwords {
        s := string(bword)
        if utf8.RuneCountInString(s) >= 4 {
            for _, c := range s {
                if strings.ContainsRune("aiou", c) {
                    continue outer
                }
            }
            words = append(words, s)
        }
    }
    wcount := 0
    for _, word := range words {
        ecount := 0
        for _, c := range word {
            if c == 'e' {
                ecount++
            }
        }
        if ecount > 3 {
            wcount++
            fmt.Printf("%2d: %s\n", wcount, word)
        }
    }
}
Output:
 1: belvedere
 2: dereference
 3: elsewhere
 4: erlenmeyer
 5: evergreen
 6: everywhere
 7: exegete
 8: freewheel
 9: nevertheless
10: persevere
11: preference
12: referee
13: seventeen
14: seventeenth
15: telemeter
16: tennessee

Haskell[edit]

import System.IO

main = withFile "unixdict.txt" ReadMode $ \h -> do
    words <- fmap lines $ hGetContents h
    putStrLn $ unlines $ filter valid words 
    
valid w = not (any (`elem` "aiou") w) && length (filter (=='e') w) > 3
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

J[edit]

   >(#~ (0 4 0 0 0 -: 4 <. +/ .(=/)&'aeiou')@>) cutLF fread'unixdict.txt'
belvedere   
dereference 
elsewhere   
erlenmeyer  
evergreen   
everywhere  
exegete     
freewheel   
nevertheless
persevere   
preference  
referee     
seventeen   
seventeenth 
telemeter   
tennessee

(Also possible to do this with regular expressions, but this works. Here, we counted how many times each vowel occurred, limited the maximum count to 4, and checked the resulting signature.)

jq[edit]

Works with: jq

Works with gojq, the Go implementation of jq

Using regular expressions[edit]

inputs
| select(test("[aiou]")|not)
| select(test("e.*e.*e.*e"))

Regex-free solution[edit]

def count(s): reduce s as $x (null; .+1);

("aiou" | explode) as $disallow
| inputs
| . as $word
| explode
| select( all(.[]; . != $disallow[]) and
          count(.[] | select(. == 101)) > 3) # "e" is 101
| $word
Output:

Invocation example: jq -nrR program.jq unixdict.txt

belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Julia[edit]

See Alternade_words#Julia for the foreachword function.

ecount(word) = count(x -> x == 'e', word)
vowelcount(word) = count(x -> x in ['a', 'e', 'i', 'o', 'u'], word)
onlyevowelsmorethan3(word, _) = begin n, m = vowelcount(word), ecount(word); n == m && m > 3 ? word : "" end

foreachword("unixdict.txt", onlyevowelsmorethan3, colwidth=15, numcols=8)
Output:
belvedere      dereference    elsewhere      erlenmeyer     evergreen      everywhere     exegete        freewheel      
nevertheless   persevere      preference     referee        seventeen      seventeenth    telemeter      tennessee

Ksh[edit]

#!/bin/ksh

# Find words which contains more than 3 e vowels and only e vowels

#	# Variables:
#
badvowels='a|i|o|u'
typeset -si MINE=4

dictionary='../unixdict.txt'

#	# Functions:
#

#	# Function _countch(str, ch) return cpount of ch in  str
#
function _countch {
	typeset _str ; typeset -l _str="$1"
	typeset _ch ; typeset -lL1 _ch="$2"
	typeset _i _cnt ; typeset -si _i _cnt=0

	for ((_i=0; _i<${#_str}; _i++)); do
		[[ ${_str:_i:1} == ${_ch} ]] && (( _cnt++ ))
	done
	echo ${_cnt}
}

 ######
# main #
 ######

while read; do
	[[ $REPLY == *+(${badvowels})* ]] && continue
	(( $(_countch "$REPLY" "e") >= MINE )) && print $REPLY
done < ${dictionary}
Output:

belvedere dereference elsewhere erlenmeyer evergreen everywhere exegete freewheel nevertheless persevere preference referee seventeen seventeenth telemeter

tennessee

Mathematica/Wolfram Language[edit]

vowels = Characters["euioa"];
dict = Once[Import["https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt"]];
dict //= StringSplit[#, "\n"] &;
dict = {#, Select[Characters[#], MemberQ[vowels, #] &]} & /@ dict;
dict //= Select[Last /* Count["e"] /* GreaterThan[3]];
dict //= Select[Last /* Apply[SameQ]];
dict[[All, 1]]
Output:
{belvedere, dereference, elsewhere, erlenmeyer, evergreen, everywhere, exegete, freewheel, nevertheless, persevere, preference, referee, seventeen, seventeenth, telemeter, tennessee}

Nim[edit]

import strutils

const NonEVowels = ['a', 'i', 'o', 'u']

var count = 0
for word in "unixdict.txt".lines:
  block checkWord:
    if word.count('e') <= 3: break checkWord
    for vowel in NonEVowels:
      if vowel in word: break checkWord
    inc count
    stdout.write word.align(14), if count mod 4 == 0: '\n' else: ' '
Output:
     belvedere    dereference      elsewhere     erlenmeyer
     evergreen     everywhere        exegete      freewheel
  nevertheless      persevere     preference        referee
     seventeen    seventeenth      telemeter      tennessee

Pascal[edit]

Works with: Turbo Pascal
program EWords;
var
   FileVar: Text;
   Line: string[255];
   I: Integer;
   E: Integer;
   OK: Boolean;
begin
   Assign(FileVar, 'unixdict.txt');
   Reset(FileVar);

   while not Eof(FileVar) do
   begin
      ReadLn(FileVar, Line);
      E := 0;
      OK := True;
      for I := 1 to Length(Line) do
      begin
         OK := OK and (Pos(Line[I], 'aiou') = 0);
         if Line[I] = 'e' then E := E + 1
      end;
      if OK and (E > 3) then
      begin
         Write(Line);
         WriteLn;
      end
   end
end.
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Perl[edit]

#!/usr/bin/perl

use strict; # https://rosettacode.org/wiki/Find_words_which_contains_more_than_3_e_vowels
use warnings;

@ARGV = 'unixdict.txt';
tr/e// > 3 and tr/aiou// == 0 and print while <>;
Output:

belvedere dereference elsewhere erlenmeyer evergreen everywhere exegete freewheel nevertheless persevere preference referee seventeen seventeenth telemeter tennessee

Phix[edit]

with javascript_semantics
function note(string word) return find_any("aiou",word)=0 and length(find_all('e',word))>3 end function
sequence notes = filter(unix_dict(),note)
printf(1,"%d words: %s\n",{length(notes),join(shorten(notes,"",3))})
Output:
16 words: belvedere dereference elsewhere ... seventeenth telemeter tennessee

PL/I[edit]

moreThanThreeEs: procedure options(main);
    declare dict file;
    open file(dict) title('unixdict.txt');
    on endfile(dict) stop;
    
    declare word char(32) varying;
    do while('1'b);
        next: get file(dict) list(word);

        declare (e, i) fixed, ch char;
        e = 0;
        do i=1 to length(word);
            ch = substr(word, i, 1);
            if verify(ch, 'aiou') = 0 then go to next;
            if ch = 'e' then e = e + 1;
        end;
        
        if e > 3 then put skip list(word);
    end;
    
    close file(dict);
end moreThanThreeEs;
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Python[edit]

with open('unixdict.txt', 'rt') as f:
    for line in f.readlines():
        if not any(c in 'aiou' for c in line) and sum(c=='e' for c in line)>3:
            print(line.strip())
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

R[edit]

Adapting this from https://rosettacode.org/wiki/Find_words_which_contains_all_the_vowels#R is trivial.

dict <- scan("https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt", what = character())
#The following line is equivalent to sapply(c("a", "i", "o", "u"), function(x) stringr::str_count(dict, x))
#As with all things with strings in R, life is easier with stringr or stringi.
notEVowelCount <- sapply(c("a", "i", "o", "u"), function(x) lengths(regmatches(dict, gregexec(x, dict))))
eCount <- lengths(regmatches(dict, gregexec("e", dict)))
dict[apply(notEVowelCount, MARGIN = 1, function(x) all(x < 1)) & eCount > 3]

Racket[edit]

#lang racket

;; probably not the best name, but matches the name of the task
(define (contains-more-than-3-e-vowels? s)
  (let loop ((i (string-length s)) (es 0))
    (if (zero? i)
        (> es 3)
        (let ((i- (sub1 i)))
          (match (string-ref s i-)
            ((or #\a #\i #\o #\u) #f)
            (#\e (loop i- (add1 es)))
            (_ (loop i- es)))))))

(define qualifying-words
  (filter contains-more-than-3-e-vowels?
          (file->lines "../../data/unixdict.txt")))

(module+ main
  qualifying-words)
Output:
'("belvedere" "dereference" "elsewhere" "erlenmeyer" "evergreen" "everywhere" "exegete" "freewheel" "nevertheless" "persevere" "preference" "referee" "seventeen" "seventeenth" "telemeter" "tennessee")

Raku[edit]

Hardly even worth saving as a script file; an easily entered one-liner.

.say for "unixdict.txt".IO.lines.grep: { !/<[aiou]>/ and /e.*e.*e.*e/ };
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

In an attempt to be a little less useless, here's an alternate script that allows you to specify a vowel, the minimum count to search for, and the file to search. Counts base vowels case, and combining accent insensitive; works with any text file, not just word lists. Defaults to finding words with at least 4 'e's in unixdict.txt. Default output is same as above.

unit sub MAIN ($vowel = 'e', $min = 4, $file = 'unixdict.txt');
.say for squish sort
  ( $file.IO.slurp.words.grep: { ((my $b = .lc.samemark(' ').comb.Bag){$vowel} >= $min) && $b<a e i o u>.sum == $b{$vowel} } )\
  ».subst(/<[":;,.?!_\[\]]>/, '', :g);

How about: find words with at least 4 'a's in the Les Misérables file used for the Word frequency task?

Command line > raku monovowel a 4 lemiz.txt

Output:
Caracalla
Caracara
Salamanca
Vâsaphantâ

Red[edit]

Red[]

words: read/lines %unixdict.txt
forbidden: charset "aiou"

foreach word words [
    e's: 0
    retain: yes
    foreach char word [
        if find forbidden char [retain: no break]
        if #"e" = char [e's: e's + 1]
    ]
    if all [retain e's > 3] [print word]
]
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

REXX[edit]

This REXX version doesn't care what order the words in the dictionary are in,   nor does it care what
case  (lower/upper/mixed)  the words are in,   the search for the words and vowels is   caseless.

It also allows the vowel to be specified,   and also the minimum number of the specific vowels to be specified on the command line (CL) as well as the dictionary file identifier.

/*REXX pgm finds words (within an identified dict.)  which contain more than three "e"s.*/
parse arg char many iFID .                       /*obtain optional arguments from the CL*/
if char=='' | char=="," then char= 'e'           /*Not specified?  Then use the default.*/
if many=='' | many=="," then many=  4            /* "      "         "   "   "     "    */
if iFID=='' | iFID=="," then iFID='unixdict.txt' /* "      "         "   "   "     "    */
chrU= char;                  upper chrU          /*obtain an uppercase version of  char.*/
           do #=1  while lines(iFID)\==0         /*read each word in the file  (word=X).*/
           x= strip( linein( iFID) )             /*pick off a word from the input line. */
           @.#= x                                /*save:  the original case of the word.*/
           end   /*#*/
#= # - 1                                         /*adjust word count because of DO loop.*/
say copies('─', 30)     #        "words in the dictionary file: "       iFID
finds= 0                                         /*count of the  "eeee"  words found.   */
vowels= 'aeiou'                                  /*obtain the list of all the vowels.   */
upper vowels                                     /*uppercase all the other vowels.      */
vowels= space( translate(vowels, , chrU),  0)    /*elide the one vowel we're looking for*/
                                                 /*process all the words that were found*/
     do j=1  for #;    $= @.j;         upper $   /*obtain word from dict.; uppercase it.*/
     if verify(vowels, $, 'M')>0  then iterate   /*Does it contain other vowels? Skip it*/
     if countstr(chrU, $) < many  then iterate   /*  "   " have enough of  'e's?   "   "*/
     finds= finds + 1                            /*bump count of only "e" vowels found. */
     say right( left(@.j, 30),  40)              /*indent original word for readability.*/
     end        /*j*/
                                                 /*stick a fork in it,  we're all done. */
say copies('─', 30) finds  " words found having "  many ' ' copies(char, many) " letters."
output   when using the default inputs:
────────────────────────────── 25104 words in the dictionary file:  unixdict.txt
          belvedere
          dereference
          elsewhere
          erlenmeyer
          evergreen
          everywhere
          exegete
          freewheel
          nevertheless
          persevere
          preference
          referee
          seventeen
          seventeenth
          telemeter
          tennessee
────────────────────────────── 16  words found having  4   eeee  letters.

Ring[edit]

load "stdlib.ring"

cStr = read("unixdict.txt")
wordList = str2list(cStr)
char = list(9)
nextwords = []
nr = 0
num = 0

see "working..." + nl

ln = len(wordList)
for n = ln to 1 step -1
    if len(wordList[n]) < 6
       del(wordList,n)
    ok
next

see "Words are:" + nl

for n = 1 to len(wordList)
    num = 0
    flag = 1
    for m = 1 to len(wordList[n])
        if isvowel(wordList[n][m])
           if wordList[n][m] != "e"
              flag = 0
              exit
           else
              num = num + 1
           ok
        ok
    next
    if flag = 1 and num > 3
       nr = nr + 1
       see "" + nr + ". " + wordList[n] + nl
    ok
next

see "done..." + nl

Output:

working...
Words are:
1. belvedere
2. dereference
3. elsewhere
4. erlenmeyer
5. evergreen
6. everywhere
7. exegete
8. freewheel
9. nevertheless
10. persevere
11. preference
12. referee
13. seventeen
14. seventeenth
15. telemeter
16. tennessee
done...

Ruby[edit]

File.new("unixdict.txt").each do |word| 
  puts word if word.count("e") > 3 && word.count("aiou") == 0
end
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Snobol[edit]

        input(.words, 1,, 'unixdict.txt')   :s(line)
        output = 'Error!'                   :(end)
line    word = words                        :f(end)
        word 'a' | 'i' | 'o' | 'u'          :s(line)
        word 'e' arb 'e' arb 'e' arb 'e'    :f(line)
        output = word                       :(line)
end
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee

Swift[edit]

import Foundation

func e3(_ word: String) -> Bool {
    var ecount = 0
    for ch in word {
        switch (ch) {
        case "a", "A", "i", "I", "o", "O", "u", "U":
            return false
        case "e", "E":
            ecount += 1
        default:
            break
        }
    }
    return ecount > 3
}

do {
    try String(contentsOfFile: "unixdict.txt", encoding: String.Encoding.ascii)
        .components(separatedBy: "\n")
        .filter{e3($0)}
        .enumerated()
        .forEach{print(String(format: "%2d. %@", $0.0 + 1, $0.1))}
} catch {
    print(error.localizedDescription)
}
Output:
 1. belvedere
 2. dereference
 3. elsewhere
 4. erlenmeyer
 5. evergreen
 6. everywhere
 7. exegete
 8. freewheel
 9. nevertheless
10. persevere
11. preference
12. referee
13. seventeen
14. seventeenth
15. telemeter
16. tennessee

Wren[edit]

Library: Wren-fmt
import "io" for File
import "/fmt" for Fmt

var hasAIOU = Fn.new { |word| word.any { |c| "aiou".contains(c) } }
var wordList = "unixdict.txt" // local copy
var words = File.read(wordList).trimEnd().split("\n").where { |w| w.count >= 4 && !hasAIOU.call(w) }.toList
var count = 0
for (word in words) {
    if (word.count { |c| c == "e" } > 3) {
        count = count + 1
        Fmt.print("$2d: $s", count, word)
    }
}
Output:
 1: belvedere
 2: dereference
 3: elsewhere
 4: erlenmeyer
 5: evergreen
 6: everywhere
 7: exegete
 8: freewheel
 9: nevertheless
10: persevere
11: preference
12: referee
13: seventeen
14: seventeenth
15: telemeter
16: tennessee

XPL0[edit]

string 0;               \Use zero-terminated strings
int  I, Ch, Len;
char Word(100); \(longest word in unixdict.txt is 22 chars)
def  LF=$0A, CR=$0D, EOF=$1A;

        func Vowel(Ch); \Return 'true' if character is a vowel, except "e"
        int  Ch;
        case Ch of ^a, ^i, ^o, ^u: return true
        other return false;

        func Es;
        \Return 'true' if Word contains more than 3 e's and no other vowels
        int  Cnt, I;
        [Cnt:= 0;
        for I:= 0 to Len-1 do
            [if Word(I) = ^e then Cnt:= Cnt+1;
            if Vowel(Word(I)) then return false;
            ];
        return Cnt > 3;
        ];

[FSet(FOpen("unixdict.txt", 0), ^I);    \open dictionary and set it to device 3
OpenI(3);
repeat  I:= 0;
        loop    [repeat Ch:= ChIn(3) until Ch # CR;     \remove possible CR
                if Ch=LF or Ch=EOF then quit;
                Word(I):= Ch;
                I:= I+1;
                ];
        Len:= I;
        Word(I):= 0;                    \terminate string
        if Es then [Text(0, Word);  CrLf(0)];
until   Ch = EOF;
]
Output:
belvedere
dereference
elsewhere
erlenmeyer
evergreen
everywhere
exegete
freewheel
nevertheless
persevere
preference
referee
seventeen
seventeenth
telemeter
tennessee