Monday, September 21, 2009

Programmatically Solving Anagrams

In this reading by Hofstadter, he talks about the process by which humans decipher anagrams and recognize words and connects it to a program he wrote in LISP to decipher these decipher these anagrams. Even though he attempts to break down the process by which the human brain, more specifically, he himself turns a group of letters such as TARFD (the example given in one of the illustrations) into a recognizable word, it seems like a rather ambiguous task to write a program to simulate the human mind in this process. This is mostly because there is no real process someone can pinpoint as to how the mind does this.

There are many ideas about different parts of the process of solving an anagram, but I do not believe there is any way Hofstadter or anyone else can pinpoint one specific process as to how it is done. I believe this is because much of this process is done subconsciously and kind of "just happens". Similar to how Hofstadter explains how we recognize the word nights using segments like "ght" and "s". While this may possibly be true, this process seems to be done too much on a subconscious level to truly say concretely that this is how it is done.

Relating back to the program to solve these anagrams, while it is obviously that it can be done, it does not really resemble how the human mind solves an anagram. It is merely just a series of processes that use complex mathematical algorithms to systematically find an answer. The closest way one of these can resemble the human mind, I believe, is merely just taking different ideas of how the mind may go about this process and bunching them all together in a trial and error fashion.

No comments:

Post a Comment