https://github.com/DoodleJZ/HPSG-Neural-Parser
공식 코드Head-Driven Phrase Structure Grammar Parsing on Penn Treebank
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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)).
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Head-Driven Phrase Structure Grammar Parsing on Penn Treebank
Nested Named Entity Recognition with Partially-Observed TreeCRFs
Structural Optimization Ambiguity and Simplicity Bias in Unsupervised Neural Grammar Induction
Rethinking Self-Attention: Towards Interpretability in Neural Parsing
Co-training an Unsupervised Constituency Parser with Weak Supervision
Latent Tree Learning with Ordered Neurons: What Parses Does It Produce?
Converting the Point of View of Messages Spoken to Virtual Assistants
Augmenting Transformers with Recursively Composed Multi-grained Representations
Shift-Reduce Task-Oriented Semantic Parsing with Stack-Transformers
Grammar-Constrained Decoding for Structured NLP Tasks without Finetuning
Sketch-Guided Constrained Decoding for Boosting Blackbox Large Language Models without Logit Access
Structured Tree Alignment for Evaluation of (Speech) Constituency Parsing
Compound Probabilistic Context-Free Grammars for Grammar Induction
Court Judgement Labeling Using Topic Modeling and Syntactic Parsing
Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoders
Improved Latent Tree Induction with Distant Supervision via Span Constraints
Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles
LLM-enhanced Self-training for Cross-domain Constituency Parsing
Parsing with Traces: An $O(n^4)$ Algorithm and a Structural Representation
Improving Unsupervised Constituency Parsing via Maximizing Semantic Information
Unsupervised Learning of Syntactic Structure with Invertible Neural Projections
Generalizing Natural Language Analysis through Span-relation Representations
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.