Weakly Supervised, Data-Driven Acquisition of Rules for Open Information Extraction
| Titre | Weakly Supervised, Data-Driven Acquisition of Rules for Open Information Extraction |
| Type de publication | Conference Proceedings |
| Année de publication | 2019 |
| Auteurs | Gotti, F., and P. Langlais |
| Nom de la conférence | 32nd Canadian Conference on Artificial Intelligence |
| Pagination | 16--28 |
| Date Published | 06/2019 |
| Éditeur | Springer |
| ISBN | 978-3-030-18305-9 |
| Mots-clés | Natural language processing, Open information extraction, Weak Supervision |
| Résumé | We propose a way to acquire rules for Open Information Extraction, based on lemma sequence patterns (including potential ty- pographical symbols) linking two named entities in a sentence. Rule acquisition is data-driven and requires little supervision. Given an arbitrary relation, we identify, in a large corpus, pairs of entities that are linked by the relation and then gather, score and rank other phrases that link the same entity pairs. We experimented with 81 relations and acquired 20 extraction rules for each by mining ClueWeb12. We devised a semi- automatic evaluation protocol to measure recall and precision and found them to be at most 79.9% and 62.4% respectively. Verbal patterns are of better quality than non-verbal ones, although the latter achieve a maximum recall of 76.5%. The strategy proposed does not necessitate expensive resources or time-consuming handcrafted resources, but does require a large amount of text. |
| Notes | Dataset available here : http://rali.iro.umontreal.ca/rali/sites/default/files/resources/misc/oie-paraphrase-rules.txt |
| URL | https://link.springer.com/chapter/10.1007/978-3-030-18305-9_2 |
| DOI | 10.1007/978-3-030-18305-9_2 |
| Refereed Designation | Refereed |
PDF:
