Description:
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search engines are designed and optimized for simple human queries. As a result, these applications are forced to issue millions of successive queries, resulting in unnecessary search engine load and in slow applications with limited scalability. Michael Cafarella, a graduate student of computer science at the University of Washington, discusses the Bindings Engine (BE), which supports queries that contain typed variables and string-processing functions and explains just why BE is better-suited to the needs of natural language applications.
Speaker(s):
Michael Cafarella, graduate student, Computer Science, University of Washington
|
