Stanford's Distantly Supervised Slot Filling Systems for KBP 2014
Explore this paper's citation graph
Summary
This paper describes Stanford’s entry in the TACKBP 2014 Slot Filling challenge, and evaluates the impact of learned and hard-coded patterns on performance for slot filling, and theimpact of the partial annotations described in Angeli et al. (2014).
- Type
- article
- Published
- 2014-01-01
- Cited by
- 14
- References
- 21
- OpenAlex
- https://openalex.org/W2187647469
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:14283266
Keywords
Relation (database), Computer science, Filling-in, Artificial intelligence, Data mining
References
- Multi-instance Multi-label Learning for Relation Extraction
- DeepDive: Web-scale Knowledge-base Construction using Statistical Learning and Inference
- Feature Engineering for Knowledge Base Construction
- Employing EM and Pool-Based Active Learning for Text Classification
- DimmWitted: A Study of Main-Memory Statistical Analytics
- Active Sampling for Class Probability Estimation and Ranking
- Markov logic networks
- A Machine Reading System for Assembling Synthetic Paleontological Databases
- Automatic Acquisition of Hyponyms from Large Text Corpora
- GeoDeepDive: statistical inference using familiar data-processing languages
- Towards high-throughput gibbs sampling at scale: a study across storage managers
- Distant supervision for relation extraction without labeled data
- The Stanford CoreNLP Natural Language Processing Toolkit
- Learning 5000 Relational Extractors
- Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS
- Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
- Improved Pattern Learning for Bootstrapped Entity Extraction
- Combining Distant and Partial Supervision for Relation Extraction
- Snowball sampling
- Active Sampling for Class Probability Estimation and Ranking
Cited by
- Data mining for building knowledge bases: techniques, architectures and applications
- Web relation extraction with distant supervision
- Building Structured Databases of Factual Knowledge from Massive Text Corpora
- Probabilistic Inference for Cold Start Knowledge Base Population with Prior World Knowledge
- Position-aware Attention and Supervised Data Improve Slot Filling
- Impact of Coreference Resolution on Slot Filling
- Open Relation Extraction and Grounding
- Extracting Multilingual Relations under Limited Resources: TAC 2016 Cold-Start KB construction and Slot-Filling using Compositional Universal Schema
- Creating Robust Relation Extract and Anomaly Detect via Probabilistic Logic-Based Reasoning and Learning
- TruePIE: Discovering Reliable Patterns in Pattern-Based Information Extraction
- Semgrex and Ssurgeon, Searching and Manipulating Dependency Graphs
- Research Statement Thesis Research
- ROBUST DEEP SEMANTICS FOR LANGUAGE UNDERSTANDING LELAND STANFORD UNIVERSITY JUNE 2018 FINAL TECHNICAL REPORT APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED
- Unsupervised graph-based relation extraction and validation for knowledge base population
Related papers
No related papers recorded.