[plt-scheme] Natural Language parsing in CS1

On Jun  2, Chung-chieh Shan wrote:
> 
> You seem to be drawing a distinction between two kinds of programs
> by examining how they are specified and tested.  I certainly agree
> with you that NLP has moved away from the "symbolic approach" to
> specifying and testing programs that process text.  The typical ACL
> paper doesn't revolve around a select few problematic examples
> anymore unless they are representative of many test cases.

Yes (to all that).


> However, that is not the same as saying, as you did earlier, that
> NLP has moved away from the "symbolic approach" to parsing (or more
> generally, processing) texts.  Symbols are alive and well inside
> modern NLP applications such as Babelfish, whether they are
> represented inside containers such as probability distributions (a
> functor and a monad, like all good containers are :).

Right -- I talked about the general approach.


> Shriram Krishnamurthi wrote:
> > [...]
> (I'm sure you'll have no trouble finding an email message that
> describes how programming languages are implemented nowadays and
> that someone who has read multiple PL books is left unprepared to
> understand.  Even if the message and the books are written in the
> same NL. :)

I think that a similar problem exists if someone reads the dragon book
(at least in the edition that I used) in an attempt to learn about
programming languages.

-- 
          ((lambda (x) (x x)) (lambda (x) (x x)))          Eli Barzilay:
                  http://www.barzilay.org/                 Maze is Life!