Toward BestEffort Infomation Extraction向最好的努力的信息提取.pptVIP

下载本文档

4
0
约9.56千字
约 33页
2018-06-19 发布于福建
举报
版权申诉

Toward BestEffort Infomation Extraction向最好的努力的信息提取.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Toward BestEffort Infomation Extraction向最好的努力的信息提取

* * * * Tasks took 104, 351, and 107 seconds to run; iFlex running time is comparable to Perl extraction programs. iFlex is a best-effort information extraction program that can be use to quickly obtain approximate results. iFlex significantly reduces the developer time in creating information extraction programs. iFlex is efficient enough to run with comparable speed to Perl Simulated question patterns from the Next-Effort assistant outperforms the sequential pattern. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * by Warren Shen, Pedro DeRose, Robert McCann, AnHai Doan, and Raghu Ramakrishnan, SIGMOD08, June 2009, Vancouver, British Columbia, Canada, 2007, 1031-1042 Presented by Andrew Zitzelberger Many solutions exist for extracting structured data from raw data pages. But … Virtually all of these solutions focus on precise Information Extraction programs that output exact results Generally cannot execute a partially specified version of the program. Generally takes a long time (days or weeks) before obtaining the first meaningful results (partially due to the first limitation). Not acceptable for time sensitive applications Writing precise IE programs can be a waste of time in some instances. Given 500 pages find all houses which cost more than $500,000 and whose high school is Lincoln. Case 1: Define price as a numeric value and run the approximate program. 9 pages are returned containing a number greater than 500,000 and the word Lincoln. Search these 9 pages manually. Case 2: Instead 120 pages are returned. The program is underspecified so the Next-Effort assistant is consulted which asks if price tags are always bolded. After discovering they are, this is added to the specification, and this time 35 pages are returned. Allows the developer to quickly develop an approximate extraction program (Alog) The approximate program can then be run to quickly retrieve approximate results (Compact Tables) To improve results the developer can enlist the ai