Anagram generator: Difference between revisions

Line 86:

downstate loci

edison walcott</lang>

=={{header|Phix}}==

Couldn't really think of a better way than just building a dirty great filter list to get rid of the less interesting answers....

with javascript_semantics

constant bo_ring = {"al","alex","am","an","and","anent","ann","ant","ar","ares","art","at","ax","axle",

"dan","dar","darn","dart","de","den","dent","dna","drag","du","dun","dunn",

"ed","edt","eh","el","em","en","end","eng","erg","eros","est","et","eta","ex",

"ga","gad","gar","garth","ge","ghent","gnat","gnu","grad","gu","ha","had","han",

"hand","hart","hat","he","hut","la","lam","lao","lax","lee","leo","lo","lot",

"ma","max","mao","mo","moe","mel","met","mt","nat","nd","ne","ned","nh","nne","nu",

"opel","opt","ott","ox","pa","pax","pee","pl","pm","po","poe","rag","ran","rand",

"rant","rat","rd","re","red","ret","rna","ruth","sa","sat","se","sort","st",

"ta","tad","tag","tam","tamp","tao","taos","tan","tang","tangent","tanh",

"tar","tat","tater","tau","tax","ted","tel","ten","tenant","tent","tern",

"than","that","the","then","tn","tnt","to","top","tor","tort","tot","trag",

"tsar","tun","tuna","tung","tx","un","ut","wa"}

function az(string word) return min(word)>='a' and max(word)<='z' and not find(word,bo_ring) end function

sequence words = filter(unix_dict(),az),

wdsaz = sort(columnize({apply(words,sort),tagset(length(words))}))

sequence seen = {}

procedure test(string w, sequence found={})

if found={} then

seen = {}

printf(1,"%s:\n",{w})

w = sort(lower(w))

end if

for i=abs(binary_search({w[1..1],0},wdsaz)) to length(wdsaz) do

{string ax, integer wdx} = wdsaz[i]

if ax[1]!=w[1] then exit end if

sequence e = tagset(length(w))

e[1] = 0

integer j = 2

for k=2 to length(ax) do

while j<length(w) and ax[k]>w[j] do j += 1 end while

if j>length(w) or ax[k]!=w[j] then exit end if

e[j] = 0

j += 1

if k=length(ax) then

string aw = words[wdx]

e = filter(e,"!=",0)

if length(e)=0 then

if length(found) then

sequence f = append(deep_copy(found),aw),

sf = sort(deep_copy(f))

if not find(sf,seen) then

seen = append(seen,sf)

printf(1," %s\n",{join(f,", ")})

end if

else

test(extract(w,e),append(deep_copy(found),aw))

end if

end for

end procedure

papply({"Rosetta", "PureFox","PeteLomax","Wherrera","Thundergnat"},test)

<pre>

Rosetta:

treat, so

sea, trot

east, rot

seat, rot

state, or

taste, or

oar, test

oat, rest

star, toe

as, otter

PureFox:

peru, fox

pure, fox

rex, of, up

PeteLomax:

exalt, poem

latex, poem

apex, motel

axe, elm, pot

axe, let, mop

axe, me, plot

atom, expel

moat, expel

Wherrera:

rare, wehr

rear, wehr

ware, herr

wear, herr

Thundergnat:

ad, tenth, rung

dragnet, hunt

dang, net, hurt

hard, gent, nut

gannett, hurd

agent, dr, hunt

hang, tend, rut

nag, tend, hurt

nag, thud, rent

rang, thud, net

ah, tend, grunt

ah, dr, gent, nut

haunt, dr, gent

tart, dung, hen

</pre>

=={{header|Raku}}==