搜索结果: 1-15 共查到“文学 Tree”相关记录35条 . 查询时间(0.343 秒)
上饶师范学院大学英语（新世纪）课件Book Two Unit Tree。
上饶师范学院大学英语（新世纪）课件Book One Unit Tree。
湖南第一师范学院综合英语（二）课件Unit15 Have You Seen the Tree
湖南第一师范学院 综合英语（二） 课件 Unit15 Have You Seen the Tree
<
2017/6/26
湖南第一师范学院综合英语（二）课件Unit15 Have You Seen the Tree。
四川师范大学外国语学院英语精读课件 The History of the Christmas Tree
四川师范大学外国语学院 英语精读 课件 The History of the Christmas Tree
<
2015/11/11
四川师范大学外国语学院英语精读课件 The History of the Christmas Tree。
Multiple Adjunction in Feature-Based Tree-Adjoining Grammar
Multiple Adjunction Tree-Adjoining Grammar
<
2015/9/15
In parsing with Tree Adjoining Grammar (TAG), independent derivations have been shown by Schabes and Shieber (1994) to be essential for correctly supporting syntactic analysis, semantic interpretation...
Phrase Dependency Machine Translation with Quasi-Synchronous Tree-to-Tree Features
phrase translation
<
2015/9/14
Recent research has shown clear improvement in translation quality by exploiting linguistic
syntax for either the source or target language. However, when using syntax for both languages
(“tree-to-t...
Sampling Tree Fragments from Forests
Forests probabilit
<
2015/9/14
We study the problem of sampling trees from forests, in the setting where probabilities for each
tree may be a function of arbitrarily large tree fragments. This setting extends recent work
for samp...
Incremental,Predictive Parsing with Psycholinguistically Motivated Tree-Adjoining Grammar
Incremental Predictive Parsing Psycholinguistically Tree-Adjoining Grammar
<
2015/9/11
Psycholinguistic research shows that key properties of the human sentence processor are incrementality, connectedness (partial structures contain no unattached nodes), and prediction (upcoming syntact...
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization
Tree-Adjoining Grammars Not Closed Lexicalization
<
2015/9/10
A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenome...
On the String Translations Produced by Multi Bottom–Up Tree Transducers
String Translations Produced Multi Bottom–Up Tree Transducers
<
2015/9/10
Tree transducers are defined as relations between trees, but in syntax-based machine translation, we are ultimately concerned with the relations between the strings at the yields of the input and outp...
We describe the application of the graph-theoretic property known as treewidth to the problem of
finding efficient parsing algorithms. This method, similar to the junction tree algorithm ...
Complexity,Parsing,and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar
Complexity Parsing Factorization Tree-Local Multi-Component Tree-Adjoining Grammar
<
2015/9/8
Tree-Local Multi-Component Tree-Adjoining Grammar (TL-MCTAG) is an appealing formalism for natural language representation because it arguably allows the encapsulation of the appropriate domain of loc...
The availability of large scale data sets of manually annotated predicate-argument structures has recently favored the use of machine learning approaches to the design of automated semantic role label...
Many probabilistic models for natural language are now written in terms of hierarchical tree
structure. Tree-based modeling still lacks many of the standard tools taken for granted in
(finite-...
Multi-labeled corpora, where each document is tagged with a set of labels, are ubiquitous. When the number of unique labels in the dataset is large, there are naturally some dependencies among the lab...