Haoruo Peng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haoruo Peng has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dan Roth
University of Pennsylvania
4 shared publications - Qiang Ning
Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign
2 shared publications Ben Zhou
University of Illinois at Urbana-Champaign 61801 Urbana IL USA
1 shared publication- Daniel Khashabi
University of Illinois Urbana-Champaign Urbana 61801 IL
1 shared publication - Zhili Feng
University of Wisconsin-Madison 53706 Madison WI USA
1 shared publication
Latest Publications
- Open Access
Solving Hard Coreference Problems
Coreference resolution is a key problem in natural language understanding that still escapes reliable solutions. One fundamental difficulty has been that of resolving instances involving pronouns since they often require deep language understanding and use of background knowledge. In this paper, we propose an algorithmic solution that involves a new representation for the knowledge required to address hard coreference problems, along with a constrained optimization framework that uses this knowledge in coreference decision making. Our representation, Predicate Schemas, is instantiated with knowledge acquired in an unsupervised way, and is compiled automatically into constraints that impact the coreference decision. We present a general coreference resolution system that significantly improves state-of-the-art performance on hard, Winograd-style, pronoun resolution cases, while still performing at the state-of-the-art level on standard coreference resolution datasets.
Open AccessSolving Hard Coreference Problems
Coreference resolution is a key problem in natural language understanding that still escapes reliable solutions. One fundamental difficulty has been that of resolving instances involving pronouns since they often require deep language understanding and use of background knowledge. In this paper, we propose an algorithmic solution that involves a new representation for the knowledge required to address hard coreference problems, along with a constrained optimization framework that uses this knowledge in coreference decision making. Our representation, Predicate Schemas, is instantiated with knowledge acquired in an unsupervised way, and is compiled automatically into constraints that impact the coreference decision. We present a general coreference resolution system that significantly improves state-of-the-art performance on hard, Winograd-style, pronoun resolution cases, while still performing at the state-of-the-art level on standard coreference resolution datasets.
- Open Access
CogCompTime: A Tool for Understanding Time in Natural Language Text
Automatic extraction of temporal information in text is an important component of natural language understanding. It involves two basic tasks: (1) Understanding time expressions that are mentioned explicitly in text (e.g., February 27, 1998 or tomorrow), and (2) Understanding temporal information that is conveyed implicitly via relations. In this paper, we introduce CogCompTime, a system that has these two important functionalities. It incorporates the most recent progress, achieves state-of-the-art performance, and is publicly available.1 We believe that this demo will be useful for multiple time-aware applications and provide valuable insight for future research in temporal understanding.
Open AccessCogCompTime: A Tool for Understanding Time in Natural Language Text
Automatic extraction of temporal information in text is an important component of natural language understanding. It involves two basic tasks: (1) Understanding time expressions that are mentioned explicitly in text (e.g., February 27, 1998 or tomorrow), and (2) Understanding temporal information that is conveyed implicitly via relations. In this paper, we introduce CogCompTime, a system that has these two important functionalities. It incorporates the most recent progress, achieves state-of-the-art performance, and is publicly available.1 We believe that this demo will be useful for multiple time-aware applications and provide valuable insight for future research in temporal understanding.
- Open Access
- 1 January 2019
- Published by Association for Computational Linguistics (ACL)
- p. 550-562
KnowSemLM: A Knowledge Infused Semantic Language Model
Haoruo Peng, Qiang Ning, Dan Roth. Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL). 2019.
- 1 January 2019
- Published by Association for Computational Linguistics (ACL)
- p. 550-562
Open AccessKnowSemLM: A Knowledge Infused Semantic Language Model
Haoruo Peng, Qiang Ning, Dan Roth. Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL). 2019.
- Open Access
Two Discourse Driven Language Models for Semantics
Natural language understanding often requires deep semantic knowledge. Expanding on previous proposals, we suggest that some important aspects of semantic knowledge can be modeled as a language model if done at an appropriate level of abstraction. We develop two distinct models that capture semantic frame chains and discourse information while abstracting over the specific mentions of predicates and entities. For each model, we investigate four implementations: a "standard" N-gram language model and three discriminatively trained "neural" language models that generate embeddings for semantic frames. The quality of the semantic language models (SemLM) is evaluated both intrinsically, using perplexity and a narrative cloze test and extrinsically - we show that our SemLM helps improve performance on semantic natural language processing tasks such as co-reference resolution and discourse parsing.
Open AccessTwo Discourse Driven Language Models for Semantics
Natural language understanding often requires deep semantic knowledge. Expanding on previous proposals, we suggest that some important aspects of semantic knowledge can be modeled as a language model if done at an appropriate level of abstraction. We develop two distinct models that capture semantic frame chains and discourse information while abstracting over the specific mentions of predicates and entities. For each model, we investigate four implementations: a "standard" N-gram language model and three discriminatively trained "neural" language models that generate embeddings for semantic frames. The quality of the semantic language models (SemLM) is evaluated both intrinsically, using perplexity and a narrative cloze test and extrinsically - we show that our SemLM helps improve performance on semantic natural language processing tasks such as co-reference resolution and discourse parsing.