Difference between revisions of "Pattern Learning"
From Knowitall
(→Reducing the lemma grep results) |
(→Determining target extractions) |
||
| Line 7: | Line 7: | ||
== Determining target extractions == | == Determining target extractions == | ||
| + | # Start with the clean, chunked dataset of ReVerb extractions from ClueWeb. | ||
| + | # Apply Jonathan Berant's relation string normalization. | ||
| + | # Filter relations so each relation's normalized relation string matches a target relation and the arguments only contain DT, NNP, and NNPS. | ||
# Measure the occurrence of the arguments | # Measure the occurrence of the arguments | ||
# Keep extractions from the target relations that have arguments that occur commonly (100) | # Keep extractions from the target relations that have arguments that occur commonly (100) | ||
Revision as of 00:05, 25 October 2011
Contents
Building the boostrapping data
Determining target relations
- Restrict high quality set of ClueWeb extractions to have proper noun arguments
- Choose the most frequent relations from this set
Determining target extractions
- Start with the clean, chunked dataset of ReVerb extractions from ClueWeb.
- Apply Jonathan Berant's relation string normalization.
- Filter relations so each relation's normalized relation string matches a target relation and the arguments only contain DT, NNP, and NNPS.
- Measure the occurrence of the arguments
- Keep extractions from the target relations that have arguments that occur commonly (100)
Reducing the lemma grep results
- Remove patterns that occur less than 5 times.
- Remove duplicate sentences.
- Remove extractions that have an (extraction, pattern) pairs that occurs anomalously frequently.
- There was a single one: (hotel reservation, be make, online) ocurred 32k times, the next one ocurred 8k times
