Textonyms: Difference between revisions

Content added Content deleted
m (→‎{{header|REXX}}: changed the wording in the REXX section header.)
m (→‎{{header|REXX}}: changed the output wording.)
Line 2,067: Line 2,067:
L= length(commas(max(#word,ills,dups,digKey,#))) /*find length of max # being displayed.*/
L= length(commas(max(#word,ills,dups,digKey,#))) /*find length of max # being displayed.*/
say 'The dictionary file being used is: ' iFID
say 'The dictionary file being used is: ' iFID
call tell #word, "words in the file which can be represented by digit key mapping"
call tell #word, 'words' @dict "which can be represented by digit key mapping"
if ills>0 then call tell ills, 'word's(ills) "that contain illegal characters" @dict
if ills>0 then call tell ills, 'word's(ills) "that contain illegal characters" @dict
if dups>0 then call tell dups, 'duplicate word's(dups) "detected" @dict
if dups>0 then call tell dups, 'duplicate word's(dups) "detected" @dict
Line 2,085: Line 2,085:
<pre>
<pre>
The dictionary file being used is: UNIXDICT.TXT
The dictionary file being used is: UNIXDICT.TXT
There are 24,978 words in the file which can be represented by digit key mapping.
There are 24,978 words in the dictionary file which can be represented by digit key mapping.
There are 126 words that contain illegal characters in the dictionary file.
There are 126 words that contain illegal characters in the dictionary file.
There are 22,903 combinations required to represent them.
There are 22,903 combinations required to represent them.
Line 2,099: Line 2,099:
<pre>
<pre>
The dictionary file being used is: TEXTONYMS.TXT
The dictionary file being used is: TEXTONYMS.TXT
There are 12,990 words in the file which can be represented by digit key mapping.
There are 12,990 words in the dictionary file which can be represented by digit key mapping.
There are 95 duplicate words detected in the dictionary file.
There are 95 duplicate words detected in the dictionary file.
There are 11,932 combinations required to represent them.
There are 11,932 combinations required to represent them.