Papers with Code 아카이브
Constituency Parsing
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 1
- 평가표
- 4
- 보존된 평가 기록
- 40
Constituency parsing aims to extract a constituency-based parse tree from a sentence that represents its syntactic structure according to a phrase structure grammar.
Example:
Sentence (S)
|
+-------------+------------+
| |
Noun (N) Verb Phrase (VP)
| |
John +-------+--------+
| |
Verb (V) Noun (N)
| |
sees Bill
Recent approaches convert the parse tree into a sequence following a depth-first traversal in order to be able to apply sequence-to-sequence models to it. The linearized version of the above parse tree looks as follows: (S (N) (VP V N)).
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Effective Inference for Generative Neural Parsing
Gradient-based Inference for Networks with Output Constraints
In-Order Transition-based Constituent Parsing
Parsing with Traces: An $O(n^4)$ Algorithm and a Structural Representation
Improving Neural Parsing by Disentangling Model Combination and Reranking Effects
YellowFin and the Art of Momentum Tuning
Attention Is All You Need
A Minimal Span-Based Neural Constituency Parser
Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles
What Do Recurrent Neural Network Grammars Learn About Syntax?
Incremental Parsing with Minimal Features Using Bi-Directional LSTM
Recurrent Neural Network Grammars
Statistical Parsing by Machine Learning from a Classical Arabic Treebank
Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks
Grammar as a Foreign Language
Effective Self-Training for Parsing
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.