Anagram generator: Difference between revisions

Line 34:

Implementation:

<~~lang~~ J>anagen=: {{

<syntaxhighlight lang=J>anagen=: {{

seed=. (tolower y)([-.-.)a.{~97+i.26

letters=. ~.seed

Line 55:

end.

EMPTY

}}</~~lang~~>

}}</syntaxhighlight>

Conceptually, we're working with a graph here -- given a seed word, we have sequence of letters and a count of each of those letters which we must supply. Given a list of words whose letters do not exceed that count, we extend that list with an additional word, discarding word sequences which go over the letter count. We would repeat as necessary until we satisfy the needed letter counts. Also, we inspect the "final result" and remove our seed word or phrase from it (if it was present -- and if that would have been our only result we would extend our under budget word sequences until they satisfy our letter counts). It seems like two words is usually sufficient here.

Line 65:

Examples:

<~~lang~~ J> 'unixdict.txt' anagen 'Rosettacode'

<syntaxhighlight lang=J> 'unixdict.txt' anagen 'Rosettacode'

cetera stood

coat oersted

Line 135:

piazza trim type

piety pizza tram

pizza pyrite tam</~~lang~~>

pizza pyrite tam</syntaxhighlight>

=={{header|Julia}}==

<~~lang~~ ruby>const unixwords = split(read("unixdict.txt", String) |> lowercase, r"\s+")

<syntaxhighlight lang=ruby>const unixwords = split(read("unixdict.txt", String) |> lowercase, r"\s+")

function findphrases(anastring::AbstractString, choices, sizelong = 4, n_shortpermitted = 1)

Line 175:

foreach(println, findphrases(s, unixwords, 4, 0) |> unique |> sort!)

end

</~~lang~~>{{out}}

</syntaxhighlight>{{out}}

<pre>

From 'Rosetta code':

Line 210:

=={{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",

Line 266:

end procedure

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

<pre>

Line 318:

Using the unixdict.txt word file by default.

<~~lang~~ perl6>unit sub MAIN ($in is copy = '', :$dict = 'unixdict.txt');

<syntaxhighlight lang=perl6>unit sub MAIN ($in is copy = '', :$dict = 'unixdict.txt');

say 'Enter a word or phrase to be anagramed. (Loading dictionary)' unless $in.chars;

Line 357:

}

}</~~lang~~>

}</syntaxhighlight>

{{out|Truncated to only show the best few as subjectively determined by me}}

''Punctuation, capitalization and (in some cases) word order manually massaged.''

Line 382:

Alternatives formed by simply changing the order of the two words have been suppressed.

<~~lang~~ ecmascript>import "io" for File

<syntaxhighlight lang=ecmascript>import "io" for File

import "./str" for Str, Char

import "./perm" for Comb

Line 445:

System.print("\n%(tests[i]):")

anagramGenerator.call(tests[i])

}</~~lang~~>

}</syntaxhighlight>