Papers with parsing
Cross-lingual Semantic Representation for NLP with UCCA (2020.coling-tutorials)
Copied to clipboard
| Challenge: | introductory tutorial to UCCA, a symbolic meaning representation for semantic representations. |
| Approach: | This tutorial introduces UCCA, a cross-linguistically applicable framework for semantic representation . it will provide a detailed introduction to the UCca annotation guidelines, design philosophy and available resources . |
| Outcome: | The tutorial will provide a detailed introduction to the UCCA framework and compare it to other meaning representations. |
Dependency Tree Annotation with Mechanical Turk (D19-59)
Copied to clipboard
| Challenge: | a recent study shows that crowdsourcing is often used to obtain linguistic annotations but is rarely used for parsing. |
| Approach: | They propose to use Mechanical Turk to crowdsource parse trees using an interactive graphical dependency tree editor. |
| Outcome: | The proposed method is the first published use of Mechanical Turk to crowdsource parse trees . the authors find that the workers achieve high levels of accuracy on 72% of the sentences . |
Graph-Based Meaning Representations: Design and Processing (P19-4)
Copied to clipboard
| Challenge: | This tutorial focuses on representing and processing sentence meaning in the form of labeled directed graphs. |
| Approach: | This tutorial will briefly review relevant background in formal and linguistic semantics . it will also briefly define a unified abstract view on different flavors of semantic graphs - and associated terminology . |
| Outcome: | The tutorial will briefly review relevant background in formal and linguistic semantics . |
Guiding AMR Parsing with Reverse Graph Linearization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsing aims to extract an abstract semantic graph from a sentence. |
| Approach: | They propose a new framework that allows for reversed linearization of AMR graphs . they propose to combine sequence-to-sequence approaches with a linearized graph . |
| Outcome: | The proposed framework outperforms the best AMR parser by 0.8 and 0.5 Smatch scores on the AMR 2.0 and AMR 3.0 datasets. |
MinerU2.5: A Decoupled Vision-Language Model for Efficient High-Resolution Document Parsing (2026.acl-industry)
Copied to clipboard
Junbo Niu, Zheng Liu, Zhuangcheng Gu, Bin Wang, Linke Ouyang, Zhiyuan Zhao, Tao Chu, Tianyao He, Fan Wu, Qintong Zhang, Zhenjiang Jin, Guang Liang, Rui Zhang, Wenzheng Zhang, Yuan Qu, Zhifei Ren, Yuefeng Sun, Zirui Tang, Boyu Niu, Yuanhong Zheng, Dongsheng Ma, Ziyang Miao, Hejun Dong, Siyi Qian, Junyuan Zhang, Fangdong Wang, Jingzhou Chen, Xiaomeng Zhao, Liqun Wei, Wei Li, Shasha Wang, RuiLiang Xu, Yuanyuan Cao, Lu Chen, Qianqian Wu, Huaiyu Gu, Lindong Lu, Dechen Lin, null Shenguanlin, Xuanhe Zhou, Linfeng Zhang, Yuhang Zang, Xiaoyi Dong, Jiaqi Wang, Bo Zhang, Lei Bai, Pei Chu, Weijia Li, Jiang Wu, Lijun Wu, Zhenxiang Li, Guangyu Wang, Zhongying Tu, Chao Xu, Kai Chen, Bowen Zhou, Dahua Lin, Wentao Zhang, Conghui He
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
BME-UW at SRST-2019: Surface realization with Interpreted Regular Tree Grammars (D19-63)
Copied to clipboard
| Challenge: | adaamko's system restores word order and inflection from a graph of typed, directed dependencies between lemmas. |
| Approach: | They propose a method that restores word order and inflection from a graph of typed, directed dependencies between lemmas. |
| Outcome: | The proposed system restores word order and inflection from a graph of typed, directed dependencies between lemmas. |
Beyond Multiword Expressions: Processing Idioms and Metaphors (P18-5)
Copied to clipboard
| Challenge: | idioms and metaphors processing is a rapidly growing area in NLP, says dr. s. robertson . idiomatic idiomas are characteristic to all areas of human activity and to all types of discourse. |
| Approach: | This tutorial will provide attendees with a clear notion of idioms and metaphors . it will provide them with computational models of linguistic characteristics and methods . |
| Outcome: | This tutorial aims to provide attendees with a clear notion of the linguistic characteristics of idioms and metaphors . it outlines how to model idiomatic idiomes and their processing and what resources are available to support their use . |
Parsing Speech: a Neural Approach to Integrating Lexical and Acoustic-Prosodic Information (N18-1)
Copied to clipboard
| Challenge: | acoustic signals provide cues that help listeners disambiguate difficult parses . speech carries useful extra information associated with prosodic structure . |
| Approach: | They propose a model that integrates transcribed text and acoustic-prosodic features into a neural network that accepts text and prosodic feature. |
| Outcome: | The proposed model improves parse and disfluency detection scores over a strong text-only baseline. |
Out-of-Domain Discourse Dependency Parsing via Bootstrapping: An Empirical Analysis on Its Effectiveness and Limitation (2022.tacl-1)
Copied to clipboard
| Challenge: | Discourse parsing accuracy degrades significantly on out-of-domain text. |
| Approach: | They propose to use bootstrapping methods to adapt modern discourse dependency parsers to out-of-domain text without additional human supervision. |
| Outcome: | The proposed methods are significantly and consistently effective for unsupervised domain adaptation of discourse dependency parsing, but the low coverage of accurately predicted pseudo labels is a bottleneck for further improvement. |
Entity Resolution and Location Disambiguation in the Ancient Hindu Temples Domain using Web Data (N18-5)
Copied to clipboard
| Challenge: | Existing systems for resolving entities and disambiguating locations based on publicly available web data are challenging because of the limited information available on the Web. |
| Approach: | They propose a system for resolving entities and disambiguating locations based on publicly available web data in the domain of ancient Hindu Temples. |
| Outcome: | The proposed system resolves entities and disambiguates locations with high confidence using grammar rules and clustering algorithms. |
Sprucing up the trees – Error detection in treebanks (C18-1)
Copied to clipboard
| Challenge: | a method for detecting annotation errors in manually annotated dependency trees is presented . the method is based on ensemble parsing and Bayesian inference guided by active learning . |
| Approach: | They propose a method for detecting annotation errors in manually annotated dependency parse trees . they use ensemble parsing in combination with Bayesian inference guided by active learning . |
| Outcome: | The proposed method detects errors in annotated dependency treebanks and improves parsing accuracy on in- and out-of-domain data. |
Generating Logical Forms from Graph Representations of Text and Entities (P19-1)
Copied to clipboard
| Challenge: | Recent approaches to semantic parsing have cast it as a sequence-to-sequence task, with strong results. |
| Approach: | They propose a Graph Neural Network architecture to incorporate information about relevant entities and their relations during parsing. |
| Outcome: | The proposed approach outperforms the state-of-the-art in several tasks without pre-training and outperformed existing approaches when combined with BERT pre-trainment. |
ListOps: A Diagnostic Dataset for Latent Tree Learning (N18-4)
Copied to clipboard
| Challenge: | Existing work on latent tree learning models shows they do not learn plausible grammars . a dataset is created to study the parsing ability of such models in natural language . |
| Approach: | They propose a toy dataset to study the parsing ability of latent tree learning models . they propose 'listops' toy that has a single correct parse strategy that a system needs to learn . |
| Outcome: | The proposed model outperforms existing models on sentence understanding tasks . it can learn grammars that conform to plausible semantics and syntactic formalisms . |
Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation (P19-1)
Copied to clipboard
| Challenge: | Existing methods for Combinatory Categorial Grammar (CCG) parsing are limited to a specific parser architecture, making it non-trivial to apply to current parsers. |
| Approach: | They propose a domain adaptation method for Combinatory Categorial Grammar (CCG) they propose to generate CCG corpora using cheaper dependency trees. |
| Outcome: | The proposed method improves on speech conversation and math problems. |
ReasonGraph: Visualization of Reasoning Methods and Extended Inference Paths (2025.acl-demo)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) reasoning processes are complex and lack of organized visualization tools creates barriers to understanding, evaluation, and improvement. |
| Approach: | They propose a web-based platform for visualizing and analyzing LLM reasoning processes. |
| Outcome: | The proposed platform shows high parsing reliability, efficient processing, and excellent usability across various downstream applications. |
Reforging : A Method for Constructing a Linguistically Valid Japanese CCG Treebank (2024.eacl-srw)
Copied to clipboard
| Challenge: | Existing treebanks for Combinatory Categorial Grammar (CCG) are insufficient for linguistic validity of CCG . |
| Approach: | They propose to combine ABCTreebank and lightblue to generate a linguistically valid Japanese CCG treebank with detailed information by filtering lightblu's lexical items using ABCTtreebank. |
| Outcome: | The proposed method generates a linguistically valid Japanese CCG treebank with detailed information by combining the strengths of ABCTreebank and lightblue. |
Holographic CCG Parsing (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for supertagging and parsing use black-box neural architectures to implicitly model phrase structure dependencies. |
| Approach: | They propose a method for formulating CCG as a recursive composition in a continuous vector space by using holographic embeddings as holography operator. |
| Outcome: | The proposed method can achieve comparable performance to state-of-the-art parsing with Transformers. |
From dictations to clinical reports using machine translation (N18-3)
Copied to clipboard
Gregory Finley, Wael Salloum, Najmeh Sadoughi, Erik Edwards, Amanda Robinson, Nico Axtmann, Michael Brenndoerfer, Mark Miller, David Suendermann-Oeft
| Challenge: | Medical dictation is one of the most common ways to document clinical encounters. |
| Approach: | They propose a machine callytranslation technique that automates post-processing tasks . they show that it outperforms conventional systems in correcting errors . |
| Outcome: | The proposed method outperforms conventional systems in many tasks while being much simpler to maintain. |
Supertagging the Long Tail with Tree-Structured Decoding of Complex Categories (2021.tacl-1)
Copied to clipboard
| Challenge: | Combinatory Categorial Grammar (CCG) parsers operate as a pipeline with a large search space of complex 'supertags' . |
| Approach: | They propose to use CCG supertags to generate CCG categories that have never been seen in training and to use tree-structured prediction to account for their internal structure. |
| Outcome: | The proposed model recovers a fraction of the long-tail supertags while approximating the state of the art in overall tag accuracy with fewer parameters. |
One Semantic Parser to Parse Them All: Sequence to Sequence Multi-Task Learning on Semantic Parsing Datasets (2021.starsem-1)
Copied to clipboard
| Challenge: | Existing semantic parsing datasets lack a single standard for meaning representations . lack of a standard led to the creation of plethora of datasets requiring expert annotators . |
| Approach: | They propose to use multi-task learning to unify different datasets and train a single model for them. |
| Outcome: | The proposed architectures yield better parsing accuracies and composition generalization than single-task models. |
Cross-lingual Parsing with Polyglot Training and Multi-treebank Learning: A Faroese Case Study (D19-61)
Copied to clipboard
| Challenge: | Cross-lingual dependency parsing involves transferring syntactic knowledge from one language to another. |
| Approach: | They compare two approaches to cross-lingual dependency parsing using monolingual source models and a polyglot model which is trained on the combination of all source languages. |
| Outcome: | The proposed methods improve low-resource dependency parsers by transferring syntactic knowledge from one language to another. |
Discontinuous Constituency Parsing with a Stack-Free Transition System and a Dynamic Oracle (N19-1)
Copied to clipboard
| Challenge: | Discontinuous constituency trees are derivations of Linear Context-Free Rewriting Systems (LCFRS), which makes them much harder to parse. |
| Approach: | They propose a transition system that uses a set of parsing items with constant-time random access instead of storing subtrees in a stack . |
| Outcome: | The proposed system constructs a discontinuous constituency tree in 4n–2 transitions for a sentence of length n. |
Towards General Natural Language Understanding with Probabilistic Worldbuilding (2022.tacl-1)
Copied to clipboard
| Challenge: | Probabilistic worldbuilding model is a Bayesian model of semantic parsing and reasoning . large-scale language models are domain-general, despite training on text from virtually every domain . |
| Approach: | They propose a Bayesian probabilistic worldbuilding model that parses and abduces sentences . they use a dataset to test their method against heuristics and to generate a probability model . |
| Outcome: | The proposed model outperforms baselines on two out-of-domain question-answering datasets. |
Growing Trees on Sounds: Assessing Strategies for End-to-End Dependency Parsing of Speech (2024.acl-short)
Copied to clipboard
| Challenge: | Direct dependency parsing of the speech signal is proposed as a way of incorporating prosodic information into the parser and bypassing the limitations of a pipeline approach. |
| Approach: | They propose to use graph-based parsing and sequence labeling based parses to integrate prosodic information into the parser and bypass limitations of pipeline approaches. |
| Outcome: | The proposed graph based approach outperforms a pipeline approach on a large treebank of spoken french, despite having 30% fewer parameters. |
Improving Top-K Decoding for Non-Autoregressive Semantic Parsing via Intent Conditioning (2022.coling-1)
Copied to clipboard
| Challenge: | Semantic parsing (SP) is a core component of modern virtual assistants like Google Assistant and Amazon Alexa. |
| Approach: | They propose a non-autoregressive (NAR) semantic parser that introduces intent conditioning on the decoder. |
| Outcome: | The proposed model reduces inference latency while maintaining competitive parsing quality. |
LIA: A Natural Language Programmable Personal Assistant (D18-2)
Copied to clipboard
| Challenge: | a prototype of an intelligent personal assistant can be programmed using natural language . a user can instruct her assistants using language similar to how humans teach other humans . |
| Approach: | They present LIA, an intelligent personal assistant that can be programmed using natural language. LIA resides on a typical mobile Android device. |
| Outcome: | The proposed system can be programmed using natural language, and it can perceive the external environment through sensors and effectors. |
SGL: Speaking the Graph Languages of Semantic Parsing via Multilingual Translation (2021.naacl-main)
Copied to clipboard
| Challenge: | Graph-based semantic parsing is one of the most promising general-purpose meaning representations . owing to this heterogeneity, most research focused on solutions specific to a given formalism . |
| Approach: | They propose a multilingual neural machine translation framework for Graph-based semantic parsing . they propose Graph2seq architecture that trains with an MNMT objective . |
| Outcome: | The proposed framework outperforms all competitors on cross-lingual parsing tasks. |
ParaQG: A System for Generating Questions and Answers from Paragraphs (D19-3)
Copied to clipboard
| Challenge: | Automated question generation systems generate questions from sentences and paragraphs . manual generation of questions is labour-intensive as it requires reading, parsing and understanding of long passages of text. |
| Approach: | They propose a web-based system for generating questions from sentences and paragraphs . paraQG provides an interactive interface for a user to select answers with visual insights . |
| Outcome: | The proposed system generates questions from sentences and paragraphs on a web-based platform. |
Machines Getting with the Program: Understanding Intent Arguments of Non-Canonical Directives (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Modern dialog managers face the challenge of having to fulfill human-level conversational skills as part of common user expectations. |
| Approach: | They propose to extract the intent argument of non-canonical directives in a natural language format and build a parallel corpus for this purpose. |
| Outcome: | The proposed method extracts the intent argument of non-canonical directives in a natural language format, which may yield more accurate parsing. |
Leveraging Explicit Lexico-logical Alignments in Text-to-SQL Parsing (2022.acl-short)
Copied to clipboard
| Challenge: | Text-to-SQL parsing aims to parse natural language questions into SQL queries . current attention-based approaches can only model alignments at the token level . |
| Approach: | They propose a method to leverage explicit lexico-logical alignments by identifying possible phrase-level alignments and injecting them as additional contexts into the parsing procedure. |
| Outcome: | The proposed approach improves performance by 3.4% on Squall. |
Cross-Domain Generalization of Neural Constituency Parsers (P19-1)
Copied to clipboard
| Challenge: | Neural parsers perform well on in-domain benchmarks, but their performance degrades in well-understood ways. |
| Approach: | They analyze generalization on English and Chinese corpora to see if they can generalize to other domains. |
| Outcome: | The proposed neural parsers perform better on in-domain benchmarks than on out-of-domain corpora. |
Unifying Parsing and Tree-Structured Models for Generating Sentence Semantic Representations (2022.naacl-srw)
Copied to clipboard
| Challenge: | Existing tree-based models require handannotated data to be trained. |
| Approach: | They propose a tree-based model that learns its composition function together with its structure. |
| Outcome: | The proposed model outperforms existing models on downstream tasks and is competitive with Bert base model. |
Penman: An Open-Source Library and Tool for AMR Graphs (2020.acl-demos)
Copied to clipboard
| Challenge: | Abstract Meaning Representation encodes acyclic graphs in PENMAN notation format . the open-source Python library Penman provides a robust parser and functions for graph inspection and manipulation . |
| Approach: | They propose a framework for encoding acyclic graphs in PENMAN notation . the open-source Python library Penman provides a robust parser and functions for graph inspection and manipulation . |
| Outcome: | The open-source Python library Penman provides a robust parser, functions for graph inspection and manipulation, and functions for formatting graphs into PENMAN notation. |
Conversing with databases: Practical Natural Language Querying (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Large amount of companies' data is stored in relational databases . quick hypotheses validation is rarely, if ever, possible for majority of nontechnical business stakeholders. |
| Approach: | They propose a hybrid NLQ system for conversational DB querying that allows non-technical users to formulate data requests as natural language questions. |
| Outcome: | The proposed system is based on a hybrid NLQ (Natural Language Querying) system for conversational DB querying. |
Scene Graph Parsing as Dependency Parsing (N18-1)
Copied to clipboard
| Challenge: | Recent studies have focused on parsing structured knowledge graphs from textual descriptions. |
| Approach: | They propose an alternative but equivalent scene graph representation that connects to dependency parses. |
| Outcome: | The proposed model outperforms best approaches on image retrieval applications. |
Hierarchical Curriculum Learning for AMR Parsing (2022.acl-short)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsing aims to translate sentences to semantic representation with a hierarchical structure, but there is a gap between their flat training objective and the hierarchic structure, which limits the model generalization. |
| Approach: | They propose a Hierarchical Curriculum Learning framework with Structure-level (SC) and Instance-level curricula (IC) that aims to translate sentences to semantic representation with a hierarchical structure. |
| Outcome: | Experiments on AMR2.0, AMR3.0, structure-complex and out-of-distribution situations confirm the effectiveness of the proposed framework. |
XFormParser: A Simple and Effective Multimodal Multilingual Semi-structured Form Parser (2025.coling-main)
Copied to clipboard
Xianfu Cheng, Hang Zhang, Jian Yang, Xiang Li, Weixiao Zhou, Fei Liu, Kui Wu, Xiangyuan Guan, Tao Sun, Xianjie Wu, Tongliang Li, Zhoujun Li
| Challenge: | Document AI parsing semi-structured image form is a key information extraction task. |
| Approach: | They propose a multimodal and multilingual semi-structured FORM PARSER which integrates SER and relation extraction into a unified framework. |
| Outcome: | The proposed framework achieves up to 1.79% improvement on RE tasks in multilingual and zero-shot settings. |
Abstract Meaning Representation for Paraphrase Detection (N18-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsing is ideal for paraphrase detection . it abstracts away from the syntactic realization of a sentence, and denotes only its meaning in a canonical form. |
| Approach: | They propose a technique that uses latent semantic analysis to translate sentences into AMR graphs . they show that the technique can be used to detect whether two sentences have the same meaning . |
| Outcome: | The proposed technique significantly advances state-of-the-art paraphrase detection for the Microsoft Research Paraphrase Corpus. |
Penn-Helsinki Parsed Corpus of Early Modern English: First Parsing Results and Analysis (2022.findings-naacl)
Copied to clipboard
| Challenge: | PPCEME has a large set of function tags and is difficult to parse . authors present results for PPceME using a modified version of the Berkeley Neural Parser . |
| Approach: | They propose to use a modified version of the Berkeley Neural Parser to parse PPCEME using function tags. |
| Outcome: | The proposed parser will be used to parse Early English Books Online, a 1.5 billion word corpus. |
Advancing Topic Segmentation and Outline Generation in Chinese Texts: The Paragraph-level Topic Representation, Corpus, and Benchmark (2024.lrec-main)
Copied to clipboard
| Challenge: | Compared with sentence-level topic structure, paragraph-level topics can grasp and understand the context of a document from a higher level. |
| Approach: | They propose a hierarchical paragraph-level topic structure representation with three layers to guide corpus construction. |
| Outcome: | The proposed method achieves the largest Chinese paragraph-level topic structure corpus, achieving high quality. |
Bootstrapping a Crosslingual Semantic Parser (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Recent advances in semantic parsing are limited to English but professional translation can be prohibitively expensive. |
| Approach: | They adapt a semantic parser trained on a single language to new languages and multiple domains with minimal annotation. |
| Outcome: | The proposed approach achieves parsing accuracy within 2% of translation using only 50% of training data. |
Active Learning for Multilingual Semantic Parser (2023.findings-eacl)
Copied to clipboard
| Challenge: | Existing multilingual semantic parsing datasets are limited in translation effort due to data imbalance. |
| Approach: | They propose a first active learning procedure for multilingual semantic parsing (AL-MSP) it selects only a subset from existing datasets to be translated, they propose . |
| Outcome: | The proposed method significantly reduces translation costs with ideal selection methods. |
GCDT: A Chinese RST Treebank for Multigenre and Multilingual Discourse Parsing (2022.aacl-short)
Copied to clipboard
| Challenge: | GCDT is the largest hierarchical discourse treebank for Mandarin Chinese in the framework of Rhetorical Structure Theory (RST). |
| Approach: | They propose to use a Chinese hierarchical discourse treebank to parse Mandarin Chinese using relation inventory and a multilingual training program. |
| Outcome: | The proposed dataset includes state-of-the-art scores for Chinese RST parsing and RST Parsing on the English GUM dataset, using cross-lingual training in Chinese and English with multilingual embeddings. |
Deep Enhanced Representation for Implicit Discourse Relation Recognition (C18-1)
Copied to clipboard
| Challenge: | Discourse parsing requires understanding of text spans and can't be easily derived from surface features from sentence pairs. |
| Approach: | They propose a model augmented with different grained text representations to improve discourse relation recognition. |
| Outcome: | The proposed model achieves state-of-the-art accuracy with greater than 48% in 11-way and F1 score greater than 50% in 4-way classifications for the first time according to our best knowledge. |
Constraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars (P18-1)
Copied to clipboard
| Challenge: | a deep grammatical formalism that has not been applied to NLP tasks is the Minimalist Grammar (MG) formalism. |
| Approach: | They propose to extend the Minimalist Grammar (MG) formalism with a mechanism for enforcing fine-grained selectional restrictions and agreements. |
| Outcome: | The proposed system is compatible with Markovian supertaggers and enables efficient parsing on key dependency types. |
I Speak for the Árboles: Developing a Dependency Treebank for Spanish L2 and Heritage Speakers (2025.acl-srw)
Copied to clipboard
| Challenge: | Existing dependency treebanks for learner writing are limited due to morphosyntactic features. |
| Approach: | They propose to use a dependency treebank for Spanish learner writing from the UC Davis COWSL2H corpus to incorporate lemmatization, POS tagging, and syntactic dependencies. |
| Outcome: | The proposed treebanks are openly accessible to motivate future development of learner-oriented language technologies. |
Top-down Discourse Parsing via Sequence Labelling (2021.eacl-main)
Copied to clipboard
| Challenge: | Discourse analysis is a systematic way to understand how texts are segmented hierarchically into discourse units. |
| Approach: | They propose a top-down approach to discourse parsing that is conceptually simpler than its predecessors. |
| Outcome: | The proposed model eliminates the decoder and reduces the search space for splitting points. |
Automatically Selecting the Best Dependency Annotation Design with Dynamic Oracles (N18-2)
Copied to clipboard
| Challenge: | Multiple annotation conventions have been proposed for representing dependency structures. |
| Approach: | They propose to consider a set of syntactic references encoding alternative syntak representations to train a parser with a dynamic oracle. |
| Outcome: | The proposed approach can predict the best syntactic representation among all possible references. |
Zero-Shot Dependency Parsing with Worst-Case Aware Automated Curriculum Learning (2022.acl-short)
Copied to clipboard
| Challenge: | Large multilingual pretrained language models such as mBERT and XLM-RoBERTa have been found to be effective for cross-lingual transfer of syntactic parsing models but only between related languages. |
| Approach: | They propose to use multi-task learning to dynamically optimize for parsing performance on outlier languages by using a multi-level learning approach. |
| Outcome: | The proposed method significantly outperforms uniform and size-proportional sampling in the zero-shot setting. |
Polyglot Semantic Parsing in APIs (N18-1)
Copied to clipboard
| Challenge: | Existing approaches to semantic parsing work by training individual models for each available parallel dataset of text-meaning pairs. |
| Approach: | They propose a polyglot semantic translation approach that trains on multiple datasets and natural languages to learn parsing models. |
| Outcome: | The proposed model can be used for parsing a wide variety of natural languages and output languages, and achieves state-of-the-art performance on the above datasets. |
The Role of Context and Uncertainty in Shallow Discourse Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Discourse parsing has proven to be useful for a number of NLP tasks that require complex reasoning. |
| Approach: | They hypothesize that context plays an important role in accurate human annotation and add uncertainty measures can improve model accuracy and calibration. |
| Outcome: | The proposed model can be better calibrated by adding uncertainty measures to models with better accuracy and calibration. |
Calibrated Interpretation: Confidence Estimation in Semantic Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Sequence generation models are increasingly being used to translate natural language into programs . calibration of such models is a key component of safety, says aaron sagar . |
| Approach: | They investigate whether calibration of popular generation models varies across models and datasets . they find that calibration varies among models and data sets, and that it is important to include it in evaluations if it is included . |
| Outcome: | The calibration of popular generation models varies across models and datasets . the authors find that the accuracy of models is dependent on confidence . |
Modeling discourse cohesion for discourse parsing via memory network (P18-2)
Copied to clipboard
| Challenge: | Existing approaches to discourse parsing focus on studying the semantic and syntactic aspects of EDU pairs, but they do not address long span dependencies. |
| Approach: | They propose a new transition-based discourse parser that takes discourse cohesion into account by using memory networks. |
| Outcome: | The proposed method outperforms traditional features and improves performance on the RST discourse treebank. |
Dialo-AP: A Dependency Parsing Based Argument Parser for Dialogues (2022.coling-1)
Copied to clipboard
| Challenge: | a recent work on argument mining has focused on parsing monologues, while neglecting dialogues. |
| Approach: | They propose an end-to-end argument parser that constructs argument graphs from dialogues . they use extensive pre-training and curriculum learning to train AM . |
| Outcome: | The proposed system performs all sub-tasks of AM and achieves significant improvements . it is compared to existing systems and validated through human evaluation . |
CoXQL: A Dataset for Parsing Explanation Requests in Conversational XAI Systems (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing systems based on large language models (LLMs) are more precise and reliable in identifying users’ intentions, but the recognition of intents still presents a challenge in the case of ConvXAI, since little training data exist and the domain is highly specific. |
| Approach: | They propose to use a dataset in the NLP domain for user intent recognition in ConvXAI to improve parsing performance. |
| Outcome: | The proposed system outperforms existing methods and improves on existing ones. |
A Distance-Aware Multi-Task Framework for Conversational Discourse Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Existing studies have focused on graph-based and transition-based discourse parsing, but no study has investigated the advantages of both paradigms for conversational discourse paring. |
| Approach: | They propose a distance-aware multi-task framework that incorporates the strengths of transition-based paradigms to facilitate conversational discourse parsing. |
| Outcome: | The proposed framework improves the graph-based paradigm on long-distance dependency links. |
Linear-time Constituency Parsing with RNNs and Dynamic Programming (P18-2)
Copied to clipboard
| Challenge: | Existing span-based constituency parsers are too slow for longer sentences and for applications beyond sentence boundaries. |
| Approach: | They propose a linear-time constituency parser with RNNs and dynamic programming using graph-structured stack and beam search. |
| Outcome: | The proposed parser is faster for long sentences and faster for discourse parsing. |
Prosodic segmentation for parsing spoken dialogue (2021.acl-long)
Copied to clipboard
| Challenge: | Existing parsers struggle to parse spoken dialogue because of disfluencies and unmarked boundaries between sentence-like units (SUs). |
| Approach: | They hypothesize that prosody affects a parser that receives an entire dialogue turn as input, instead of gold standard pre-segmented SUs. |
| Outcome: | The proposed model performs better than the SU-based model on the English Switchboard corpus despite performing two tasks rather than one, and pitch and intensity features are the most important for this corpus. |
A Biologically Plausible Parser (2021.tacl-1)
Copied to clipboard
| Challenge: | a recent computational framework for cognitive function is being proposed to model brain activity . a parser of English is capable of parsing nontrivial sentences, but it can be extended to many directions . |
| Approach: | They propose a parser of English effectuated by biologically plausible neurons and synapses . they propose recursion, embedding, and polysemy as ways to parse nontrivial sentences . |
| Outcome: | The proposed parser can handle recursion, embedding, and polysemy in nontrivial sentences . the proposed framework can be extended to many directions encompassing much of language . |
Optimal Transport Posterior Alignment for Cross-lingual Semantic Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Existing work on cross-lingual semantic parsing has focused on English . a few-shot approach to parse from natural languages is comparatively unexplored . |
| Approach: | They propose a method that minimizes cross-lingual divergence between probabilistic latent variables by Optimal Transport. |
| Outcome: | The proposed method improves performance even without parallel input translations on two datasets. |
Infinity-Parser: Layout-Aware Reinforcement Learning with High-quality Document Parsing Dataset (2026.findings-acl)
Copied to clipboard
Baode Wang, Biao Wu, Weizhen Li, Meng Fang, Zuming Huang, Jun Huang, Yanjie Liang, Haozhe Wang, Ling Chen, Wei Chu, Yuan Qi
| Challenge: | Existing supervised fine-tuning methods struggle to generalize across document types, leading to poor performance. |
| Approach: | They propose layoutRL, a reinforcement learning framework that optimizes layout understanding through composite rewards integrating normalized edit distance, paragraph count accuracy, and reading order preservation. |
| Outcome: | The proposed model outperforms specialized document parsing systems and general-purpose vision-language models on a broad range of document types, languages, and structural complexities. |
A Truly Joint Neural Architecture for Segmentation and Parsing (2024.eacl-long)
Copied to clipboard
| Challenge: | Contemporary multilingual dependency parsers can parse a diverse set of languages, but performance is lower for Morphologically Rich Languages. |
| Approach: | They propose a joint neural architecture where a lattice-based representation is provided to an arc-factored model and solves the morphological segmentation and syntactic parsing tasks at once. |
| Outcome: | The proposed architecture is language-agnostic and language-based to improve on Hebrew . it shows that the proposed model can parse morphological segmentation and syntactic parsing tasks at once. |
Transition-based Parsing with Stack-Transformers (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing parsing systems use local or global models of the parser state to improve performance. |
| Approach: | They propose to modify the sequence-to-sequence Transformer to model global or local parser states in transition-based parsing. |
| Outcome: | The proposed model significantly improves performance on dependency and Abstract Meaning Representation (AMR) parsing tasks. |
UGIF-DataSet: A New Dataset for Cross-lingual, Cross-modal Sequential actions on the UI (2024.findings-naacl)
Copied to clipboard
| Challenge: | Identifying the right help document, understanding instructions from the document, and using them to resolve the issue at hand is challenging. |
| Approach: | They propose to use help documents to create step-by-step tutorials overlaid on the phone UI to overcome challenges in retrieval, parsing, and grounding in multilingual-multimodal setting. |
| Outcome: | The proposed dataset contains 4,184 tasks across 8 languages and shows that the end-to-end completion rate drops from 48% in English to 32% for other languages. |
Universal Dependency Parsing for Hindi-English Code-Switching (N18-1)
Copied to clipboard
| Challenge: | Code-switching data often need additional processes such as language identification, normalization and/or back-transliteration to be processed. |
| Approach: | They propose a neural stacking model that leverages part-of-speech tags and syntactic tree annotations in tweets to parse code-switching data. |
| Outcome: | The proposed model is 1.5% better than the augmented model and 3.8% better than one which uses first-best normalization and/or back-transliteration. |
Grammar-based Decoding for Improved Compositional Generalization in Semantic Parsing (2023.findings-acl)
Copied to clipboard
| Challenge: | Sequence-to-sequence (seq2sequ) models have been successful in semantic parsing tasks but struggle on out-of-distribution data. |
| Approach: | They propose to use a large-scale dialogue dataset to evaluate compositional generalization of semantic parsing. |
| Outcome: | The proposed model outperforms BART- and T5-based models on the SMCalflow-CS dataset on the zero-shot learning task. |
Sort by Structure: Language Model Ranking as Dependency Probing (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing algorithms for pre-trained language models lack performance indicators for linguistic tasks such as structured prediction. |
| Approach: | They propose to measure the degree to which labeled trees are recoverable from an LM’s contextualized embeddings by probing to rank LMs for parsing dependencies in a given language. |
| Outcome: | The proposed approach predicts the best LM choice 79% of the time using less compute than training a full parser. |
Input Representations for Parsing Discourse Representation Structures: Comparing English with Chinese (2021.acl-short)
Copied to clipboard
| Challenge: | Neural semantic parsers have obtained acceptable results in parsing DRSs . previous studies have focused on parse of DRS in English, but have focused only on a few languages . |
| Approach: | They propose to use character sequences as input to map meaning representations to string format. |
| Outcome: | The proposed models learn the meaning of a series of semantic phenomena by taking sentences as input and outputting the corresponding DRSs, without the aid of any extra linguistic information. |
Memory-enhanced Large Language Model for Cross-lingual Dependency Parsing via Deep Hierarchical Syntax Understanding (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Experimental results show that our approach can significantly improve the parsing accuracy of all baseline models, leading to new state-of-the-art results. |
| Approach: | They propose a deep hierarchical syntax understanding approach to improve the cross-lingual semantic memory capability of large language models by implicitly aligning linguistic knowledge between source and target languages. |
| Outcome: | The proposed approach improves the cross-lingual semantic memory capability of large language models by combining implicit multi-task fine-tuning and explicit label bank guiding. |
Look-up and Adapt: A One-shot Semantic Parser (D19-1)
Copied to clipboard
| Challenge: | Current conversational agents such as Siri, Alexa or Google Assistant do not cater to the specific phrasing of a user or the specific action. |
| Approach: | They propose a semantic parser that generalizes to out-of-domain examples by adapting the logical forms of seen utterances to fit an unseen utterant. |
| Outcome: | The proposed parser improves on one-shot parsing by 68.8% compared to baselines . it adapts the logical forms of seen utterances to fit the unseen utterant . |
Improving the Extraction of Supertags for Constituency Parsing with Linear Context-Free Rewriting Systems (2022.findings-emnlp)
Copied to clipboard
| Challenge: | a new approach to parsing discontinuous constituency structures uses supertags to improve parsability . traditional approaches use grammar formalisms to model hierarchies of noncontiguous phrases . but supertags are still useful for analyzing these grammars and parsers . |
| Approach: | They propose to reformulate and parameterize extraction process for LCFRS supertags to improve parsing quality. |
| Outcome: | The proposed method improves the quality and speed of parsing with supertags over the previous method. |
Sentences with Gapping: Parsing and Reconstructing Elided Predicates (N18-1)
Copied to clipboard
| Challenge: | Sentences with gapping lack an overt predicate to indicate the relation between two or more arguments. |
| Approach: | They propose two methods for parsing to a Universal Dependencies graph representation that explicitly encodes the elided material with additional nodes and edges. |
| Outcome: | The proposed methods reconstruct elided material from dependency trees with high accuracy when the parser correctly predicts the existence of a gap. |
Polyglot Semantic Role Labeling (P18-2)
Copied to clipboard
| Challenge: | Existing approaches to multilingual semantic dependency parsing treat languages independently, without exploiting similarities between semantic structures across languages. |
| Approach: | They propose to combine resources from different languages in a CoNLL 2009 shared task to build a single polyglot semantic dependency parser. |
| Outcome: | The proposed model outperforms monolingual training on a CoNLL 2009 dataset with training data from multiple languages and representations using multilingual word vectors. |
End-to-End Graph-Based TAG Parsing with Neural Networks (N18-1)
Copied to clipboard
| Challenge: | Using BiLSTMs, highway connections, and character-level CNNs, we propose a graph-based Tree Adjoining Grammar (TAG) parser. |
| Approach: | They propose a graph-based Tree Adjoining Grammar parser that uses BiLSTMs, highway connections, and character-level CNNs. |
| Outcome: | The proposed parser outperforms the previously reported best by more than 2.2 LAS and UAS points. |
Cross-lingual AMR Aligner: Paying Attention to Cross-Attention (2023.findings-acl)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) graphs embed the semantics of a sentence in a directed acyclic graph, where concepts are represented by nodes, semantic relations between concepts by edges, and the co-references by reentrant nodes. |
| Approach: | They propose a novel aligner for Abstract Meaning Representation graphs that scales cross-lingually and can align units and spans in sentences of different languages. |
| Outcome: | The proposed aligner achieves state-of-the-art in the benchmarks and can scale cross-lingually. |
Unsupervised Recurrent Neural Network Grammars (N19-1)
Copied to clipboard
| Challenge: | RNNGs model syntax and structure by incrementally generating a syntax tree and sentence in a top-down, left-to-right order. |
| Approach: | They explore unsupervised learning of recurrent neural network grammars for language modeling and grammar induction. |
| Outcome: | The proposed model outperforms standard sequential language models and improves parsing performance. |
PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent work shows that probabilistic context-free grammars with neural parameterization can be effective in unsupervised constituency parsing. |
| Approach: | They propose a parameterization form of PCFGs based on tensor decomposition which has at most quadratic computational complexity in the symbol number. |
| Outcome: | The proposed model improves unsupervised constituency parsing performance across ten languages. |
AMR Parsing via Graph-Sequence Iterative Inference (2020.acl-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsing is a broad-coverage semantic formalism that encodes the meaning of a sentence as a rooted, directed, labeled graph. |
| Approach: | They propose a model that treats AMR parsing as a series of dual decisions on the input sequence and the incrementally constructed graph. |
| Outcome: | The proposed model outperforms existing models by large margins on both input sequence and output graph. |
RST Parsing from Scratch (2021.naacl-main)
Copied to clipboard
| Challenge: | Fig. 1 shows a document level discourse parser that performs top-down end-to-end parsing without requiring segmentation . |
| Approach: | They propose a top-down end-to-end formulation of document level discourse parsing in the Rhetorical Structure Theory framework. |
| Outcome: | The proposed model outperforms existing methods in end-to-end parsing and parse with gold segmentation without handcrafted features. |
Twitter Universal Dependency Parsing for African-American and Mainstream American English (P18-1)
Copied to clipboard
| Challenge: | We analyze the performance disparities between AAE and Mainstream American English (MAE) because of Twitter-specific conventions and dialectal language. |
| Approach: | They develop a dataset of 500 tweets, 250 of which are in AAE, within the Universal Dependencies 2.0 framework and annotate it. |
| Outcome: | The proposed model improves performance for AAE tweets with no or very little in-domain labeled data and assesses its lexical and syntactic features. |
MM-BizRAG: Rethinking Multimodal Retrieval-Augmented Generation for General Purpose Enterprise Q&A (2026.acl-industry)
Copied to clipboard
Hanoz Bhathena, Parin Rajesh Jhaveri, Rohan Mittal, Prateek Singh, Aymen Kallala, Rachneet Kaur, Yiqiao Jin, Zhen Zeng, Adwait Ratnaparkhi, Denis Kochedykov
| Challenge: | Recent advances in multimodal retrieval-augmented generation (MM-RAG) have shifted toward minimal parsing, relying on page-level images for producing retriever embeddings and answer generation. |
| Approach: | They propose a document structure-aware split that extracts and represents document structure via a structure-based split that dynamically routes documents through orientation-specific ingestion pipelines. |
| Outcome: | The proposed model outperforms state-of-the-art vision-centric baselines by up to 32% points and achieves strong gains on report-style layouts. |
A Unified Span-Based Approach for Opinion Mining with Syntactic Constituents (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for fine-grained opinion mining (OM) are based on span-based annotations, but they are not effective. |
| Approach: | They propose a unified span-based approach for the end-to-end OM setting using syntactic constituents and multi-task learning to integrate them into the proposed model. |
| Outcome: | The proposed approach achieves significant improvements over previous work on the MPQA 2.0 dataset and reduces the number of wrongly-predicted opinion expressions and roles. |
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. |
Syntactic Substitutability as Unsupervised Dependency Syntax (2023.emnlp-main)
Copied to clipboard
| Challenge: | Syntax is a latent hierarchical structure which underpins the robust and compositional nature of human language. |
| Approach: | They propose a method to induce syntactic dependencies theory-agnostically by substituting words from the same category for words at either end of a dependency. |
| Outcome: | The proposed method achieves 79.5% recall on long-distance subject-verb agreement constructions compared to 8.9% using a previous method. |
APGN: Adversarial and Parameter Generation Networks for Multi-Source Cross-Domain Dependency Parsing (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for dependency parsing use labeled training data for several fixed domains, but performance drops when labeles only exist for several out-domains. |
| Approach: | They propose a model for multi-source cross-domain dependency parsing that uses a parameter generation network and adversarial network for learning domain-invariant representations. |
| Outcome: | The proposed model improves cross-domain parsing performance by about 2 points over strong BERT-enhanced baselines over a recently released dataset for multi-domain dependency parse. |
Fine-Grained Error Analysis and Fair Evaluation of Labeled Spans (2022.lrec-1)
Copied to clipboard
| Challenge: | Annotations with incorrect label or boundaries count as two errors instead of one, despite being closer to the target annotation than false positives or false negatives. |
| Approach: | They propose an algorithm for error identification in flat and multi-level annotations and propose a procedure for calculating meaningful precision, recall, and F1-scores based on the more fine-grained error types. |
| Outcome: | The proposed procedure prevents double penalties and allows for a more detailed error analysis, providing more insight into the actual weaknesses of a system. |
Improving Constituency Parsing with Span Attention (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Constituency parsing is a fundamental task for natural language understanding . n-grams are a conventional type of feature for contextual information . experimental results show that neural parsers with no grammar rules outperform statistical ones . |
| Approach: | They propose to incorporate n-grams into span representations by weighting them according to their contributions to the parsing process. |
| Outcome: | The proposed approach outperforms existing statistical grammar-based models on Arabic, Chinese, and English datasets. |
A Monolingual Approach to Contextualized Word Embeddings for Mid-Resource Languages (2020.acl-main)
Copied to clipboard
| Challenge: | a recent trend in neural NLP has been the introduction of feature-based and fine-tuning methods . we train monolingual contextualized word embeddings for five mid-resource languages . |
| Approach: | They use common Crawl corpus to train monolingual contextualized word embeddings . they compare performance of OSCAR-based and Wikipedia-based embeddables on part-of-speech tasks . |
| Outcome: | The results show that OSCAR-based and Wikipedia-based embeddings perform better than Wikipedia-style embedders on part-of-speech tagging and parsing tasks. |
Constituent Parsing as Sequence Labeling (D18-1)
Copied to clipboard
| Challenge: | Constituent parsing is a core problem in NLP where the goal is to obtain the syntactic structure of sentences expressed as a phrase structure tree. |
| Approach: | They propose a method to reduce constituent parsing to sequence labeling by using a tree with unary branches. |
| Outcome: | The proposed method outperforms the Vinyals et al. (2015) sequence-to-sequence parser by 90% on the PTB and CTB treebanks. |
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. |
Can we obtain significant success in RST discourse parsing by using Large Language Models? (2024.eacl-long)
Copied to clipboard
| Challenge: | Experimental results show that LLMs with tens of billion parameters can perform discourse parsing tasks. |
| Approach: | They employ Llama 2 and fine-tune it with QLoRA to achieve similar results . they show that LLMs with tens of billion parameters can perform a wide range of NLP tasks . |
| Outcome: | The proposed model performs better than existing models on three benchmark datasets. |
Syntax-guided Localized Self-attention by Constituency Syntactic Distance (2022.findings-emnlp)
Copied to clipboard
Shengyuan Hou, Jushi Kai, Haotian Xue, Bingyu Zhu, Bo Yuan, Longtao Huang, Xinbing Wang, Zhouhan Lin
| Challenge: | Recent studies have shown that Transformers is implicitly learning syntactic information from data, albeit is highly dependent on the quality and scale of the training data. |
| Approach: | They propose a syntax-guided localized self-attention model that allows directly incorporating grammar structures from an external constituency parser. |
| Outcome: | The proposed model improves translation performance on a variety of datasets, from small to large datasets and with different source languages. |
Backpropagating through Structured Argmax using a SPIGOT (P18-1)
Copied to clipboard
| Challenge: | Structured projection of intermediate gradients (SPIGOT) is a new method for backpropagating through neural networks . structure-based learning methods for natural language processing are increasingly dominated by end-to-end differentiable functions . |
| Approach: | They propose a structured projection of intermediate gradients method for backpropagating through neural networks that includes hard-decision structured predictions in intermediate layers. |
| Outcome: | The proposed method improves on two structured NLP pipelines: syntactic-then-semantic dependency parsing and semantic parser followed by sentiment classification. |
Implicit Discourse Relation Classification For Nigerian Pidgin (2025.coling-main)
Copied to clipboard
| Challenge: | Existing discourse parsing tools are not available for Nigerian Pidgin (NP) this task requires supervised training and requires prompting. |
| Approach: | They propose to use implicit discourse relation classification (IDRC) for Nigerian Pidgin, which requires supervised training. |
| Outcome: | The proposed framework outperforms baseline and NP IDR classifiers in f1 scores. |
FormGym: Doing Paperwork with Agents (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing studies focus on parsing, extraction and web form interaction, rather than end-to-end completion of document-style forms. |
| Approach: | They propose a benchmark formulation of the end-to-end form filling task that evaluates form completion and accuracy. |
| Outcome: | The proposed task is based on three existing datasets and adds one new dataset to achieve more challenging, diverse, and realistic test cases. |
GRAMMAR-LLM: Grammar-Constrained Natural Language Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to fine-tuning and prompting are insufficient to ensure compliance with predefined taxonomies, syntactic structures, or domain-specific rules. |
| Approach: | They propose a framework that integrates formal grammatical constraints into the decoding process to enforce syntactic correctness in linear time while maintaining expressiveness in grammar rule definition. |
| Outcome: | The proposed framework enforces syntactic correctness in linear time while maintaining expressiveness in grammar rule definition. |
Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Chart-based models have shown great potential in unsupervised grammar induction, running recursively and hierarchically, but requiring O(n3) time-complexity. |
| Approach: | They propose a model-guided pruning method that scales to large language model pretraining by introducing a heuristic pruning method. |
| Outcome: | The proposed method significantly improves grammar induction quality and achieves competitive results in downstream tasks. |
You Only Look at Screens: Multimodal Chain-of-Action Agents (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to creating autonomous graphical user interfaces rely on external tools and application-specific APIs to interpret the environment. |
| Approach: | They propose a multimodal solution that directly interacts with the user interface without environment parsing. |
| Outcome: | The proposed solution bypasses environment parsing and reliance on application-dependent APIs. |
The Secret is in the Spectra: Predicting Cross-lingual Task Performance with Spectral Similarity Measures (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have suggested that bilingual lexicon induction is influenced by the (dis)similarity of the languages at hand. |
| Approach: | They propose to measure the isomorphism of monolingual embedding spaces based on their spectra and introduce isometric measures to measure their similarity. |
| Outcome: | The proposed measures outperform standard isomorphism measures while being more tractable and easier to interpret. |
Neural Combinatory Constituency Parsing (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to constituency parsing are based on symbolic engineering, but they are simplified by their adaptive distributed representation. |
| Approach: | They propose two fast combinatory models for constituency parsing: binary and multibranching. |
| Outcome: | The proposed models achieve an F1 score of 92.54 on Penn Treebank, speeding at 1327.2 sents/sec. |
Improving AMR Parsing with Sequence-to-Sequence Pre-training (2020.emnlp-main)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR) parsing is limited by the size of curated datasets. |
| Approach: | They propose a seq2seq pre-training approach to build pre-trained models on three relevant tasks. |
| Outcome: | The proposed model improves performance on three relevant tasks while maintaining the response of pre-trained models. |
Better Transition-Based AMR Parsing with a Refined Search Space (D18-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsers require a pipeline approach to learn concepts and relationships. |
| Approach: | They propose to use a transition-based search space to conduct a new compact AMR graph and an improved oracle to perform the search. |
| Outcome: | The proposed system achieves the state-of-the-art performance on various datasets with minimal additional information. |
The Role of Reentrancies in Abstract Meaning Representation Parsing (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsers make errors with respect to reentrancies, which complicates AMR parsing and requires specific transitions. |
| Approach: | They propose to categorize the types of errors AMR parsers make with respect to reentrancies and find that correcting these errors provides an in-crease of up to 5% Smatch in parsing perfor- mance and 20% in reen- trancy prediction. |
| Outcome: | The proposed formalism can predict reentrancies with 5% accuracy and 20% accuracy. |
E-magyar – A Digital Language Processing System (L18-1)
Copied to clipboard
Tamás Váradi, Eszter Simon, Bálint Sass, Iván Mittelholcz, Attila Novák, Balázs Indig, Richárd Farkas, Veronika Vincze
| Challenge: | e-magyar is a free, open, modular text processing pipeline for Hungarian . existing tools were overhauled to operate in the pipeline with a uniform encoding and run in the same Java platform. |
| Approach: | e-magyar is a free, open, modular text processing pipeline for Hungarian . it was created by a collaborative effort by the language technology community . the system is aimed at a broad range of users, from language developers to researchers . |
| Outcome: | The proposed tool is open source and available for download on the HFST framework. |
The Limitations of Limited Context for Constituency Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | a language model that is syntax-aware can produce better samples, authors say . a recent study shows that neural approaches to syntax can perform unsupervised syntactic parsing . |
| Approach: | They propose to incorporate syntax into neural approaches in NLP to produce better samples . they find that the first time neural approaches were able to perform unsupervised syntactic parsing . |
| Outcome: | The proposed models can perform unsupervised syntactic parsing, but they are lagging behind . the proposed models are based on a sandbox of probabilistic context-free-grammars . |
Bits and Pieces: Investigating the Effects of Subwords in Multi-task Parsing across Languages and Domains (2024.lrec-main)
Copied to clipboard
| Challenge: | Neural parsing is dependent on the underlying language model, but little is known about how choices affect parser performance. |
| Approach: | They examine how subword sharing is responsible for gains or negative transfer in multi-task learning . they find a preference for averaged or last subwords across languages and domains . |
| Outcome: | The proposed model favors averaged or last subwords across languages and domains . specific POS tags may require different subword, and distribution overlap is more important than discrepancies in the data sizes. |
Parsing Gapping Constructions Based on Grammatical and Semantic Roles (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for parsing sentences with gapping recover elided elements from redundant elements . grammatical and semantic tags are used to identify gaps in a coordinated structure . |
| Approach: | They propose a method of parsing sentences with gapping to recover elided elements . they use constituent trees annotated with grammatical and semantic roles . |
| Outcome: | The proposed method outperforms the previous method in terms of F-measure and recall. |
Some Languages Seem Easier to Parse Because Their Treebanks Leak (2020.emnlp-main)
Copied to clipboard
| Challenge: | Cross-language differences in (universal) dependency parsing performance are mostly attributed to treebank size, average sentence length, average dependency length, morphological complexity, and domain differences. |
| Approach: | They compute graph isomorphisms and find that treebank size is a factor that influences parsing performance. |
| Outcome: | The results show that the overlap between training and test graphs explain more of the observed variation than standard explanations such as the above. |
Discontinuous Constituent Parsing as Sequence Labeling (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to discontinuous parsing are complex and low-level. |
| Approach: | They propose to encode discontinuities as nearly ordered permutations of the input sequence. |
| Outcome: | The proposed model is fast and accurate under the right representation. |
Chain-of-Talkers (CoTalk): Fast Human Annotation of Dense Image Captions (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches for optimizing human annotation efforts are limited . et al., 2015) suggest that densely annotated image captions improve vision-language alignment . |
| Approach: | They propose an AI-in-the-loop methodology to maximize the number of annotated samples and improve their comprehensiveness under fixed budget constraints. |
| Outcome: | The proposed method improves annotation speed and retrieval performance over the parallel method. |
Bracketing Encodings for 2-Planar Dependency Parsing (2020.coling-main)
Copied to clipboard
| Challenge: | Existing bracketing-based encodings only handle a mild extension of projective trees . encodes that encode arcs in a given plane provide almost total coverage of crossing arc . |
| Approach: | They propose a bracketing-based encoding that can be used to represent any 2-planar dependency tree over a sentence of length n as a sequence of n labels. |
| Outcome: | The proposed method improves over existing bracketing encodings in non-projective treebanks while achieving similar speed. |
Semi-Supervised Dependency Parsing with Arc-Factored Variational Autoencoding (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing use unlabelled data to compensate for the lack of training corpora. |
| Approach: | They propose semi-supervised dependency parsing methods that utilize unlabelled data to compensate for the scarcity of labelled training corpora. |
| Outcome: | The proposed model overcomes the tree constraint and the complexity of the training procedure while avoiding the challenges brought by the tree constraints. |
Why Can’t Discourse Parsing Generalize? A Thorough Investigation of the Impact of Data Diversity (2023.eacl-main)
Copied to clipboard
| Challenge: | Discourse parsing performance is not reliable for high-resource languages such as English . a heterogeneous training regime is critical for stable and generalizable models . |
| Approach: | They investigate the impact of genre diversity on RST parsing stability . they use two largest RST corpora of English with text from multiple genres . |
| Outcome: | The proposed model can generalize to text types unseen during training, but it is not reliable for high-resource languages. |
Semi-supervised Domain Adaptation for Dependency Parsing (P19-1)
Copied to clipboard
| Challenge: | Currently, most studies on cross-domain parsing focus on unsupervised domain adaptation . however, unsupervised approaches make limited progress due to the intrinsic difficulty of both domain adaptation and parse. |
| Approach: | They propose a semi-supervised domain adaptation problem for Chinese dependency parsing by using newly-annotated large-scale domain-aware datasets. |
| Outcome: | The proposed method is more effective than direct corpus concatenation and multi-task learning. |
Supertagging-based Parsing with Linear Context-free Rewriting Systems (2021.naacl-main)
Copied to clipboard
| Challenge: | a new supertagging-based parser for linear context-free rewriting systems is developed for discontinuous constituents . discontinuous constituencies span non-contiguous sets of positions in a sentence, and can be modelled by CFG . |
| Approach: | They propose a supertagging-based parser for linear context-free rewriting systems . they propose an efficient procedure which induces a lexical LCFRS from any discontinuous treebank . |
| Outcome: | The proposed method outperforms previous LCFRS-based parsers in accuracy and speed by a wide margin. |
A Tale of Three Parsers: Towards Diagnostic Evaluation for Meaning Representation Parsing (2020.lrec-1)
Copied to clipboard
| Challenge: | Empirical results suggest that the proposed methodology can be meaningfully applied to parsing into graph-structured target representations, uncovering hitherto unknown properties of the different approaches. |
| Approach: | They propose to map from natural language utterances to graph-based encodings of its semantic structure using contrastive and diagnostic evaluation techniques. |
| Outcome: | The proposed method can be meaningfully applied to parsing into graph-structured target representations, uncovering hitherto unknown properties of the different systems that can inform future development and cross-fertilization across approaches. |
Modeling Human Sentence Processing with Left-Corner Recurrent Neural Network Grammars (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing literature is agnostic about a parsing strategy of hierarchical models . a recent study showed that hierarchically model hierarchic structures capture grammatical dependencies much better than RNNs in targeted syntactic evaluations. |
| Approach: | They evaluated three LMs with head-final left-branching structures and Recurrent Neural Network Grammars with top-down and left-corner parsing strategies as hierarchical models. |
| Outcome: | The proposed model outperforms top-down and left-corner models against human reading times in Japanese. |
BERT Shows Garden Path Effects (2023.eacl-main)
Copied to clipboard
| Challenge: | Garden path sentences are sentences that readers incorrectly parse, requiring partial or total re-analysis of the sentence structure. |
| Approach: | They assess transformer language models which have been fine-tuned on a question-answering task and evaluate their performance on comprehension questions based on garden path and control sentences. |
| Outcome: | The proposed models have low performance in certain instances of question answering based on garden path contexts, and incorrectly assign semantic roles aligning for the most part with human performance. |
Variance of Average Surprisal: A Better Predictor for Quality of Grammar from Unsupervised PCFG Induction (P19-1)
Copied to clipboard
| Challenge: | In unsupervised grammar induction, data likelihood is only weakly correlated with parsing accuracy, especially at convergence after multiple runs. |
| Approach: | They propose to use VAS instead of data likelihood to find better grammars by examining linguistically-motivated constraints related to syntax. |
| Outcome: | The proposed model is better suited for word order typology classification than data likelihood. |
Text-to-Text Extraction and Verbalization of Biomedical Event Graphs (2022.coling-1)
Copied to clipboard
| Challenge: | Biomedical events represent complex, graphical, and semantically rich interactions expressed in the scientific literature. |
| Approach: | They propose a framework to solve event extraction and event verbalization with a unified text-to-text approach. |
| Outcome: | The proposed framework achieves greater state-of-the-art performance than single-task competitors and can generate coherent natural language utterances from structured data. |
A simple but effective model for attachment in discourse parsing with multi-task learning for relation labeling (2023.eacl-main)
Copied to clipboard
| Challenge: | a discourse parsing model for conversation trained on the STAC is hard due to the complexity of discourse graphs and the frequent lack of surface cues provided by EDUs. |
| Approach: | They propose a discourse parsing model for conversation trained on the STAC that encodes discourse units and uses a multitask setting to predict relation labels. |
| Outcome: | The proposed model outperforms state-of-the-art models for discourse attachment prediction with no loss in performance for attachment. |
Global Transition-based Non-projective Dependency Parsing (P18-1)
Copied to clipboard
| Challenge: | Until recently, transition-based dependency parsers were limited to approximate inference due to their incompatibility with rich feature models. |
| Approach: | They propose a transition-based parser with high coverage on non-projective treebanks to support non- projective parsing. |
| Outcome: | The proposed approach is more efficient than its projective counterpart in non-projective languages. |
Constituency Parsing with a Self-Attentive Encoder (P18-1)
Copied to clipboard
| Challenge: | Recent work on LSTM encoders based on recurrent neural networks has led to improvements in constituency parsing accuracy. |
| Approach: | They propose to replace an LSTM encoder with a self-attentive architecture to improve a discriminative constituency parser. |
| Outcome: | The proposed model outperforms the previous best-published results on 8 of the 9 languages in the SPMRL dataset. |
Comparing learnability of two dependency schemes: ‘semantic’ (UD) and ‘syntactic’ (SUD) (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Several studies have suggested that choosing syntactic criteria for assigning heads in dependency trees improves the performance of dependency parsers. |
| Approach: | They propose to use syntactic criteria to assign heads to dependency trees to improve the performance of dependency parsers by using a selection of 21 treebanks. |
| Outcome: | The proposed approach favours content words over function words as heads of dependency relations, while the other favours syntactic heads. |
An Empirical Investigation of Error Types in Vietnamese Parsing (C18-1)
Copied to clipboard
| Challenge: | Syntactic parsing improves the quality of natural language processing tasks. |
| Approach: | They evaluated Vietnamese Treebank model to find most suitable parsing method . they found that Vietnamese parsers produced limited training data and POS errors . |
| Outcome: | The proposed method improves the parsing quality in Vietnamese . the results highlight three possible sources of parser errors . |
World to Code: Multi-modal Data Generation via Self-Instructed Compositional Captioning and Filtering (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in Vision-Language Models and the scarcity of high-quality multi-modal alignment data have inspired numerous researches on synthetic VLM data generation. |
| Approach: | They propose a multi-modal data construction pipeline that organizes the final output into a Python code format. |
| Outcome: | The proposed pipeline improves visual question answering and visual grounding benchmarks across different VLMs. |
Human and LLM-Based Resume Matching: An Observational Study (2025.findings-naacl)
Copied to clipboard
Swanand Vaishampayan, Hunter Leary, Yoseph Berhanu Alebachew, Louis Hickman, Brent A. Stevenor, Weston Beck, Chris Brown
| Challenge: | Resume matching assesses the extent to which candidates qualify for jobs based on the content of resumes. |
| Approach: | They compare GPT-4 and human ratings for resumes submitted to job openings from diverse fields using real-world evaluation criteria. |
| Outcome: | The proposed model improves the quality of LLM ratings and does not show bias. |
Quantifying training challenges of dependency parsers (C18-1)
Copied to clipboard
| Challenge: | a new metric is introduced to evaluate the difficulty to learn a given class of dependencies . a series of systematic computations using that metric have revealed interesting properties of the 3 considered parsing algorithms . |
| Approach: | They introduce a new metric to evaluate the difficulty to learn a given class of dependencies . they use it to characterize the information conveyed by cross-lingual parsers . |
| Outcome: | The proposed metric reveals the kind of dependencies that require high effort during training . it also shows that cross-lingual parsers can provide better quality information . |
What do character-level models learn about morphology? The case of dependency parsing (D18-1)
Copied to clipboard
| Challenge: | morphologically rich languages require character-level input models to learn morphology, but some models are poor at disambiguating some words . authors of this study show that character- level models learn a lot from input input . explicit modeling of morphologies is expensive and expensive, authors say . |
| Approach: | They compare character-level models to an oracle with explicit morphological analysis . they show that explicitly modeling morphology improves their best model . |
| Outcome: | The results show that character-level models learn morphology better than word models . the authors compare character-based models to oracles on 12 languages with morphological typologies . |
Correcting on Graph: Faithful Semantic Parsing over Knowledge Graphs with Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Complex multi-hop questions require comprehensive retrieval and reasoning. |
| Approach: | They propose a semantic parsing framework to establish faithful logical queries that connect LLMs and knowledge graphs. |
| Outcome: | The proposed framework outperforms state-of-the-art KGQA methods on knowledge-intensive questions. |
Pushing the Limits of AMR Parsing with Self-Learning (2020.findings-emnlp)
Copied to clipboard
Young-Suk Lee, Ramón Fernandez Astudillo, Tahira Naseem, Revanth Gangi Reddy, Radu Florian, Salim Roukos
| Challenge: | Abstract Meaning Representation (AMR) parsing has experienced a notable growth in performance in the last two years due to the impact of transfer learning and the development of novel architectures specific to AMR. |
| Approach: | They propose to use AMR annotations to generate synthetic text and refine actions oracle without additional human annotations for AMR parsing. |
| Outcome: | The proposed models improve on AMR 1.0 and 2.0 without human annotations. |
Parse Me if You Can: Artificial Treebanks for Parsing Experiments on Elliptical Constructions (L18-1)
Copied to clipboard
| Challenge: | ellipsis is a phenomenon present in many natural languages, but it complicates syntactic parsing of the content that is not omitted. |
| Approach: | They analyze outputs of state-of-the-art parsers to learn about parsing accuracy and typical errors from the perspective of elliptical constructions. |
| Outcome: | The proposed treebank is a semi-artificially constructed treebank of ellipsis. |
An Investigation of the Interactions Between Pre-Trained Word Embeddings, Character Models and POS Tags in Dependency Parsing (D18-1)
Copied to clipboard
| Challenge: | Existing studies have shown that character models are less important in the presence of word embeddings, but combining them quickly leads to diminishing returns. |
| Approach: | They propose to combine pre-trained word embeddings, character models and POS tags to improve parsing quality by categorising words by frequency, POS tag and language. |
| Outcome: | The proposed system improves on initialised word embeddings but combines them quickly leads to diminishing returns. |
Depth-bounding is effective: Improvements and evaluation of unsupervised PCFG induction (D18-1)
Copied to clipboard
| Challenge: | Recent attempts to improve grammar induction systems by bounding complexity of the model have not been compared against unbounded induction models. |
| Approach: | They propose to use a Bayesian induction inducer to limit the search space of the model and then sample trees with or without bounding. |
| Outcome: | The proposed model produces trees more accurately than or competitively with state-of-the-art constituency grammar induction models. |
A Second Wave of UD Hebrew Treebanking and Cross-Domain Parsing (2022.emnlp-main)
Copied to clipboard
| Challenge: | Foundational Hebrew NLP tasks have relied on various versions of the Hebrew Treebank . however, the data in the HTB is now over 30 years old and does not cover many aspects of contemporary Hebrew on the web. |
| Approach: | They propose to use Hebrew Wikipedia to stratify the text from a UD treebank. |
| Outcome: | The proposed treebank is based on a single-source newswire corpus selected from Hebrew Wikipedia. |
HPE: Answering Complex Questions over Text by Hybrid Question Parsing and Execution (2023.findings-emnlp)
Copied to clipboard
| Challenge: | End-to-end neural networks excel at answering natural language questions but fail on complex ones . a proposed framework for question parsing and execution on textual QA is designed to combine the strengths of neural and symbolic methods. |
| Approach: | They propose a framework for question parsing and execution on textual QA . they parse questions into an intermediate representation and use deterministic rules to translate them . |
| Outcome: | The proposed framework outperforms existing methods in supervised, few-shot, and zero-shot settings while preserving its underlying reasoning process. |
RST Discourse Parsing with Second-Stage EDU-Level Pre-training (2022.acl-long)
Copied to clipboard
| Challenge: | Existing pre-trained language models (PLMs) are based on sentence-level pre-training, which is different from the basic processing unit, i.e. element discourse unit (EDU). |
| Approach: | They propose a second-stage EDU-level pre-training approach to learn effective EDU representations continually based on well pre-trained language models. |
| Outcome: | The proposed method improves F1 score by 2.1 points on a benckmark dataset. |
Measuring Innovation in Speech and Language Processing Publications. (L18-1)
Copied to clipboard
| Challenge: | The authors of this paper analyze the publications in the field of speech and language processing. |
| Approach: | They propose to analyze publications in the field of speech and language processing to measure innovation . they use the corpus of papers published over 50 years and enlarge it to the SNLP corpus . |
| Outcome: | The proposed method enlarges the corpus of 65,003 documents published over 50 years to the Speech and Language Processing (SNLP) corpus. |
FlauBERT: Unsupervised Language Model Pre-training for French (2020.lrec-1)
Copied to clipboard
Hang Le, Loïc Vial, Jibril Frej, Vincent Segonne, Maximin Coavoux, Benjamin Lecouteux, Alexandre Allauzen, Benoit Crabbé, Laurent Besacier, Didier Schwab
| Challenge: | Language models are a key step to achieve state-of-the-art results in many different Natural Language Processing (NLP) tasks. |
| Approach: | They propose to use a language model that is pre-trained on a large and heterogeneous French corpus to train continuous word representations. |
| Outcome: | The proposed model outperforms existing models on a large and heterogeneous French corpus. |
Efficient Second-Order TreeCRF for Neural Dependency Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | In the deep learning (DL) era, dependency parsing models are extremely simplified with little hurt on performance thanks to the remarkable capability of multi-layer BiLSTMs in context representation. |
| Approach: | They propose to extend the biaffine parser to a second-order TreeCRF extension to reduce the complexity of the inside-outside algorithm. |
| Outcome: | The proposed extension can be used to batchify the inside and Viterbi algorithms and avoid the complex outside algorithm via efficient back-propagation. |
ABCD: A Graph Framework to Convert Complex Sentences to a Covering Set of Simple Sentences (2021.acl-long)
Copied to clipboard
| Challenge: | Existing work relies on rule-based methods dependent on parsing to identify atomic sentences. |
| Approach: | They propose a task to decompose complex sentences into simple ones . they propose atomic clauses as atomic sentences, and a graph edit task to predict edits . |
| Outcome: | The proposed model performs better than baselines on MinWiki and DeSSE. |
Adversarial Learning for Discourse Rhetorical Structure Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | Existing top-down discourse rhetorical structure parsers make local decisions and ignore global parsing. |
| Approach: | They propose a method to transform gold standard and predicted constituency trees into tree diagrams with two color channels. |
| Outcome: | The proposed method improves performance on RST-DT and CDTB corpora and can leverage global context. |
Annotations Matter: Leveraging Multi-task Learning to Parse UD and SUD (2021.findings-acl)
Copied to clipboard
| Challenge: | Multi-task learning (MTL) has shown promise in various NLP tasks such as semantic dependency parsing. |
| Approach: | They propose to use two parallel treebanks to improve parsing performance. |
| Outcome: | The proposed model is based on two parallel treebanks with similar annotation schemes but differing in linguistic annotation preferences. |
Substructure Substitution: Structured Data Augmentation for NLP (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing work focuses on word-level manipulation or global sequence-to-sequence style generation. |
| Approach: | They propose a family of data augmentation methods that generalize prior methods by substituting substructures with others having the same label. |
| Outcome: | The proposed methods can be applied to many structured NLP tasks such as part-of-speech tagging and parsing. |
Improved Dependency Parsing using Implicit Word Connections Learned from Unlabeled Data (D18-1)
Copied to clipboard
| Challenge: | Pre-trained word embeddings and language models cannot capture word connections in a sentence. |
| Approach: | They propose to implicitly capture word connections from unlabeled data by word ordering model with self-attention mechanism. |
| Outcome: | The proposed model achieves 96.35% UAS and 95.25% LAS on the English PTB dataset. |
A Framework for Understanding the Role of Morphology in Universal Dependency Parsing (D18-1)
Copied to clipboard
| Challenge: | a measure of morphological complexity is used to characterize syntactic information in word embeddings. |
| Approach: | They propose a measure of morphological complexity in terms of governor-dependent preferential attachment that explains parsing performance. |
| Outcome: | The proposed framework improves parsing performance on morphologically rich languages using morphology as a syntactic marker. |
Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars (2023.acl-long)
Copied to clipboard
| Challenge: | a recent study shows that context-free grammars are not natural for modeling discontinuous language phenomena such as extrapositions and cross-serial dependencies. |
| Approach: | They propose a grammar induction approach with mildly context-sensitive grammars for unsupervised discontinuous parsing. |
| Outcome: | Experiments on German and Dutch show that the proposed grammar induction method is beneficial for unsupervised parsing. |
Fast semantic parsing with well-typedness guarantees (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing algorithms for AM dependency parsing are slow and do not support linguistic principles. |
| Approach: | They propose an A* parser and a transition-based parsing algorithm which guarantee well-typedness and improve parse speed by up to 3 orders of magnitude. |
| Outcome: | The proposed algorithms guarantee well-typedness and improve parsing speed by up to 3 orders of magnitude while maintaining or improving accuracy. |
End-to-End AMR Coreference Resolution (2021.acl-long)
Copied to clipboard
| Challenge: | Existing work on AMR focuses on individual sentences, but there is a need for multi-sentence AMRs. |
| Approach: | They propose to use an end-to-end AMR coreference resolution model to generate multi-sentence AMRs. |
| Outcome: | The proposed model reduces error propagation and is more robust for both in- and out-domain situations. |
Semi-supervised Domain Adaptation for Dependency Parsing via Improved Contextualized Word Representations (2020.coling-main)
Copied to clipboard
| Challenge: | Recent advances in deep neural network models have improved parsing performance on in-domain texts . however, the problem is to improve performance on out-of-domain text data when there is only a small-scale out-domain labeled data. |
| Approach: | They propose to use adversarial learning and fine-tuning BERT to improve contextualized word representations on out-of-domain texts. |
| Outcome: | The proposed models achieve consistent improvement and fine-tune BERT processes boost parsing accuracy by a large margin. |
Graph-Based Decoding for Task Oriented Semantic Parsing (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing paradigms for semantic parsing are sequence-to-sequence and AMR parsers. |
| Approach: | They propose to formulate parsing as a sequence-to-sequence task using graph-based decoding techniques developed for syntactic parsers. |
| Outcome: | The proposed approach is competitive with sequence decoders on the standard setting and offers significant improvements in data efficiency and data availability. |
Neural Chinese Address Parsing (N19-1)
Copied to clipboard
| Challenge: | Recent research shows that systems that perform address parsing can be useful for building e-commerce or product recommendation systems. |
| Approach: | They propose a task of parsing Chinese addresses into semantically meaningful chunks using a linear-chain structure. |
| Outcome: | The proposed model is able to capture complex dependencies between labels that cannot be readily captured by a simple linear-chain structure. |
Towards Knowledge-Intensive Text-to-SQL Semantic Parsing with Formulaic Knowledge (2022.emnlp-main)
Copied to clipboard
Longxu Dou, Yan Gao, Xuqi Liu, Mingyang Pan, Dingzirui Wang, Wanxiang Che, Dechen Zhan, Min-Yen Kan, Jian-Guang Lou
| Challenge: | Existing approaches to text-to-SQL require domain knowledge to parse expert questions into SQL queries. |
| Approach: | They propose a framework to leverage domain knowledge during parsing by building a new benchmark KnowSQL with domain-specific questions. |
| Outcome: | The proposed framework improves the performance of the proposed benchmark by 28.2%. |
A Parser for LTAG and Frame Semantics (L18-1)
Copied to clipboard
| Challenge: | Existing parsers for Lexicalized Tree Adjoining Grammars and frame semantics are difficult to use due to the size of the resources to develop. |
| Approach: | They propose a parser which uses Lexicalized Tree Adjoining Grammars and frame semantics to combine them. |
| Outcome: | The proposed grammars are based on Lexicalized Tree Adjoining Grammars and frame semantics. |
Data-to-text Generation by Splicing Together Nearest Neighbors (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on data-to-text generation relies on retrieved "neighbors" but instead generates text token-by-token, left-to right. |
| Approach: | They propose to splice together retrieved segments of text from "neighbor" source-target pairs to generate text token-by-token, left-to-right. |
| Outcome: | The proposed method performs on par with strong baselines in terms of automatic and human evaluation, but allows for more interpretable and controllable generation. |
Language Model Based Unsupervised Dependency Parsing with Conditional Mutual Information and Grammatical Constraints (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing methods for unsupervised dependency parsing use difficult to interpret dependence scores. |
| Approach: | They propose to use Conditional Mutual Information (CMI) to measure bi-lexical dependence and incorporate grammatical constraints into unsupervised parsing. |
| Outcome: | The proposed model outperforms state-of-the-art models and grammar-based models in five languages and eight datasets. |
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing open-source MLLMs fail to fully capture dense information embedded in charts . current models still face significant challenges in understanding and analyzing visual tasks such as captioning and question answering. |
| Approach: | They propose a chart-to-code MLLM which leverages Code LLMs as the language backbone to enhance the executability of the generated code. |
| Outcome: | The proposed model surpasses existing open-source models on chart-to-code benchmarks with only 7B parameters and provides lossless representations that contain all critical details. |
A Pilot Study of Text-to-SQL Semantic Parsing for Vietnamese (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Semantic parsing is an important NLP task, but Vietnamese is a low-resource language. |
| Approach: | They extend EditSQL and IRNet semantic parsing baselines on Vietnamese datasets . they find automatic Vietnamese word segmentation improves parser results . |
| Outcome: | The proposed dataset improves on two strong parsing baselines for Vietnamese . the monolingual language model PhoBERT improves over the best multilingual language models. |
NLP Whack-A-Mole: Challenges in Cross-Domain Temporal Expression Extraction (N19-1)
Copied to clipboard
| Challenge: | Temporal resolution is an NLP task that is domain-agnostic because of limited lexicons. |
| Approach: | They propose to use a temporal resolution tool built on Newswire text to parse clinical notes in the THYME corpus. |
| Outcome: | The proposed system outperforms current state-of-the-art systems on the THYME corpus with little change in its performance on Newswire texts. |
Neural Ranking Models for Temporal Dependency Structure Parsing (D18-1)
Copied to clipboard
| Challenge: | a new neural temporal dependency parser is being developed for news reports and narrative stories . a similar system is used for other NLP applications such as timeline construction . |
| Approach: | They build a neural temporal dependency parser that parses time expressions and events in a text . their results shed light on the nature of temporal relation structures in different domains . |
| Outcome: | The proposed model beats baselines on news reports and narrative stories on two data domains. |
Unifying Multimodal Retrieval via Document Screenshot Embedding (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing document retrieval pipelines require document parsing and content extraction to prepare input for indexing. |
| Approach: | They propose a retrieval paradigm that regards document screenshots as a unified input format . they leverage a large vision-language model to directly encode document screenshot into dense representations . |
| Outcome: | The proposed method outperforms existing retrieval pipelines in a text-intensive context. |
Llamipa: An Incremental Discourse Parser (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Discourse parsing is a task of predicting relationships between utterances and their semantic content . lack of surface cues in discourse graphs forces parsers to rely on deep, semantic information . a large language model (LLM) can significantly improve discourse parser performance . |
| Approach: | They propose a large language model (LLM) that leverages discourse context to parse a discourse . this model provides local, context-sensitive representations of discourse units . |
| Outcome: | The proposed model can provide local, context-sensitive representations of discourse units . it can process discourse data incrementally, which is essential for later use of discourse information . |
Improving Low-resource RRG Parsing with Cross-lingual Self-training (2022.coling-1)
Copied to clipboard
| Challenge: | a theoretical framework for low-resource parsing is understudied in computational linguistics but widely used in typological research . a novel approach uses Role and Reference Grammar to parse low-source languages . |
| Approach: | They propose to extend an existing RRG parser into a cross-lingual parsing model . they also adopt self-training to adapt the model to a related language with no trees . |
| Outcome: | The proposed model extends into a cross-lingual parser, and iteratively expands the training data. |
Large Language Models Are No Longer Shallow Parsers (2024.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have reshaped the field of natural language processing (NLP) however, fundamental NLP tasks that involve linguistic analysis still play essential roles in the field. |
| Approach: | They propose to use constituency parsing to improve performance of LLMs on deep syntactic parse trees to prompt LLM chunking, filter out low-quality chunks and add remaining chunks to prompts to instruct LLM for parser. |
| Outcome: | The proposed approach improves LLMs' performance on constituency parsing on English and Chinese benchmark datasets. |
A Survey of AMR Applications (2024.emnlp-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a semantic representation that takes the form of a rooted, directed graph. |
| Approach: | They analyze more than 100 papers which use Abstract Meaning Representation (AMR) they highlight the range of applications for which AMR has been harnessed and techniques for incorporating it . they also highlight broader AMR engineering patterns and outline areas of future work that seem ripe for AMR incorporation. |
| Outcome: | The results highlight the range of applications for which AMR has been harnessed and the techniques for incorporating it into those applications. |
4 and 7-bit Labeling for Projective and Non-Projective Dependency Trees (2023.emnlp-main)
Copied to clipboard
| Challenge: | encodings that map trees into sequences of one discrete label per word have been proposed for constituency parsing and dependency parse. |
| Approach: | They propose an encoding that can represent any projective dependency tree as a sequence of 4-bit labels, one per word. |
| Outcome: | The proposed encoding achieves substantial accuracy gains over the previously best-performing sequence labeling encoders. |
Core Semantic First: A Top-down Approach for AMR Parsing (D19-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsing is a semantic formalism that encodes the meaning of a sentence as a rooted labeled directed graph. |
| Approach: | They propose a scheme for parsing text into its Abstract Meaning Representation (AMR) using Graph Spanning based Parsing. |
| Outcome: | The proposed scheme achieves state-of-the-art on the latest AMR sembank and no heuristic graph re-categorization is adopted. |
On the Relation between Syntactic Divergence and Zero-Shot Performance (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in cross-lingual transfer methods have enabled significant advances in grammatical processing tasks. |
| Approach: | They examine the extent to which syntactic relations are preserved in translation and parsability in a zero-shot setting. |
| Outcome: | The proposed model is based on a translation task in English and a subset of a standard English RE benchmark translated to Russian and Korean. |
A Broad-Coverage Deep Semantic Lexicon for Verbs (2020.lrec-1)
Copied to clipboard
| Challenge: | a lack of a broad-coverage deep semantic lexicon hinders deep language understanding . we have developed a resource for verbs with the coverage of WordNet and syntactic and semantic details . |
| Approach: | They propose a deep lexical resource for verbs with the coverage of WordNet and syntactic and semantic details that meet or exceed existing resources. |
| Outcome: | The proposed resource has the coverage of WordNet and syntactic and semantic details that exceed existing resources. |
TaPas: Weakly Supervised Table Parsing via Pre-training (2020.acl-main)
Copied to clipboard
| Challenge: | Answering natural language questions over tables is often seen as a semantic parsing task. |
| Approach: | They propose an approach to question answering over tables without generating logical forms by selecting table cells and optionally applying a corresponding aggregation operator. |
| Outcome: | The proposed approach outperforms or rivals existing models on three different datasets and performs on par with the state-of-the-art on WikiSQL and WikiTQ. |
On the Branching Bias of Syntax Extracted from Pre-trained Language Models (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for extracting constituency trees from language models suffer from branching bias. |
| Approach: | They propose to measure the branching bias by comparing the performance gap on a language and its reversed language. |
| Outcome: | The proposed method is agnostic to language models and extracting methods, and it can be implemented with three factors to introduce the branching bias. |
MC2: A Minimum-Coverage and Dataset-Agnostic Framework for Compositional Generalization of LLMs on Semantic Parsing (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing research relies on dataset-specific designs or a large number of samples to improve compositional generalization of large language models (LLMs) . |
| Approach: | They propose a minimum-coverage framework that can help LLMs achieve compositional generalization by selecting and organizing samples that satisfy the primitive coverage. |
| Outcome: | The proposed framework can improve compositional generalization on different parsing datasets in the minimum-coverage setting. |
Stacked AMR Parsing with Silver Data (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Lack of large-scale annotated data is one main challenge for abstract meaning representation (AMR) parsing. |
| Approach: | They propose to use silver data to train a pre-trained abstract meaning representation model. |
| Outcome: | The proposed model outperforms previous models on the AMR2.0 dataset and is faster than the SOTA model. |
Acquired TASTE: Multimodal Stance Detection with Textual and Structural Embeddings (2025.coling-main)
Copied to clipboard
| Challenge: | Prior work has demonstrated the importance of the conversational context in stance detection. |
| Approach: | They propose a multimodal architecture for stance detection that fuses transformer-based content embedding with unsupervised structural embeddment. |
| Outcome: | The proposed model outperforms strong baselines on common benchmarks and outperformed existing models on common frameworks. |
An Exploration of Arbitrary-Order Sequence Labeling via Energy-Based Inference Networks (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent work shows that conditional random fields (CRFs) perform well in sequence labeling tasks. |
| Approach: | They propose several high-order energy terms to capture dependencies among labels in sequence labeling . they use convolutional, recurrent, and self-attention networks to construct these energy terms . |
| Outcome: | The proposed approach improves on four sequence labeling tasks while having the same decoding speed as simple classifiers. |
A Conditional Splitting Framework for Efficient Constituency Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | Developing efficient and effective parsing solutions has always been a key focus in NLP. |
| Approach: | They propose a generic seq2seq parsing framework that casts constituency parsers into a series of conditional splitting decisions. |
| Outcome: | The proposed framework outperforms state-of-the-art (SoTA) methods in discourse parsing . it is based on a syntactic and discourse parsed model and is linear in number of nodes . |
BERT Rediscovers the Classical NLP Pipeline (P19-1)
Copied to clipboard
| Challenge: | Pre-trained text encoders have advanced the state of the art on many NLP tasks . Qualitative analysis reveals that the model can and often does adjust this pipeline dynamically . |
| Approach: | They aim to quantify where linguistic information is captured within a network model . they aim to use pre-trained text encoders to displace static word embeddings . |
| Outcome: | The proposed model can adjust the pipeline dynamically, revealing lower-level decisions on the basis of disambiguation from higher-level representations. |
Explore Unsupervised Structures in Pretrained Models for Relation Extraction (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Syntactic trees are widely used in relation extraction (RE) but they are not stable on different text domains and a pre-defined grammar may not fit the target relation schema. |
| Approach: | They propose to use unsupervised structures to extract relation extraction models . they also conduct detailed analyses on their abilities of adapting new RE domains . |
| Outcome: | The proposed models obtain competitive (even the best) performance scores on benchmark RE datasets. |
Another Dead End for Morphological Tags? Perturbed Inputs and Parsing (2023.findings-acl)
Copied to clipboard
| Challenge: | Part-of-speech tags are used for word-contextualized parsers, but their impact is limited to word-based models. |
| Approach: | They propose an adversarial attack to test whether morphological tags contribute to error propagation or correct parsing mistakes. |
| Outcome: | The proposed attack on 14 treebanks shows that if morphological tags were utopically robust against lexical perturbations, they would be able to correct parsing mistakes. |
Deciphering and Characterizing Out-of-Vocabulary Words for Morphologically Rich Languages (2022.coling-1)
Copied to clipboard
| Challenge: | a detailed empirical case study of out-of-vocabulary words in modern text is presented . unfamiliar words cause trouble for machine processing or comprehension of text, authors say . |
| Approach: | They propose a detailed empirical case study of the nature of out-of-vocabulary words encountered in modern text in a moderate-resource language such as Bulgarian . they apply a multi-faceted distributional analysis of the underlying word-formation processes to characterize the residual vocabulary . |
| Outcome: | The proposed method can be used to aid in compositional translation, parsing, language modeling, and other NLP tasks. |
TwittIrish: A Universal Dependencies Treebank of Tweets in Modern Irish (2022.acl-long)
Copied to clipboard
| Challenge: | Modern Irish is a minority language lacking computational resources for accurate automatic syntactic parsing of user-generated content. |
| Approach: | They propose to use a treebank to facilitate natural language parsing of user-generated content in Irish. |
| Outcome: | The proposed treebank enables natural language processing of user-generated content in Irish. |
KINNEWS and KIRNEWS: Benchmarking Cross-Lingual Text Classification for Kinyarwanda and Kirundi (2020.coling-main)
Copied to clipboard
| Challenge: | low-resource African languages are traditionally left behind because of the lack of well-annotated data and effective preprocessing. |
| Approach: | They propose two news datasets for multi-class classification of news articles in two low-resource African languages. |
| Outcome: | The proposed datasets show that training embeddings on the higher-resourced Kinyarwanda yields successful cross-lingual transfer to Kirundi. |
Yet Another Format of Universal Dependencies for Korean (2022.coling-1)
Copied to clipboard
Yige Chen, Eunkyul Leah Jo, Yundong Yao, KyungTae Lim, Miikka Silfverberg, Francis M. Tyers, Jungyeul Park
| Challenge: | Existing dependency parsers for Korean do not perform as well as their English counterparts due to the complexity of Korean's linguistic features. |
| Approach: | They propose a morpheme-based Korean dependency parsing format and propose to adopt it to Universal Dependencies. |
| Outcome: | The proposed format outperforms parsing results for Korean UD treebanks and detailed error analysis. |
Supertagging Combinatory Categorial Grammar with Attentive Graph Convolutional Networks (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have focused on supertagging but have not tapped into contextual information. |
| Approach: | They propose to build a graph from chunks extracted from a lexicon and apply attention over it to enhance supertagging by leveraging contextual information. |
| Outcome: | The proposed approach outperforms previous studies in terms of supertagging and parsing. |
NL2Bash: A Corpus and Semantic Parser for Natural Language Interface to the Linux Operating System (L18-1)
Copied to clipboard
| Challenge: | NL2Bash is a new semantic parsing problem for mapping English sentences to Bash commands. |
| Approach: | They propose a dataset of English commands and expert-written Bash commands to map English sentences to Bash. |
| Outcome: | The proposed methods are significantly larger (from two to ten times) than most existing benchmarks. |
Efficient AMR Parsing with CLAP: Compact Linearization with an Adaptable Parser (2024.lrec-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsers face efficiency challenges because of their large model size and computational time, which limit their accessibility within the research community. |
| Approach: | They propose a novel linearization system that simplifies encoding and reduces the number of tokens by between 40% and 50%. |
| Outcome: | The proposed system reduces the number of tokens by 40% and 50% while maintaining high performance while reducing training and inference times. |
A Simple and Strong Baseline for End-to-End Neural RST-style Discourse Parsing (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing discourse parsing methods need a strong baseline for reporting reliable experimental results. |
| Approach: | They integrate existing parsing strategies with transformer-based pre-trained language models to provide a strong baseline for reporting reliable experimental results. |
| Outcome: | The proposed model outperforms the current best model using DeBERTa. |
End-to-end Parsing of Procedural Text into Flow Graphs (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing flow graph parsers lack sufficient annotated data to train them . a lack of annotation can cause costly training, and poor flow graph training results in a large improvement. |
| Approach: | They propose a multi-task framework that performs tagging and graph generation simultaneously . they take advantage of the abundance of unlabelled recipes and generate noisy silver annotations . |
| Outcome: | The proposed model can unify the input representation and use compact encoders, resulting in small models with significantly fewer parameters than existing models. |
Sequence Labeling Parsing by Learning across Representations (P19-1)
Copied to clipboard
| Challenge: | Constituency and dependency parsing are the main abstractions for representing syntactic structure of sentences . constituency parsers are considered disjointed tasks, and their improvements have been obtained separately. |
| Approach: | They propose to add auxiliary loss to constituency parsing paradigms and explore a model that parses both paradigms at no cost. |
| Outcome: | The proposed model outperforms single-task models by 1.05 F1 points and 0.62 UAS points for constituency parsing and dependency parsers. |
Is the Brain Mechanism for Hierarchical Structure Building Universal Across Languages? An fMRI Study of Chinese and English (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have shown that the brain builds hierarchical syntactic structures, but it is unknown whether they are universal across languages. |
| Approach: | They analyze the working memory requirements when applying parsing strategies to two languages: Chinese and English. |
| Outcome: | The proposed method shows that the brain adopts parsing strategies with less memory load according to different language structures. |
A Split-and-Recombine Approach for Follow-up Query Analysis (D19-1)
Copied to clipboard
| Challenge: | Context-dependent semantic parsing has proved to be an important but challenging task. |
| Approach: | They propose to perform follow-up query analysis to restate context-dependent queries with contextual information. |
| Outcome: | The proposed approach outperforms the state-of-the-art by nearly 8% on the FollowUp dataset . the extensibility of STAR on the SQA dataset is also promising . |
Semantic Captioning: Benchmark Dataset and Graph-Aware Few-Shot In-Context Learning for SQL2Text (2025.coling-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown remarkable performance in various NLP tasks, including semantic parsing, which translates natural language into formal code representations. |
| Approach: | They propose a semantic captioning task to repurpose semantic parsing datasets for semantic captions. |
| Outcome: | The proposed model outperforms random selection and other methods by 39% on BLEU score. |
Identifying Domain Adjacent Instances for Semantic Parsers (D18-1)
Copied to clipboard
| Challenge: | Semantic parsers map text to logical forms, which can then be used by downstream components to fulfill an action. |
| Approach: | They propose a simple sentence representation that emphasizes unexpected words . they formalize domain-adjacency problem and propose logical form representations . |
| Outcome: | The proposed approach improves the performance of a downstream semantic parser on in-domain and domain-adjacent instances. |
Dependency Parsing via Sequence Generation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing are transition-based, graph-based and sequence-to-sequence method. |
| Approach: | They propose to achieve dependency parsing (DP) via Sequence Generation (SG) by utilizing only the pre-trained language model without any auxiliary structures. |
| Outcome: | The proposed method performs well on DP benchmarks including PTB, UD2.2, SDP15 and SemEval16. |
Linguistically-Informed Self-Attention for Semantic Role Labeling (D18-1)
Copied to clipboard
| Challenge: | Existing models of semantic role labeling use no explicit linguistic features. prior work has shown that syntax trees can dramatically improve SRL decoding. |
| Approach: | They propose a neural network model that incorporates syntax using only raw tokens . they show that LISA out-performs the state-of-the-art with contextually-encoded word representations a 1.0 F1 on newswire and 2.0 F1 in out-of domain text . |
| Outcome: | The proposed model outperforms the state-of-the-art model with word embeddings and predicted predicates. |
LLM-Supported Natural Language to Bash Translation (2025.naacl-long)
Copied to clipboard
| Challenge: | Using the natural language to Bash command (NL2SH) for command composition is difficult due to inaccurate test data and unreliable heuristics for determining the functional equivalence of Bash commands. |
| Approach: | They propose to use a heuristic to determine the functional equivalence of two Bash commands with 95% confidence, a 16% increase over previous heurs. |
| Outcome: | The proposed heuristic can determine the functional equivalence of two Bash commands with 95% confidence, a 16% increase over previous heurs. |
Transition-based Bubble Parsing: Improvements on Coordination Structure Prediction (2021.acl-long)
Copied to clipboard
| Challenge: | Existing bubble representations encoding coordination boundaries and internal relationships are difficult to detect and parse . |
| Approach: | They propose a bubble parser to perform coordination structure identification and dependency-based syntactic analysis simultaneously. |
| Outcome: | The proposed bubble parser beats state-of-the-art approaches on coordination structure prediction . the proposed system is based on a GENIA corpus and a Penn treebank . |
Rule-KBQA: Rule-Guided Reasoning for Complex Knowledge Base Question Answering with Large Language Models (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge base question answering lack grammaticality, faithfulness, and controllability due to hallucinations in the reasoning process. |
| Approach: | They propose a framework that employs learned rules to guide the generation of logical forms. |
| Outcome: | The proposed method achieves competitive results on standard KBQA datasets. |
CoMuMDR: Code-mixed Multi-modal Multi-domain corpus for Discourse paRsing in conversations (2025.findings-acl)
Copied to clipboard
| Challenge: | Discourse parsing datasets based on conversations are restricted to a single domain . a lack of discourse structures in audio-based conversations is a challenge . |
| Approach: | They introduce CoMuMDR: Code-mixed Multi-modal Multi-domain corpus for Discourse parsing in conversations. |
| Outcome: | The proposed corpus is code-mixed in Hindi and English and annotated with nine discourse relations. |
A Top-down Neural Architecture towards Text-level Parsing of Discourse Rhetorical Structure (2020.acl-main)
Copied to clipboard
| Challenge: | Text-level discourse parsing of discourse rhetorical structure (DRS) is a fundamental research topic in natural language processing. |
| Approach: | They propose a top-down neural architecture for text-level discourse parsing . they cast the parser as a recursive split point ranking task . |
| Outcome: | The proposed top-down approach is more suitable for text-level discourse parsing. |
Interactive-KBQA: Multi-Turn Interactions for Knowledge Base Question Answering with Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Knowledge base question answering (KBQA) is a challenging task, particularly in parsing intricate questions into executable logical forms. |
| Approach: | They propose a framework to generate logical forms through direct interaction with knowledge bases (KBs) by annotating a dataset with step-wise reasoning processes. |
| Outcome: | The proposed framework achieves competitive results on the WebQuestionsSP, ComplexWebQuestIONS, KQA Pro, and MetaQA datasets with a minimal number of examples (shots). Importantly, the proposed model supports manual intervention, allowing for the iterative refinement of LLM outputs. |
Zero-Shot Classification by Logical Reasoning on Natural Language Explanations (2023.findings-acl)
Copied to clipboard
| Challenge: | Experimental results show that CLORE is superior to baselines on zero-shot classification tasks. |
| Approach: | They propose a framework for classification by logically parsing and reasoning on natural language explanations. |
| Outcome: | The proposed framework outperforms baselines on zero-shot classification tasks. |
Working Hard or Hardly Working: Challenges of Integrating Typology into Neural Dependency Parsers (D19-1)
Copied to clipboard
| Challenge: | linguistic typology has shown great promise in pre-neural parsing, but results for neural architectures have been mixed. |
| Approach: | They explore the task of leveraging typology in the context of cross-lingual dependency parsing. |
| Outcome: | The proposed approach improves performance in the context of cross-lingual dependency parsing. |
Bilingual Rhetorical Structure Parsing with Large Parallel Annotations (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing large RST corpora are inconsistent in annotation guidelines, genre representation, source selection, and relation definitions. |
| Approach: | They propose a parallel Russian annotation for a large and diverse English GUM RST corpus. |
| Outcome: | The proposed RST parser achieves state-of-the-art results on English and Russian corpus . it demonstrates effectiveness in monolingual and bilingual settings, transferring even with limited second-language annotation. |
Video Discourse Parsing and Its Application to Multimodal Summarization: A Dataset and Baseline Approaches (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Fig. 1 shows the video's story structure and event relationships in discourse parsing. |
| Approach: | They propose to construct an RST tree for a video to represent its storyline and illustrate the event relationships between events. |
| Outcome: | The proposed model outperforms two existing approaches to video RST parsing: the ‘parsing after captioning’ framework and parser using visual features. |
Split or Merge: Which is Better for Unsupervised RST Parsing? (D19-1)
Copied to clipboard
| Challenge: | Rhetorical Structure Theory (RST) parsers have been based on supervised learning approaches that require an annotated corpus of sufficient size and quality. |
| Approach: | They propose two unsupervised methods that build an optimal RST tree based on a dissimilarity score function for splitting a text span into smaller ones and a similarity score for merging two adjacent spans into a large one. |
| Outcome: | The proposed method achieves the best score on English and German RST treebanks, around 0.8 F1 score, close to the previous supervised parsers. |
EventGround: Narrative Reasoning by Grounding to Eventuality-centric Knowledge Graphs (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing frameworks for leveraging background knowledge of narratives are limited. |
| Approach: | They propose a framework to ground free-texts to eventuality-centric KGs for narrative reasoning . their framework is based on a set of probabilistic probabilistic models that are grounded in the real world . |
| Outcome: | The proposed framework outperforms baseline models while providing interpretable evidence. |
Statistical Parsing of Tree Wrapping Grammars (2020.coling-main)
Copied to clipboard
| Challenge: | Using tree-wrapping grammars, we propose a statistical parsing algorithm for the grammar. |
| Approach: | They propose a statistical parsing algorithm based on neural supertagging and A* parse for Tree-Wrapping Grammars (TWG) they extract a grammar for English from constituency treebanks and discuss first parser results with this grammar. |
| Outcome: | The proposed algorithm is based on neural supertagging and A* parsing. |
On Parsing as Tagging (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to reduce constituency parsing to tagging are based on linearization, learning, and decoding . linearization of the derivation tree is the most critical factor in achieving accurate parsers as taggers . |
| Approach: | They propose a pipeline with three steps for reducing constituency parsing to tagging . they find that linearization and learning are critical factors for accurate parsers . |
| Outcome: | The proposed pipelines are linearized, learning, and decoded, and have three steps to achieve accurate parsing as taggers. |
DRTS Parsing with Structure-Aware Encoding and Decoding (2020.acl-main)
Copied to clipboard
| Challenge: | Discourse representation tree structure (DRTS) parsing is a new semantic parser which ignores structural information. |
| Approach: | They propose a structural-aware model to integrate structural information into the model . they use graph attention network (GAT) to exploit structural information for effective modeling . |
| Outcome: | The proposed model can achieve the best performance on a benchmark dataset. |
Discourse Representation Parsing for Sentences and Documents (P19-1)
Copied to clipboard
| Challenge: | Experimental results show that our model outperforms competitive baselines by a wide margin. |
| Approach: | They propose a neural model which parses discourse structures of arbitrary length and granularity. |
| Outcome: | The proposed model outperforms baseline models on sentence- and document-level benchmarks. |
Implementation and Evaluation of an LFG-based Parser for Wolof (2020.lrec-1)
Copied to clipboard
| Challenge: | a parsing system for Wolof is developed based on the Lexical Functional Grammar (LFG) system provides detailed syntactic analysis essential for the further development of NLP applications. |
| Approach: | They propose a parsing system for Wolof based on the Lexical Functional Grammar (LFG) system uses finite-state transducers for word tokenization and morphological analysis . |
| Outcome: | The proposed system achieves 67.2% recall, 92.8% precision and an f-score of 77.9%. |
Inherent Dependency Displacement Bias of Transition-Based Algorithms (2020.lrec-1)
Copied to clipboard
| Challenge: | Empirical studies have shown that performance varies across different treebanks in such a way that one algorithm outperforms another on one treebank and the reverse is true for a different tree bank. |
| Approach: | They introduce the concept of an algorithm’s inherent dependency displacement distribution and characterise its bias in terms of dependency displacement. |
| Outcome: | The proposed model shows that the similarity of an algorithm’s inherent dependency displacement distribution to a treebank’s displacement distribution is clearly correlated to the algorithm’ s parsing performance on that treebank. |
GRAIN-S: Manually Annotated Syntax for German Interviews (2020.lrec-1)
Copied to clipboard
| Challenge: | GRAIN-S is a set of manually created syntactic annotations for radio interviews in germany. |
| Approach: | They propose to use GRAIN-S to create syntactic annotations for radio interviews in germany. |
| Outcome: | The proposed dataset extends an existing corpus GRAIN and comes with constituency and dependency trees for six interviews. |
Improving Crowdsourcing-Based Annotation of Japanese Discourse Relations (L18-1)
Copied to clipboard
| Challenge: | Discourse parsing is an important task in natural language processing, but few languages have corpora annotated with discourse relations . crowdsourcing-based annotations are of poor quality and require expensive and time-consuming . et al. (2009) evaluated the quality of annotations using expert annotations. |
| Approach: | They construct a Japanese corpus with discourse annotations through crowdsourcing . they propose improvement techniques based on language tests . |
| Outcome: | The proposed methods improve the quality of the annotations, and will make them publicly available. |
Yorùbá Dependency Treebank (YTB) (2020.lrec-1)
Copied to clipboard
| Challenge: | Low-resource languages present enormous NLP opportunities as well as varying degrees of difficulties. |
| Approach: | They propose to use the Yoruba Bible treebank to apply a new grammar formalism to the language by examining the use of universal dependency annotations. |
| Outcome: | The treebank of hand-annotated parts of the Yoruba Bible provides an avenue for dependency analysis of the language; the application of a new grammar formalism to the language. |
Align-smatch: A Novel Evaluation Method for Chinese Abstract Meaning Representation Parsing based on Alignment of Concept and Relation (2022.lrec-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation abstracts the meaning of sentences into a single-rooted, acyclic and directed graph. |
| Approach: | They propose to use a metric to evaluate concept alignment and relation alignment to improve Chinese AMR parsing evaluation methods. |
| Outcome: | The proposed method is more robust and compatible with concept alignment and relation alignment and more robust in evaluating arcs. |
Dependency Parsing for Urdu: Resources, Conversions and Learning (2020.lrec-1)
Copied to clipboard
| Challenge: | Existing treebanks for Urdu are under-resourced due to lack of resources. |
| Approach: | They propose to convert existing treebanks into a common format that is based on Universal Dependencies. |
| Outcome: | The proposed format outperforms the MaltParser and a transition-based BiLSTM parser with word embeddings and significantly improves parsing accuracy. |
Parsing as Tagging (2020.lrec-1)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing treat parse as tagging, but they are not perfect. |
| Approach: | They propose a simple yet accurate method that treats parsing as tagging . they use a sequence model with a bidirectional LSTM over BERT embeddings . |
| Outcome: | The proposed method outperforms the state-of-the-art method on universal dependency (UD) by 1.76% unlabeled attachment score (UAS) for English, 1.98% UAS for French, and 1.16% UAS in German. |
Character Coreference Resolution in Movie Screenplays (2023.findings-acl)
Copied to clipboard
| Challenge: | Movie screenplays have a distinct narrative structure. |
| Approach: | They develop a method to extract structural information and character coreference clusters from movie screenplays by leveraging a movie parser and a character coreferser. |
| Outcome: | The proposed methods scale to long movie screenplays without dramatically increasing their memory footprints. |
Dependency Graph Parsing as Sequence Labeling (2024.emnlp-main)
Copied to clipboard
| Challenge: | Various linearizations have been proposed to cast syntactic dependency parsing as sequence labeling, but they cannot handle reentrancy or cycles. |
| Approach: | They propose unbounded linearizations that can be used to cast dependency parsing as sequence labeling. |
| Outcome: | The proposed linearizations can cast syntactic dependency parsing as a sequence labeling task. |
PRESTO: A Multilingual Dataset for Parsing Realistic Task-Oriented Dialogs (2023.emnlp-main)
Copied to clipboard
Rahul Goel, Waleed Ammar, Aditya Gupta, Siddharth Vashishtha, Motoki Sano, Faiz Surani, Max Chang, HyunJeong Choe, David Greene, Chuan He, Rattima Nitisaroj, Anna Trukhina, Shachi Paul, Pararth Shah, Rushin Shah, Zhou Yu
| Challenge: | PRESTO dataset contains 550K contextual multilingual conversations between humans and virtual assistants. |
| Approach: | They propose to use a dataset of 550K contextual multilingual conversations between humans and virtual assistants to study some of the more challenging aspects of parsing realistic conversations. |
| Outcome: | The dataset contains 550K contextual conversations between humans and virtual assistants. |
Grammar-Constrained Decoding for Structured NLP Tasks without Finetuning (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing grammar-constrained decoding methods are limited to specific tasks . a grammar constraint is used to control the generation of LMs, but it is limited to a few tasks a task is not performed. |
| Approach: | They propose grammar-constrained decoding to control the generation of large language models . they demonstrate that grammars can describe the output space for a wider range of tasks . |
| Outcome: | The proposed grammars outperform unconstrained models on information extraction, entity disambiguation, and constituency parsing. |
RAT-SQL: Relation-Aware Schema Encoding and Linking for Text-to-SQL Parsers (2020.acl-main)
Copied to clipboard
| Challenge: | Existing semantic parsing models struggle to generalize to unseen database schemas. |
| Approach: | They propose a framework to address schema encoding, schema linking, and feature representation within a text-to-SQL encoder. |
| Outcome: | The proposed framework boosts the match accuracy to 57.2% on the spider dataset, surpassing its best counterparts by 8.7%. |
Predicting generalization performance with correctness discriminators (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models estimate accuracy of models on unlabeled test data, but they hide their own uncertainty. |
| Approach: | They propose a model that establishes upper and lower bounds on the accuracy without requiring gold labels for the unseen data. |
| Outcome: | The proposed model establishes upper and lower bounds on accuracy without requiring gold labels for the unseen data. |
Automating Easy Read Text Segmentation (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for automatic segmentation of Easy Read text have not been explored in detail. |
| Approach: | They propose automated methods for Easy Read segmentation that leverage masked and generative language models and constituent parsing to evaluate their viability. |
| Outcome: | The proposed methods are compared with human-driven segmentation in three languages. |
PyCantonese: Cantonese Linguistics and NLP in Python (2022.lrec-1)
Copied to clipboard
| Challenge: | a limited number of Cantonese-specific datasets are available for PyCantones. |
| Approach: | They introduce PyCantonese, an open-source Python library for Cantonesi linguistics and natural language processing. |
| Outcome: | The proposed library is open-source and available for free for all purposes, including commercial ones. |
High-order Joint Constituency and Dependency Parsing (2024.lrec-main)
Copied to clipboard
| Challenge: | Syntactic parsing aims to reveal how sentences are syntactically structured. |
| Approach: | They propose to produce compatible constituency and dependency trees simultaneously for input sentences . they adopt a much more efficient decoding algorithm and explore joint modeling at training phase . |
| Outcome: | The proposed model significantly improves matching ratio of whole trees compared to separate models . the proposed model adopts a much more efficient decoding algorithm . |
Analyzing Middle High German Syntax with RDF and SPARQL (L18-1)
Copied to clipboard
| Challenge: | Using CoNLL-RDF and SPARQL Update, we analyze the diachronic changes of Middle High German syntax. |
| Approach: | They propose a rule-based shallow parser and an enrichment pipeline grounded in CoNLL-RDF and SPARQL Update for parsing. |
| Outcome: | The proposed pipeline is based on CoNLL-RDF and SPARQL Update for syntactic annotation and semantic enrichment of Middle High German. |
Reorder and then Parse, Fast and Accurate Discontinuous Constituency Parsing (2022.emnlp-main)
Copied to clipboard
| Challenge: | Discontinuous constituency parsing is still being developed for its efficiency and accuracy are far behind its continuous counterparts. |
| Approach: | They propose to transform a discontinuous constituent tree into a pseudo-continuous one by reordering words in the sentence. |
| Outcome: | The proposed method can transform a discontinuous constituent tree into a pseudo-continuous one by parsing and performing actions on three classical discontinuous constituency treebanks. |
Universal Decompositional Semantic Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | Decompositional Semantics is a formalism that encodes semantic information in a feature-based scheme using continuous scales rather than categorical labels. |
| Approach: | They propose a transductive model for parsing into Universal Decompositional Semantics representations and a pipeline model for annotating the graph with decompositionally semantic attribute scores. |
| Outcome: | The proposed model performs well while performing attribute prediction. |
Cross-domain Generalization for AMR Parsing (2022.emnlp-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsing aims to predict an AMR graph from textual input. |
| Approach: | They evaluate five representative AMR parsers on five domains and analyze challenges to cross-domain parsing. |
| Outcome: | The proposed method reduces the domain distribution divergence of text and AMR features on two out-of-domain sets. |
Multistage Collaborative Knowledge Distillation from a Large Language Model for Semi-Supervised Sequence Generation (2024.acl-long)
Copied to clipboard
Jiachen Zhao, Wenlong Zhao, Andrew Drozdov, Benjamin Rozonoyer, Md Arafat Sultan, Jay-Yoon Lee, Mohit Iyyer, Andrew McCallum
| Challenge: | Low-resource tasks such as semi-supervised sequence generation require expert knowledge and cost. |
| Approach: | They propose a method for semi-supervised sequence generation where few examples are too scarce to fine tune a model. |
| Outcome: | The proposed method can generalize better than its teacher to unseen examples on semi-supervised sequence generation tasks. |
LogogramNLP: Comparing Visual and Textual Representations of Ancient Logographic Writing Systems for NLP (2024.acl-long)
Copied to clipboard
| Challenge: | Existing pipelines for natural language processing only process symbolic representations of language, which are labor-intensive and noisy . a large portion of logographic data persists in a purely visual form due to the absence of transcription . this issue poses a bottleneck for researchers seeking to apply NLP to ancient logographic languages . |
| Approach: | They propose a benchmark for NLP analysis of ancient logographic languages using visual representations of writing. |
| Outcome: | The proposed pipeline outperforms existing pipelines for some tasks . the results could unlock large amounts of cultural heritage data of ancient logographic languages . |
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 . |
Error Detection for Text-to-SQL Semantic Parsing (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing text-to-SQL parsers are often over-confident, thus casting doubt on their trustworthiness when deployed for real use. |
| Approach: | They propose a parser-independent error detection model for text-to-SQL semantic parsing . they use a language model of code as its bedrock and graph neural networks to learn structural features of queries . |
| Outcome: | The proposed model outperforms parser-dependent uncertainty metrics on three strong parsers . it could improve the performance and usability of text-to-SQL semantic parsing, it is shown . |
A Root of a Problem: Optimizing Single-Root Dependency Parsing (2021.emnlp-main)
Copied to clipboard
| Challenge: | Graph-based dependency parsers can be improved without compromising on accuracy or accuracy. |
| Approach: | They propose two approaches to single-root dependency parsing that yield speed ups . they show that one approach is fully correct and finds the optimal dependency tree . |
| Outcome: | The proposed approach finds the optimal dependency tree without loss of accuracy or optimality. |
Semantic Decomposition of Question and SQL for Text-to-SQL Parsing (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing text-to-SQL models for complex queries are limited by the syntactic complexity of SQL. |
| Approach: | They propose a question decomposition language that decomposes SQL queries into simple and regular sub-queries. |
| Outcome: | The proposed language decomposes SQL queries into simple and regular sub-queries . it is more accessible to non-experts for complex queries, enabling interpretable output . |
Approximating CKY with Transformers (2023.findings-emnlp)
Copied to clipboard
| Challenge: | CKY algorithm is a cubic dependence on sentence length, but transformers can be used to approximate it. |
| Approach: | They propose a transformer-based approach that approximates the CKY algorithm by directly predicting a sentence's parse and avoiding its cubic dependence on sentence length. |
| Outcome: | The proposed approach achieves better performance than comparable parsers that make use of CKY, while being faster. |
StruNRAG: Evaluation of OCR-Induced Structural Noise on RAG Robustness (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing evaluations of RAG systems ignore structural noise, authors say . complex layouts can cause OCR failures and disrupt semantic flow of text . advanced LLMs demonstrate robustness against local noise, but struggle to maintain reasoning capabilities under severe structural disruption that fragments global context. |
| Approach: | They propose a benchmark to evaluate RAG robustness against OCR-induced structural perturbations. |
| Outcome: | The proposed benchmark systematically injects three categories of real-world structural noise into a bilingual dataset of 2,132 question-answer pairs . results show that advanced LLMs demonstrate robustness against local noise, but struggle to maintain reasoning capabilities under severe structural disruption . |
Do Transformers Parse while Predicting the Masked Word? (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies show that pre-trained language models encode linguistic structures like parse trees while being trained unsupervised. |
| Approach: | They propose to train pre-trained language models to encode linguistic structures like parse trees while unsupervised. |
| Outcome: | The proposed model performs optimally for masked language modeling loss on the English PCFG. |
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. |
Unveil: Unified Visual-Textual Integration and Distillation for Multi-modal Document Retrieval (2025.acl-long)
Copied to clipboard
| Challenge: | Document retrieval in real-world scenarios faces significant challenges due to diverse document formats and modalities. |
| Approach: | They propose a visual-textual embedding framework that integrates textual and visual features for robust document representation. |
| Outcome: | The proposed visual-textual embedding framework surpasses existing methods while preserving semantic fidelity. |
Soft Well-Formed Semantic Parsing with Score-Based Selection (2024.lrec-main)
Copied to clipboard
| Challenge: | Semantic parsing is the task of translating natural language into a structured, formal semantic representation that can be interpreted by machines. |
| Approach: | They propose a score-based method to select well-formed outputs from candidates generated by beam search algorithms. |
| Outcome: | The proposed method reduces the number of ill-formed outputs and improves F1 scores in English. |
Sentence Smith: Controllable Edits for Evaluating Text Embeddings (2025.emnlp-main)
Copied to clipboard
| Challenge: | Controllable and transparent text generation has been a long-standing goal in NLP . but previous approaches were hindered by parsing and generation insufficiencies . |
| Approach: | They propose a framework for English that has three steps: 1. Parsing a sentence into a semantic graph. 2. Applying human-designed semantic manipulation rules. 3. Generating text from the manipulated graph. |
| Outcome: | The proposed framework for English is based on a neural network and parsers. |
Towards Standardized Annotation and Parsing for Korean FrameNet (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies on Korean FrameNet have focused on English, but annotations are not optimally designed for Korean. |
| Approach: | They propose a morphologically enhanced annotation strategy for Korean FrameNet datasets and parsing by leveraging the CoNLL-U format. |
| Outcome: | The proposed method improves the annotation accuracy of Korean FrameNet datasets and their parsers. |
Geoparsing: Diagram Parsing for Plane and Solid Geometry with a Unified Formal Language (2026.findings-acl)
Copied to clipboard
Peijie Wang, Ming-Liang Zhang, Jun Cao, Chao Deng, Dekang Ran, Pi Bu, Hongda Sun, Xuan Zhang, Yingyao Wang, Jun Song, Bo Zheng, Fei Yin, Cheng-Lin Liu
| Challenge: | Recent advances in Multimodal Large Language Models (MLLMs) have demonstrated remarkable capabilities across various vision reasoning tasks. |
| Approach: | They propose a unified formal language that integrates plane and solid geometry, comprehensively covering geometric structures and semantic relations. |
| Outcome: | The proposed language achieves state-of-the-art parsing performance and significantly boosts MLLMs’ capabilities for downstream geometry reasoning tasks. |
Probability Distribution Collapse: A Critical Bottleneck to Compact Unsupervised Neural Grammar Induction (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing models face expressiveness bottlenecks, resulting in unnecessarily large yet underperforming grammars. |
| Approach: | They propose a method to reduce the expressiveness bottleneck of unsupervised neural grammar induction by leveraging neural parameterization to estimate prob-ability distributions. |
| Outcome: | The proposed approach significantly improves parsing performance while enabling the use of significantly more compact grammars across a wide range of languages. |