Comparing methods of tree-construction across mildly context-sensitive formalisms
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus
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…
On the Complexity of CCG Parsing
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the worst…
SentenceTAGComparing Nonparametric Bayesian Tree Priors for Clonal Reconstruction of Tumors
Statistical machine learning methods, especially nonparametric Bayesian methods, have become increasingly popular to infer clonal population structure of tumors. Here we describe the treeCRP, an extension of the Chinese …
Strong Equivalence of TAG and CCG
Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the s…
TAGUnsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars
We study grammar induction with mildly context-sensitive grammars for unsupervised discontinuous parsing. Using the probabilistic linear context-free rewriting system (LCFRS) formalism, our approach fixes the rule struct…
Constituency Parsingparameter estimationTensor Decomposition