Sparse Information Extraction: Unsupervised Language Models to the Rescue

Even in a massive corpus such as the Web, a substantial fraction of extractions appear infrequently. This paper shows how to assess the correctness of sparse extractions by utilizing unsupervised language models. The REALM system, which combines HMMbased and n-gram-based language models, ranks candidate extractions by the likelihood that they are correct. Our experiments show that REALM reduces extraction error by 39%, on average, when compared with previous work. Because REALM pre-computes language models based on its corpus and does not require any hand-tagged seeds, it is far more scalable than approaches that learn models for each individual relation from handtagged data. Thus, REALM is ideally suited for open information extraction where the relations of interest are not specified in advance and their number is potentially vast.

• Type: Conference
• Year: 2007
• Where: ACL
• Authors: Doug Downey, Stefan Schoenmackers, Oren Etzioni
• Keywords: ACL 2007, Computational Linguistics, Language Models, REALM, Unsupervised Language Models