Yep, I know now, they are not acronyms. --Paddy3118 20:34, 24 September 2008 (UTC)

Do you want to call them "anagrams" instead? --DanBron 18:04, 25 September 2008 (UTC)

That's it! Of course they are. I must have had a brain seizure!! --Paddy3118 20:51, 25 September 2008 (UTC)

Local word list

Could an administrator make a local copy of the wordlist? --Paddy3118 05:37, 2 October 2008 (UTC)

Where to read wordlist from?

The Haskell and J versions assumes a local copy of the file, while the other two examples so far open the URL directly. What is the intention behind the task?

I would consider opening the URL directly an unnecessary complication: Not every language allows easy access to the internet, but the rest of the task is basically algorithmic, and therefore easily accessible to any language. If the internet access is indeed intended to be part of the task, I propose splitting this task into two separate ones:

  1. read a file from the web
  2. find most words of equal characters based on a file of words

That would IMHO be better, because it's more modular. --Ce 16:35, 2 October 2008 (UTC)

"Read a file from the web" already has a task made for it. Either way, I also think getting rid of the web file requirement is a good idea. --Mwn3d 16:54, 2 October 2008 (UTC)
I think that programs should not be prohibited from getting the list from a local file, a web resource, or even a previously defined variable — the point is the algorithm, not the means of getting the input data (which should be chosen to best fit the language). I also think having a specific word list list adds concreteness of the task, and a common test data set — but it should not be interpreted as a requirement to download that list at the time of execution. --Kevin Reid 19:14, 2 October 2008 (UTC)
Return to "Anagrams" page.