Character-based PCFG Induction for Modeling the Syntactic Acquisition of Morphologically Rich Languages (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for syntactic acquisition are word-based and do not inspect functional affixes. |
| Approach: | They propose a computer-based induction model that allows a clean ablation of the influence of subword information in grammar induction. |
| Outcome: | The proposed model is more accurate in morphologically richer languages with subword information than word-based models. |
Similar Papers
Unsupervised Learning of PCFGs with Normalizing Flow (P19-1)
Copied to clipboard
| Challenge: | Existing induction models unable to incorporate semantics and morphology into induction . current models lack a robust model for generating morphologically rich sentences . |
| Approach: | They propose a PCFG inducer which uses context embeddings to generalize over rare, morphologically rich forms. |
| Outcome: | The proposed model produces grammars with state-of-the-art accuracy on a variety of languages. |
Categorial grammar induction from raw data (2023.findings-acl)
Copied to clipboard
| Challenge: | a new model for categorial grammar induction is based on raw data without part-of-speech information. |
| Approach: | They propose a grammar induction model that learns from raw data without part-of-speech information. |
| Outcome: | a new model for inducing a basic categorial grammar is developed . the model attains a recall-homogeneity of 0.33 on average, and a bias toward forward function application is added . |
Video-aided Unsupervised Grammar Induction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods of multi-modal grammar induction focus on grammar inducing from text-image pairs, but videos provide even richer information, such as static objects and actions. |
| Approach: | They propose a video-aided grammar induction model which learns a constituency parser from unlabeled text and its corresponding video. |
| Outcome: | The proposed model outperforms existing systems on three benchmarks. |
Grounded PCFG Induction with Images (2020.aacl-main)
Copied to clipboard
| Challenge: | Recent work in unsupervised parsing has tried to incorporate visual information into learning, but results suggest that these models need linguistic bias to compete against models that only rely on text. |
| Approach: | They propose to use visual information from images for labeled parsing and compare them to existing models which only use text. |
| Outcome: | The proposed models achieve state-of-the-art results on multilingual induction datasets even without help from linguistic knowledge or pretrained image encoders. |
The Return of Lexical Dependencies: Neural Lexicalized PCFGs (2020.tacl-1)
Copied to clipboard
| Challenge: | Existing approaches to grammar induction focus on discovering constituents or dependencies. |
| Approach: | They propose to model lexical dependencies using context free grammars instead of lexicals . they show that this unified framework induces both constituents and dependencies . |
| Outcome: | The proposed model overcomes sparsity problems and induces constituents and dependencies better than the current methods. |
Leveraging Grammar Induction for Language Understanding and Generation (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing grammar induction methods do not provide sufficient performance in downstream tasks. |
| Approach: | They propose an unsupervised grammar induction method for language understanding and generation using a grammar parser and a syntactic mask. |
| Outcome: | The proposed method performs better on from-scratch and pre-trained scenarios. |
Compound Probabilistic Context-Free Grammars for Grammar Induction (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to grammar induction have resorted to manually-engineered features and auxiliary objectives to induce the desired structures. |
| Approach: | They propose a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context free grammar. |
| Outcome: | Experiments on English and Chinese show that the proposed approach is more efficient than other methods. |
Overestimation of Syntactic Representation in Neural Language Models (2020.acl-main)
Copied to clipboard
| Challenge: | Several testing methodologies have been developed to probe models’ syntactic representations. |
| Approach: | They propose a method to determine syntactic structure by training a model on strings generated according to a template and testing its ability to distinguish between similar ones with different syntax. |
| Outcome: | The proposed method reproduces positive results with two non-syntactic baseline language models: an n-gram model and an LSTM model trained on scrambled inputs. |
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. |
Grammar Induction with Neural Language Models: An Unusual Replication (D18-1)
Copied to clipboard
| Challenge: | Recent work on latent tree learning attempts to develop models with parse-valued latent variables and train them on non-parsing tasks. |
| Approach: | They propose a model with parse-valued latent variables and a strong latent tree learning result on constituency parsing. |
| Outcome: | The proposed model outperforms all baselines and performs competitively with symbolic grammar induction systems. |