Rosetta Code

Textonyms: Difference between revisions

Page Discussion

Textonyms (view source)

Revision as of 04:01, 10 October 2017

21 bytes removed ,  6 years ago
m
→‎{{header|REXX}}: added/changed comments and whitespace, used a template for the OUTPUTs..
(Added a Clojure example)
m (→‎{{header|REXX}}: added/changed comments and whitespace, used a template for the OUTPUTs..)
Line 1,801:
<lang rexx>/*REXX program counts and displays the number of textonyms that are in a dictionary file*/
parse arg iFID . /*obtain optional fileID from the C.L. */
if iFID=='' | iFID=="," then iFID='UNIXDICT.TXT' /*Not specified? Then use the default.*/
@.=0 /*the placeholder of digit combinations*/
!.=; $.= /*sparse array of textonyms; words. */
alphabet= 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' /*the supported alphabet to be used. */
digitKey= 22233344455566677778889999 /*translated alphabet to digit keys. */
digKey=0; wordCount=0 /*number digit combinations; wordCount.*/
ills=0; dups=0; longest=0; mostus=0 /*illegals; duplicated words; longest..*/
first=0.; last=0.; long=0; most=0 /*first, last, longest, most counts. */
call linein iFID, 1, 0 /*point to the first char in dictionary*/▼
#=0 /*number of textonyms in file (so far).*/
▲call linein iFID, 1, 0 /*point to the first char in dictionary*/ /* ◄■■■■■ optional.*/
 
do j=1 while lines(iFID)\==0 /*keep reading the file until exhausted*/
x=linein(iFID); y=x; upper x upper x /*get a word; save a copy; uppercase it*/
if \datatype(x,'U') then do; ills=ills + 1; iterate; end /*is itNot illegallegal? Skip.*/
if $.x\==''. then do; dups=dups + 1; iterate; end /*isDuplicate? it duplicate?Skip.*/
$.x=. else $.x=. /*indicate that it's a righteous word. */
wordCount=wordCount +1 1 /*bump the word count (for the file). */
z=translate(x, digitKey, alphabet) /*build a translated digit key word. */
@.z=@.z +1 1 /*flag that the digit key word exists. */
!.z=!.z y; _=words(!.z) /*build list of equivalent digit key(s)*/
 
if _>most then do; mostus=z; most=_; end /*remember the "mostus" digit keys. */
if @.z==2_>most then do; #mostus=#+1 z; most=_; end /*bumpremember the count of"mostus" the digit textonymskeys. */
 
if first==0 then first=z /*the first textonym found. */▼
if @.z\==12 then iteratedo; #=# + 1 /*Doesbump itthe alreadycount exist?of the Then Skip ittextonyms. */▼
▲ if first==0. then first=z /*the first textonym found. */
last=z /* " last " " */
_=length(!.z) /*the length (# chars) of the digit key*/
Line 1,829 ⟶ 1,831:
longest=max(_, longest) /*now, use this length as a target/goal*/
end /* [↑] discretionary (extra credit). */
 
▲ if @.z\==1 then iterate /*Does it already exist? Then Skip it.*/
digKeyif @.z==digKey+1 then digKey=digKey + 1 /*bump the count of digit key words. */
end /*jwhile*/
@whichCan...= 'which can be represented by digit key mapping.'
@Ta = 'There are '
Line 1,839 ⟶ 1,841:
if dups\==0 then say @Ta dups " duplicate word"s(dups) 'in the dictionary detected.'
say 'The textonyms require ' digKey " combination"s(digKey) 'to represent them.'
say @Ta # ' digit combination's(#) " that can represent Textonyms."
say
if first\==0. then say ' first digit key=' !.first
if last\==0. then say ' last digit key=' !.last
if long\==0 then say ' longest digit key=' !.long
if most\==0 then say ' numerous digit key=' !.mostus ' ('most "words)"
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
s: if arg(1)==1 then return ''; return "s" /*a simple pluralizer.*/</lang>
'''{{out|output''' |text=&nbsp; when using the default input file:}}
<pre>
The dictionary file being used is: UNIXDICT.TXT
Line 1,861 ⟶ 1,863:
numerous digit key= amy any bmw bow box boy cow cox coy (9 words)
</pre>
'''{{out|output''' |text=&nbsp; when using the input file: &nbsp; &nbsp; <tt> textonyms.txt </tt>}}
<pre>
The dictionary file being used is: textonyms.txt
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/254487"