Quantifier-free tree transductions
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Regular transductions with MCFG input syntax
We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars. We prove that synchronous multiple context-fr…
Deep Tree Transductions - A Short Survey
The paper surveys recent extensions of the Long-Short Term Memory networks to handle tree structures from the perspective of learning non-trivial forms of isomorph structured transductions. It provides a discussion of mo…
SurveyLogical Transductions for the Typology of Ditransitive Prosody
Given the empirical landscape of possible prosodic parses, this paper examines the computations required to formalize the mapping from syntactic structure to prosodic structure. In particular, we use logical tree transdu…
Text Summarization as Tree Transduction by Top-Down TreeLSTM
Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction ta…
SentenceSentence CompressionText SummarizationTowards a Language for Natural Language Treebank Transductions
This paper describes a transduction language suitable for natural language treebank transformations and motivates its application to tasks that have been used and described in the literature. The language, which is the b…