搜索结果: 1-14 共查到“计算语言学 D-Tree”相关记录14条 . 查询时间(0.168 秒)
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...
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...
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...
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes
Shared Nodes Multicomponent Tree-Adjoining
2015/8/31
This article addresses the problem that the expressive power of tree-adjoining grammars (TAGs)
is too limited to deal with certain syntactic phenomena, in particular, with scrambling in freeword-orde...
Tree Adjoining Grammars:Formalisms,Linguistic Analysis and Processing
Tree Adjoining Grammars Formalisms Linguistic Analysis Processing
2015/8/27
Take a finite set T of trees, and close it under the operation of substitution—replacing daughterless nonterminals by other trees in T whose root node label matches the nonterminal. The set of all ter...
There is considerable interest among computational linguists in lexicalized grammatical frameworks; lexicalized tree adjoining grammar (LTAG) is one widely studied example. In this paper, we investiga...
The Infinite Tree
The Infinite Tree
2015/6/12
Historically, unsupervised learning techniques have lacked a principled technique for selecting the number of unseen components. Research into non-parametric priors, such as the Dirichlet process, has...
Left-to-Right Tree-to-String Decoding with Prediction
Left-to-Right Tree-to-String Decoding Prediction
2015/1/24
Left-to-Right Tree-to-String Decoding with Prediction.
A Tree-structure Solution for the Development of ChineseNet
Tree Algorithm Chinese WordNet CCD
2009/2/10
In this paper, we would like to put forth the notion of tree-structure in the development of a WordNet-compatible concept dictionary. After getting the full- hyponymy information in WordNet successful...