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)).
코드
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
https://github.com/paolanu/BERT_epitope
https://github.com/parcorelab/comscribe
https://github.com/patrickhart/jaxdl
https://github.com/paulskeie/stadnamn
https://github.com/pengming617/bert_classification
https://github.com/pengshuyuan/Bert
https://github.com/penny9287/sockeye
https://github.com/pennylaneai/generative-quantum-states
https://github.com/phohenecker/pytorch-transformer
https://github.com/pingheng001/Cnn-Bert
https://github.com/piquil/rydberggpt
https://github.com/plkmo/Transformer-Eng2French
https://github.com/pomonam/AttentionCluster
https://github.com/prabhupad26/100daysofML
https://github.com/pritam1322/Machine-Translation-with-Transformer
https://github.com/prithviraj-maurya/alexa-point-of-view-dataset
Converting the Point of View of Messages Spoken to Virtual Assistants
https://github.com/pwc-1/Paper-9/tree/main/4/Translation-Invariant/model
https://github.com/radoslawkrolikowski/sentiment-analysis-pytorch
https://github.com/rajlm10/Chandler
https://github.com/ramanakshay/transformer
https://github.com/rasbot/plot-bot
https://github.com/re-search/DocProduct
https://github.com/reactive-systems/circuit-repair
https://github.com/reactive-systems/ml2
https://github.com/redevaaa/Transformer-for-EEG
https://github.com/reppy4620/Dialog
https://github.com/rgalhama/diora
Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoders
https://github.com/ricardordb/bert
https://github.com/richard-peng-xia/Chinese-Noisy-Text
https://github.com/richard88888/chinese-noisy-text
https://github.com/rickyHong/Google-BERT-repl
https://github.com/ricsinaruto/NeuralChatbots-DataFiltering
https://github.com/ricsinaruto/dialog-eval
https://github.com/rishavbhurtel/sentiment-classifier
https://github.com/rohan400/PepperQA
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.