what's the 5 letter word with the most one-word anagrams?

[KrazyHorse]

In other words, what 5 letters (not necessarily distinct) together can make up the most distinct 5 letter words.

So far I can think of an 11 (11 different words made with the same 5 letters)

[MRT144]

what is your word you have in mind?

[KrazyHorse]

apres
asper
pears
spear
rapes
reaps
pares
parse
prase
spare
presa

(the last one is iffy; it's a breed of dog and might be considered a proper noun)

[Ari Rahikkala]

Well, hell. I must say that I managed to impress myself with Haskell.

module Main where
import Data.List
import Data.Char

length_order a b = let l_a = length a
		       l_b = length b
		       order | l_a == l_b = EQ
			     | l_a < l_b  = LT
			     | l_a > l_b  = GT
		       in order

main = interact $
       (\line -> unlines . take 1 . last . sortBy length_order 
       . group . sort . map sort . map (map toLower) 
       . filter (\line -> length line == 5) $ words line)

(a couple of hours later, I realised that length_order was comparing in reverse... I'd just quickly hacked it up in order to get the right result. Fixed.)

This code finds out that the letter combination to look out for is "agnor" (in alphabetic order, all-lowercase). Here's another program, to find out what words actually anagrammize to that:

module Main where
import Data.List
import Data.Char

main = interact $
       (\input -> unlines $ filter 
	(\word -> (sort (map toLower word)) == "agnor") $ lines input)

angor
argon
goran
grano
groan
nagor
Orang <-- please remember I've been
orang <-- using a Unix for 7 years
organ
rogan
Ronga

(the source for these words is, of course, /usr/share/dict/words, aka Webster's Second International, from 1934)

[Chemical Ollie]

Does any language count?

[Kuciwalker]

Haskell

It's not that hard to do something similar in a normal language

[KrazyHorse]

Originally posted by Ari Rahikkala
Well, hell. I must say that I managed to impress myself with Haskell.

Here's mine. A combination of C and bash:

First I took a wordlist (only 5 letter words) with one word on each line. Then I used gedit to add in a series of bash commands (using find/replace on the newlines) so I got a second file like this.

5letscr.sh

#!/bin/bash

bash jmb2.sh abaca
.
.
.
bash jmb2.sh zymes

jmb2.sh

#!/bin/bash
gcc -o jmb2.out jmb2.c
echo $1 > jmbtmpfile
./jmb2.out < jmbtmpfile > words2.sh
rm jmbtmpfile
bash ./words2.sh

jmb2.c

#include 
#include  

int rvd5(int a, int b, int c, int d, int e);
int rvd6(int a, int b, int c, int d, int e, int f);

main()

{

	char word[80];
  int count, tag, i, j, k, l, m, n;
  
	for (count=0; (word[count] = getchar()) != '\n'; ++count)
		;
	tag = count;
		
	printf ("#!/bin/bash\n");
	printf ("rm -f jmbtmpfile\n");

	if (tag == 5) {
	for (i = 0; i <= 4; i++){
		for (j = 0; j <= 4; j++){
			for (k = 0; k <= 4; k++){
				for (l = 0; l <= 4; l++){
					for (m = 0; m <= 4; m++){
						if (rvd5(i,j,k,l,m) != 0)
							printf("grep -c \'%c%c%c%c%c\' 5letlist.txt >> jmbtmpfile \n", word[i], word[j], word[k], word[l], word[m]);
					}
				}
			}
		}
	}
	}
	
	if (tag == 6) {
	for (i = 0; i <= 5; i++){
		for (j = 0; j <= 5; j++){
			for (k = 0; k <= 5; k++){
				for (l = 0; l <= 5; l++){
					for (m = 0; m <= 5; m++){
						for (n = 0; n <= 5; n++){
							if (rvd6(i,j,k,l,m,n) != 0)
								printf("grep -c \'%c%c%c%c%c%c\' 6letlist.txt >> jmbtmptile \n", word[i], word[j], word[k], word[l], word[m], word[n]);
						}
					}
				}
			}
		}
	}
	}
	
	printf("grep -c \'1\' jmbtmpfile \n");

}

int rvd5(int a, int b, int c, int d, int e)

{

	int ans = 1;
	
	if (a == b)
		ans = 0;
	if (a == c)
		ans = 0;
	if (a == d)
		ans = 0;
	if (a == e)
		ans = 0;
	if (b == c)
		ans = 0;
	if (b == d)
		ans = 0;
	if (b == e)
		ans = 0;
	if (c == d)
		ans = 0;
	if (c == e)
		ans = 0;
	if (d == e)
		ans = 0;
		
	return(ans);
	
}

int rvd6(int a, int b, int c, int d, int e, int f)

{

	int ans = 1;
	
	if (a == b)
		ans = 0;
	if (a == c)
		ans = 0;
	if (a == d)
		ans = 0;
	if (a == e)
		ans = 0;
	if (a == f)
		ans = 0;
	if (b == c)
		ans = 0;
	if (b == d)
		ans = 0;
	if (b == e)
		ans = 0;
	if (b == f)
		ans = 0;
	if (c == d)
		ans = 0;
	if (c == e)
		ans = 0;
	if (c == f)
		ans = 0;
	if (d == e)
		ans = 0;
	if (d == f)
		ans = 0;
	if (e == f)
		ans = 0;
		
	return(ans);
	
}

[Kuciwalker]

We wrote that program correctly in my sophomore year of HS

[KrazyHorse]

I'm a ****ty programmer

[Kuciwalker]

I remember writing a variant that cheated on Text Twist

[KrazyHorse]

Mine was originally written to cheat on the jumble in the paper. That's why it's roundabout. I already had something written. And that's why it's called jmb2.c and jmb2.sh...

[KrazyHorse]

It took ~5 minutes to adapt to this purpose...and I wanted practice scripting in bash...

[Kuciwalker]

You're probably better than I am a bash scripting. I just use linux for Matlab and C.

[KrazyHorse]

So, how's your probability class going?

[KrazyHorse]

Originally posted by Kuciwalker
You're probably better than I am a bash scripting. I just use linux for Matlab and C.

I wrote my first bash script two days ago