Find words which contains more than 3 e vowels: Difference between revisions

{{Template:Strings}}

<br><br>

 

=={{header|8080 Assembly}}==

fopen: equ 15 ; Open file

fread: equ 20 ; Read block

jmp 5

emsg: db 'Error$'

 

{{out}}

telemeter

tennessee

</pre>

 

=={{header|Ada}}==

with Ada.Strings.Maps;

with Ada.Strings.Fixed;

end loop;

Close (File);

 

=={{header|ALGOL 68}}==

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

 

# read the list of words and look for suitable words #

OD;

close( input file )

{{out}}

<pre>

16: tennessee (4)

</pre>

 

=={{header|AWK}}==

 

{{out}}

tennessee

</pre>

 

=={{header|C}}==

#define SIZE 256

 

fclose(f);

return 0;

 

{{out}}

 

=={{header|C++}}==

#include <fstream>

 

return 0;

 

{{out}}

 

<pre>belvedere

dereference

 

=={{header|Cowgol}}==

include "file.coh";

 

end if;

 

 

{{out}}

tennessee

</pre>

 

=={{header|F_Sharp|F#}}==

// 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")

{{out}}

<pre>

 

=={{header|Factor}}==

sequences ;

 

[ [ "aiou" member? ] any? ] reject

[ [ CHAR: e = ] count 3 > ] filter

{{out}}

<pre>

=={{header|Forth}}==

{{works with|Gforth}}

0 { ecount }

0 do

 

main

 

{{out}}

<pre>

1. belvedere

 

=={{header|Go}}==

 

import (

}

}

 

{{out}}

 

=={{header|Haskell}}==

 

main = withFile "unixdict.txt" ReadMode $ \h -> do

putStrLn $ unlines $ filter valid words

 

{{out}}

 

<pre>belvedere

dereference

telemeter

tennessee</pre>

 

=={{header|Julia}}==

See [[Alternade_words#Julia]] for the foreachword function.

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)

<pre>

belvedere dereference elsewhere erlenmeyer evergreen everywhere exegete freewheel

nevertheless persevere preference referee seventeen seventeenth telemeter tennessee

</pre>

 

=={{header|Pascal}}==

{{works with|Turbo Pascal}}

var

FileVar: Text;

end

end

 

{{out}}

 

=={{header|Perl}}==

 

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

 

@ARGV = 'unixdict.txt';

{{out}}

belvedere

 

=={{header|Phix}}==

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"%d words: %s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">notes</span><span style="color: #0000FF;">),</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">shorten</span><span style="color: #0000FF;">(</span><span style="color: #000000;">notes</span><span style="color: #0000FF;">,</span><span style="color: #008000;">""</span><span style="color: #0000FF;">,</span><span style="color: #000000;">3</span><span style="color: #0000FF;">))})</span>

{{out}}

<pre>

16 words: belvedere dereference elsewhere ... seventeenth telemeter tennessee

</pre>

 

=={{header|Python}}==

for line in f.readlines():

if not any(c in 'aiou' for c in line) and sum(c=='e' for c in line)>3:

 

{{out}}

telemeter

tennessee</pre>

 

=={{header|Raku}}==

 

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

{{out}}

<pre>

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.

 

.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} } )\

 

How about: find words with at least 4 'a's in the [https://github.com/thundergnat/rc-run/blob/master/rc/resources/lemiz.txt Les Misérables file] used for the [[Word frequency]] task?

Salamanca

Vâsaphantâ</pre>

 

=={{header|REXX}}==

 

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

parse arg char many iFID . /*obtain optional arguments from the CL*/

if char=='' | char=="," then char= 'e' /*Not specified? Then use the default.*/

end /*j*/

/*stick a fork in it, we're all done. */

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

 

=={{header|Ring}}==

load "stdlib.ring"

 

 

see "done..." + nl

Output:

<pre>

16. tennessee

done...

</pre>

 

=={{header|Snobol}}==

output = 'Error!' :(end)

line word = words :f(end)

word 'e' arb 'e' arb 'e' arb 'e' :f(line)

output = word :(line)

 

{{out}}

 

=={{header|Swift}}==

 

func e3(_ word: String) -> Bool {

} catch {

print(error.localizedDescription)

 

{{out}}

=={{header|Wren}}==

{{libheader|Wren-fmt}}

 

var hasAIOU = Fn.new { |word| word.any { |c| "aiou".contains(c) } }

Fmt.print("$2d: $s", count, word)

}

 

{{out}}

15: telemeter

16: tennessee

</pre>