<br><div class="gmail_quote">On Mon, Jun 1, 2009 at 7:04 AM, Shriram Krishnamurthi <span dir="ltr"><<a href="mailto:sk@cs.brown.edu">sk@cs.brown.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
I agree with Eli (who knows more about this topic than we might imagine).<br>
<br>
It is very difficult to make these kinds of NL parsers scale to any<br>
complexity, and moreover, the kinds that do (those used in real<br>
software today) use a very different approach, so it's not like<br>
there's a smooth continuum from here to there. It would actually be<br>
somewhat misleading to show this and suggest that this is how real NL<br>
parsers work, just with more of the same.<br>
<font color="#888888"></font></blockquote><div><br>Shriram, <br><br>The AI books that I had read before took the parsing approach, so I am not familiar with the alternative - would you happen to have links or googling phrases for finding the alternatives?<br>
<br>Thanks,<br>yc<br><br></div></div><br>