Abstract
Semantic parsers critically rely on accurate and high-coverage lexicons. However, traditional semantic parsers usually utilize annotated logical forms to learn the lexicon, which often suffer from the lexicon coverage problem. In this paper, we propose a graph-based semi-supervised learning framework that makes use of large text corpora and lexical resources. This framework first constructs a graph with a phrase similarity model learned by utilizing many text corpora and lexical resources. Next, graph propagation algorithm identifies the label distribution of unlabeled phrases from labeled ones. We evaluate our approach on two benchmarks: Webquestions and Free917. The results show that, in both datasets, our method achieves substantial improvement when comparing to the base system that does not utilize the learned lexicon, and gains competitive results when comparing to state-of-the-art systems.- Anthology ID:
- C18-1076
- Volume:
- Proceedings of the 27th International Conference on Computational Linguistics
- Month:
- August
- Year:
- 2018
- Address:
- Santa Fe, New Mexico, USA
- Venue:
- COLING
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 892–904
- Language:
- URL:
- https://aclanthology.org/C18-1076
- DOI:
- Cite (ACL):
- Bo Chen, Bo An, Le Sun, and Xianpei Han. 2018. Semi-Supervised Lexicon Learning for Wide-Coverage Semantic Parsing. In Proceedings of the 27th International Conference on Computational Linguistics, pages 892–904, Santa Fe, New Mexico, USA. Association for Computational Linguistics.
- Cite (Informal):
- Semi-Supervised Lexicon Learning for Wide-Coverage Semantic Parsing (Chen et al., COLING 2018)
- PDF:
- https://preview.aclanthology.org/starsem-semeval-split/C18-1076.pdf
- Data
- Paralex