File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.3115/v1/n15-1080
- Scopus: eid_2-s2.0-84960154992
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Transforming dependencies into phrase structures
Title | Transforming dependencies into phrase structures |
---|---|
Authors | |
Issue Date | 2015 |
Citation | 2015 Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Denver, Colorado, 31 May-5 June 2015. In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics, 2015, p. 788-798 How to Cite? |
Abstract | © 2015 Association for Computational Linguistics. We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees. We cast the problem as structured prediction and learn a statistical model. Our algorithm is faster than traditional phrasestructure parsing and achieves 90.4% English parsing accuracy and 82.4% Chinese parsing accuracy, near to the state of the art on both benchmarks. |
Persistent Identifier | http://hdl.handle.net/10722/296121 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kong, Lingpeng | - |
dc.contributor.author | Rush, Alexander M. | - |
dc.contributor.author | Smith, Noah A. | - |
dc.date.accessioned | 2021-02-11T04:52:52Z | - |
dc.date.available | 2021-02-11T04:52:52Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | 2015 Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Denver, Colorado, 31 May-5 June 2015. In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics, 2015, p. 788-798 | - |
dc.identifier.uri | http://hdl.handle.net/10722/296121 | - |
dc.description.abstract | © 2015 Association for Computational Linguistics. We present a new algorithm for transforming dependency parse trees into phrase-structure parse trees. We cast the problem as structured prediction and learn a statistical model. Our algorithm is faster than traditional phrasestructure parsing and achieves 90.4% English parsing accuracy and 82.4% Chinese parsing accuracy, near to the state of the art on both benchmarks. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.title | Transforming dependencies into phrase structures | - |
dc.type | Conference_Paper | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.3115/v1/n15-1080 | - |
dc.identifier.scopus | eid_2-s2.0-84960154992 | - |
dc.identifier.spage | 788 | - |
dc.identifier.epage | 798 | - |