MIX Is Not a Tree-Adjoining Language
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus
2021-01-10
· Hiroyoshi Komatsu
While context-free grammars are characterized by a simple proof-theoretic grammatical formalism namely categorial grammar and its logic the Lambek calculus, no such characterizations were known for tree-adjoining grammar…
A Lie-algebraic perspective on Tree-Adjoining Grammars
2025-07-04
· Isabella Senturia, Elizabeth Xiao, Matilde Marcolli
arxiv
We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequ…
Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages
2023-10-23
· Alexandra Butoi, Tim Vieira, Ryan Cotterell, David Chiang
The class of tree-adjoining languages can be characterized by various two-level formalisms, consisting of a context-free grammar (CFG) or pushdown automaton (PDA) controlling another CFG or PDA. These four formalisms are…
TAGCreating a Tree Adjoining Grammar from a Multilayer Treebank
2012-09-01 · WS 2012 9
· Rajesh Bhatt, Owen Rambow, Fei Xia
A Direct Link between Tree-Adjoining and Context-Free Tree Grammars
2015-01-01 · WS 2015 1
· Kilian Gebhardt, Johannes Osterholzer