--- Gary Shannon <fiziwig@...> wrote:
<snip>
>
> The interesting implication of all this is that if
> true, it should be possible to do complete parsing
> of
> any arbitrary natural language sentence with a
> process
> not much more sophisticated than the
> search-and-replace function of an ordinary word
> processor program, using a set of template matching
> patterns. In fact, that sounds like an interesting
> project to attempt!
>
> --gary
>
Just for fun...
"Parsing by Search and Replace" project begun at
http://fiziwig.com/parser/parse1.html
It will be interesting to see if it's actually
possible to write a robust computerized parsing
program in this manner.
--gary