Generative Constituent Parsing and Discriminative Dependency Reranking: Experiments on English and French
Code (0)
등록된 구현이 없습니다.
Tasks
RerankingSimilar Papers 제목 키워드 기반
Efficient Stacked Dependency Parsing by Forest Reranking
This paper proposes a discriminative forest reranking algorithm for dependency parsing that can be seen as a form of efficient stacked parsing. A dynamic programming shift-reduce parser produces a packed derivation fores…
ARCDependency ParsingRerankingNeural Reranking for Dependency Parsing: An Evaluation
Recent work has shown that neural rerankers can improve results for dependency parsing over the top k trees produced by a base parser. However, all neural rerankers so far have been evaluated on English and Chinese only,…
Dependency ParsingRerankingIn-Order Transition-based Constituent Parsing
Both bottom-up and top-down strategies have been used for neural transition-based constituent parsing. The parsing strategies differ in terms of the order in which they recognize productions in the derivation tree, where…
RerankingA Survey of Syntactic-Semantic Parsing Based on Constituent and Dependency Structures
Syntactic and semantic parsing has been investigated for decades, which is one primary topic in the natural language processing community. This article aims for a brief survey on this topic. The parsing community include…
Dependency ParsingSemantic ParsingConcurrent Parsing of Constituency and Dependency
Constituent and dependency representation for syntactic structure share a lot of linguistic and computational characteristics, this paper thus makes the first attempt by introducing a new model that is capable of parsing…
Dependency Parsing