| Challenge: | Head-driven phrase structure grammars have a uniform formalism representing rich contextual syntactic and even semantic meanings. |
| Approach: | They propose to integrate constituent and dependency formal representations into head-driven phrase structure. |
| Outcome: | The proposed parser achieves state-of-the-art performance on Penn Treebank and Chinese Penn TreeBank. |
Similar Papers
Extracting Headless MWEs from Dependency Parse Trees: Parsing, Tagging, and Joint Modeling Approaches (2020.acl-main)
Copied to clipboard
| Challenge: | Headless multi-word expressions are frequent in natural language but lack internal syntactic dominance relations. |
| Approach: | They propose an efficient joint decoding algorithm that combines scores from both strategies. |
| Outcome: | The proposed algorithm combines scores from parsing and tagging for predicting flat MWEs . the proposed algorithm is more accurate than parse and more efficient for non-BERT features . |
Recognizing Sentence-level Logical Document Structures with the Help of Context-free Grammars (2020.lrec-1)
Copied to clipboard
| Challenge: | Current sentence boundary detectors split documents into sequentially ordered sentences without their dependencies. |
| Approach: | They propose a tool that segments sentences into tree structures to detect recursive structure . they retrain different constituency parsers to transform them into sentence segmenters . |
| Outcome: | The proposed tool can detect recursive structure in documents with a main clause and subordinate clauses . the proposed tool improves German dependency parsing by providing additional structural information. |
Revisiting Supertagging for faster HPSG parsing (2024.emnlp-main)
Copied to clipboard
| Challenge: | a new supertagger for HPSG-based treebanks is used to improve parsing speed and accuracy. |
| Approach: | They propose to integrate the best supertagger into an HPSG-based parser and compare it to an existing system. |
| Outcome: | The proposed system achieves 97.26% accuracy on 950 sentences from WSJ23 and 93.88% on the out-of-domain technical essay The Cathedral and the Bazaar. |
Structural Supervision for Word Alignment and Machine Translation (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge on syntactic structure neglects the rich structural information from target tokens and the structural similarity between the source and target sentences. |
| Approach: | They propose to incorporate syntactic structure of both source and target tokens into the encoder-decoder framework, tightly correlating the internal logic of word alignment and machine translation for multi-task learning. |
| Outcome: | The proposed method outperforms baselines on four publicly available language pairs and consistently outperformed baselines in alignment accuracy and translation quality. |
Parsing All: Syntax and Semantics, Dependencies and Spans (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Syntactic and semantic structures are key linguistic contextual clues, but few studies have explored how they can be used to improve syntactical parsing. |
| Approach: | They propose a syntactic and semantic parsing model which integrates syntaktic information in the encoder of neural network and benefits from two representation formalisms in a uniform way. |
| Outcome: | The proposed model achieves state-of-the-art or competitive results on both span and dependency representations and on Penn Treebank. |
Span-based Hierarchical Semantic Parsing for Task-Oriented Dialog (D19-1)
Copied to clipboard
| Challenge: | Existing semantic parsers score intents and slots as labels of nesting nodes, but decode a valid tree globally. |
| Approach: | They propose a span-based semantic parser for parsing compositional utterances into Task Oriented Parse (TOP) the parsers score labels of the tree nodes covering each token span independently, but decode a valid tree globally. |
| Outcome: | The proposed parser outperforms previous methods on the TOP dataset in accuracy and training speed. |
Dependency parsing with structure preserving embeddings (2021.eacl-main)
Copied to clipboard
| Challenge: | Modern neural approaches to dependency parsing are trained to predict a tree structure by learning a contextual representation for tokens in a sentence and a head–dependent scoring function. |
| Approach: | They propose to combine a contextual representation for tokens and a head–dependent scoring function to learn interpretable representations by training a parser to explicitly preserve structural properties of a tree. |
| Outcome: | The proposed approach yields strong tree distance preservation and parsing performance on par with a competitive graph-based parser. |
Headed-Span-Based Projective Dependency Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing based on headed spans are available. |
| Approach: | They propose a method for projective dependency parsing based on headed spans. |
| Outcome: | The proposed method achieves state-of-the-art or competitive results on PTB, CTB, and UD Dependency parsing is an important task in natural language processing. |
Character-Level Chinese Dependency Parsing via Modeling Latent Intra-Word Structure (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing word-level dependency parsing methods in Chinese lack explicit word boundaries due to the lack of word boundaries. |
| Approach: | They propose to model latent internal structures within Chinese words by constrained Eisner algorithm . they propose to guarantee a single root for intra-word structures and establish inter-word dependencies . |
| Outcome: | The proposed model outperforms existing models on Chinese treebanks and shows that it can predict plausible intra-word structures. |
Parsing Headed Constituencies (2024.lrec-main)
Copied to clipboard
| Challenge: | Using constituency and dependency trees, syntactic representations are preferred for tasks such as nominal phrase extraction and identification of terminology. |
| Approach: | They propose a parsing technique that generates headed constituency trees which combine information typically contained in constituency and dependency trees. |
| Outcome: | The proposed method generates headed constituency trees with discontinuities and can generate constituency tree with discontinuity. |