Learning Information Extraction Rules for Semi-Structured and Free Text
Citations
1,699Â citations
1,628Â citations
1,574Â citations
1,326Â citations
Cites background from "Learning Information Extraction Rul..."
...Typically, Information Extraction (IE) systems learn an extractor for each target relation from labeled training examples (Kim and Moldovan, 1993; Riloff, 1996; Soderland, 1999)....
[...]
1,201Â citations
References
21,694Â citations
21,674Â citations
"Learning Information Extraction Rul..." refers background or methods in this paper
...Top-down rule induction (Cohen, 1996) and top-down decision tree induction ( Quinlan, 1993; Breiman et al., 1984) assume that an empty rule covers all possible instances and that adding a term or test reduces the coverage of a rule monotonically....
[...]
...This is a key assumption in top-down decision tree induction such as C4.5 ( Quinlan, 1993 ) and CART (Breiman et al., 1984) and in the RIPPER rule induction system (Cohen, 1996)....
[...]
14,825Â citations
5,311Â citations
"Learning Information Extraction Rul..." refers background or methods in this paper
...An informal analogy to PAC analysis may be used (Valiant, 1984)....
[...]
...This section begins by discussing rules to handle structured and semi-structured text, then introduce extensions that handle free text....
[...]
2,226Â citations
"Learning Information Extraction Rul..." refers background or result in this paper
...The amount of hand tagging required can be greatly reduced throughselective sampling, a form of active learning (Cohn, Atlas, & Ladner, 1994; Lewis & Gale, 1994; Dagan & Engelson, 1996)....
[...]
...This is akin to the active learning paradigm (Cohn, Atlas, & Ladner, 1994; Lewis & Gale, 1994; Dagan & Engelson, 1996)....
[...]