Fetching the paper…
Reading the bibliography…
We study grammar induction with mildly context-sensitive grammars for unsupervised discontinuous parsing.
On certain formal properties of grammars
Noam Chomsky. 1959 · 1959
Earlier work this paper cites.
The algebraic theory of context-free languages
N. Chomsky and M. P. Schützenberger. 1963 · 1963
Earlier work this paper cites.
Tree adjunct grammars
Aravind K. Joshi. 1975 · 1975
Earlier work this paper cites.
Extraposition: Bounding versus government-binding
Mark R. Baltin. 1983 · 1983
Earlier work this paper cites.
Parsing as deduction
Fernando C. N. Pereira and David H. D. Warren. 1983 · 1983
Earlier work this paper cites.
How much context sensitivity is necessary for characterizing structural descriptions: Tree adjoining grammars
Aravind K Joshi. 1985 · 1985
Earlier work this paper cites.
Generalized phrase structure grammars, head grammars and natural language
Carl Pollard. 1985 · 1985
Earlier work this paper cites.
Evidence against the context-freeness of natural language
Stuart Shieber. 1985 · 1985
Earlier work this paper cites.
Combinatory Grammars and Parasitic Gaps
Mark Steedman. 1987 · 1987
Earlier work this paper cites.
Characterizing structural descriptions produced by various grammatical formalisms
K. Vijay-Shanker, David J. Weir, and Aravind K. Joshi. 1987 · 1987
Earlier work this paper cites.
Applicability of Indexed Grammars to Natural Languages
Gerald Gazdar. 1988 · 1988
Earlier work this paper cites.
The estimation of stochastic context-free grammars using the inside-outside algorithm
Karim Lari and Steve J Young. 1990 · 1990
Earlier work this paper cites.
On multiple context-free grammars
Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991 · 1991
Earlier work this paper cites.
Two experiments on learning probabilistic dependency grammars from corpora
Glenn Carroll and Eugene Charniak. 1992 · 1992
Earlier work this paper cites.
Tagging English Text with a Probabilistic Model
Bernard Merialdo. 1994 · 1994
Earlier work this paper cites.
Parsing algorithms and metrics
Joshua Goodman. 1996 · 1996
Earlier work this paper cites.
An annotation scheme for free word order languages
Wojciech Skut, Brigitte Krenn, Thorsten Brants, and Hans Uszkoreit. 1997 · 1997
Earlier work this paper cites.
The tiger treebank
Sabine Brants, Stefanie Dipper, Silvia Hansen, Wolfgang Lezius, and George Smith. 2001 · 2001
Earlier work this paper cites.
Parsing and hypergraphs
Dan Klein and Christopher D. Manning. 2001 · 2001
Earlier work this paper cites.
The alpino dependency treebank
Leonoor van der Beek, Gosse Bouma, Robert Malouf, and Gertjan van Noord. 2001 · 2001
Earlier work this paper cites.
The return of lexical dependencies: Neural lexicalized PCFGs
Hao Zhu, Yonatan Bisk, and Graham Neubig. 2020 · 2001
Earlier work this paper cites.
Probabilistic parsing for German using sister-head dependencies
Amit Dubey and Frank Keller. 2003 · 2003
Earlier work this paper cites.
Probabilistic Models of Word Order and Syntactic Discontinuity
Roger Levy. 2005 · 2005
Earlier work this paper cites.
Minimum risk annealing for training log-linear models
David A. Smith and Jason Eisner. 2006 · 2006
Earlier work this paper cites.
Bayesian inference for PCFGs via Markov chain Monte Carlo
Mark Johnson, Thomas Griffiths, and Sharon Goldwater. 2007 · 2007
Earlier work this paper cites.
Analyzing the errors of unsupervised learning
Percy Liang and Dan Klein. 2008 · 2008
Earlier work this paper cites.
Curriculum learning
Yoshua Bengio, Jérôme Louradour, Ronan Collobert, and Jason Weston. 2009 · 2009
Cited alongside, same era.
Optimal parsing strategies for linear context-free rewriting systems
Daniel Gildea. 2010 · 2010
Cited alongside, same era.
Data-driven parsing with probabilistic linear context-free rewriting systems
Laura Kallmeyer and Wolfgang Maier. 2010 · 2010
Cited alongside, same era.
Direct parsing of discontinuous constituents in German
Wolfgang Maier. 2010 · 2010
Cited alongside, same era.
PLCFRS parsing of English discontinuous constituents
Kilian Evang and Laura Kallmeyer. 2011 · 2011
Cited alongside, same era.
Simple robust grammar induction with combinatory categorial grammars
Yonatan Bisk and Julia Hockenmaier. 2012 · 2012
Cited alongside, same era.
Factor graph grammars
David Chiang and Darcey Riley. 2020 · 2020
Later among the works it cites.
Scaling hidden Markov language models
Justin Chiu and Alexander Rush. 2020 · 2020
Later among the works it cites.
Probabilistic circuits: A unifying framework for tractable probabilistic models
YooJung Choi, Antonio Vergari, and Guy Van den Broeck. 2020 · 2020
Later among the works it cites.
Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(nˆ6) down to O(nˆ3)
Caio Corro. 2020 · 2020
Later among the works it cites.
Discontinuous constituent parsing with pointer networks
Daniel Fernández-González and Carlos Gómez-Rodríguez. 2020 · 2020
Later among the works it cites.
Calibrating generative models: The probabilistic chomsky-schützenberger hierarchy
Thomas Icard. 2020 · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
PLCFRS parsing revisited: Restricting the fan-out to two
Wolfgang Maier, Miriam Kaeshammer, and Laura Kallmeyer. 2012 · 2012
Cited alongside, same era.
An HDP model for inducing Combinatory Categorial Grammars
Yonatan Bisk and Julia Hockenmaier. 2013 · 2013
Cited alongside, same era.
Approximate PCFG parsing using tensor decomposition
Shay B. Cohen, Giorgio Satta, and Michael Collins. 2013 · 2013
Cited alongside, same era.
Large scale syntactic annotation of written dutch: Lassy
Gertjan van Noord, Gosse Bouma, Frank Van Eynde, Daniël de Kok, Jelmer van der Linde, Ineke Schuurman, Erik Tjong Kim Sang, and Vincent Vandeghinste. 2013 · 2013
Cited alongside, same era.
Introducing the SPMRL 2014 shared task on parsing morphologically-rich languages
Djamé Seddah, Sandra Kübler, and Reut Tsarfaty. 2014 · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba. 2015 · 2015
Cited alongside, same era.
Later among the works it cites.
Grounded PCFG induction with images
Lifeng Jin and William Schuler. 2020 · 2020
Later among the works it cites.
Einsum networks: Fast and scalable learning of tractable probabilistic circuits
Robert Peharz, Steven Lang, Antonio Vergari, Karl Stelzner, Alejandro Molina, Martin Trapp, Guy Van den Broeck, Kristian Kersting, and Zoubin Ghahramani. 2020 · 2020
Later among the works it cites.
On the role of supervision in unsupervised constituency parsing
Haoyue Shi, Karen Livescu, and Kevin Gimpel. 2020 · 2020
Later among the works it cites.
Span-based LCFRS-2 parsing
Miloš Stanojević and Mark Steedman. 2020 · 2020
Later among the works it cites.
Discontinuous constituent parsing as sequence labeling
David Vilares and Carlos Gómez-Rodríguez. 2020 · 2020
Later among the works it cites.
Second-order unsupervised neural dependency parsing
Songlin Yang, Yong Jiang, Wenjuan Han, and Kewei Tu. 2020 · 2020
Later among the works it cites.
Visually grounded compound PCFGs
Yanpeng Zhao and Ivan Titov. 2020 · 2020
Later among the works it cites.
Low-rank constraints for fast inference in structured models
Justin T. Chiu, Yuntian Deng, and Alexander M. Rush. 2021 · 2021
Later among the works it cites.
Reducing discontinuous to continuous parsing with pointer network reordering
Daniel Fernández-González and Carlos Gómez-Rodríguez. 2021 · 2021
Later among the works it cites.
VLGrammar: Grounded Grammar Induction of Vision and Language
Yining Hong, Qing Li, Song-Chun Zhu, and Siyuan Huang. 2021 · 2021
Later among the works it cites.
Character-based PCFG induction for modeling the syntactic acquisition of morphologically rich languages
Lifeng Jin, Byung-Doh Oh, and William Schuler. 2021 · 2021
Later among the works it cites.
Sequence-to-sequence learning with latent neural grammars
Yoon Kim. 2021 · 2021
Later among the works it cites.
Dependency induction through the lens of visual perception
Ruisi Su, Shruti Rijhwani, Hao Zhu, Junxian He, Xinyu Wang, Yonatan Bisk, and Graham Neubig. 2021 · 2021
Later among the works it cites.
PCFGs can do better: Inducing probabilistic context-free grammars with many symbols
Songlin Yang, Yanpeng Zhao, and Kewei Tu. 2021b · 2021
Later among the works it cites.
Video-aided unsupervised grammar induction
Songyang Zhang, Linfeng Song, Lifeng Jin, Kun Xu, Dong Yu, and Jiebo Luo. 2021 · 2021
Later among the works it cites.
Finding Dataset Shortcuts with Grammar Induction
Dan Friedman, Alexander Wettig, and Danqi Chen. 2022 · 2022
Closest in time.
Scaling up probabilistic circuits by latent variable distillation
Anji Liu, Honghua Zhang, and Guy Van den Broeck. 2022 · 2022
Closest in time.
Hierarchical Phrase-based Sequence-to-Sequence Learning
Bailin Wang, Ivan Titov, Jacob Andreas, and Yoon Kim. 2022 · 2022
Closest in time.
Dynamic programming in rank space: Scaling structured inference with low-rank HMMs and PCFGs
Songlin Yang, Wei Liu, and Kewei Tu. 2022 · 2022
Closest in time.
Discontinuous grammar as a foreign language
Daniel Fernández-González and Carlos Gómez-Rodríguez. 2023 · 2023
Closest in time.