科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
G
Giorgio Satta
University of Padua
25
H指数
158
论文数
2.7K
被引数
0
相关解读
订阅
收录论文
10
发表时间
发表时间
IF
被引数
Tractable Parsing for CCGs of Bounded Degree
有界度ccg的易处理解析
COMPUTATIONAL LINGUISTICS
IF
5.3
2022-09-01
0
OA
AI
Schiffer, Lena Katharina; Kuhlmann, Marco; Satta, Giorgio
分享
收藏
Ordered Tree Decomposition for HRG Rule Extraction
COMPUTATIONAL LINGUISTICS
IF
5.3
2019-06-01
1
OA
AI
Gildea, Daniel; Satta, Giorgio; Peng, Xiaochang
分享
收藏
On the Complexity of CCG Parsing
论CCG解析的复杂性
COMPUTATIONAL LINGUISTICS
IF
5.3
2018-09-01
7
OA
AI
Kuhlmann, Marco; Satta, Giorgio; Jonsson, Peter
分享
收藏
Cache Transition Systems for Graph Parsing
COMPUTATIONAL LINGUISTICS
IF
5.3
2018-03-01
8
OA
AI
Gildea, Daniel; Satta, Giorgio; Peng, Xiaochang
分享
收藏
Weighted DAG Automata for Semantic Graphs
COMPUTATIONAL LINGUISTICS
IF
5.3
2018-03-01
11
OA
AI
Chiang, David; Drewes, Frank; Gildea, Daniel; Lopez, Adam; Satta, Giorgio
分享
收藏
Synchronous Context-Free Grammars and Optimal Parsing Strategies
COMPUTATIONAL LINGUISTICS
IF
5.3
2016-06-01
0
OA
AI
Gildea, Daniel; Satta, Giorgio
分享
收藏
Lexicalization and Generative Power in CCG
CCG中的词汇化和生成力
COMPUTATIONAL LINGUISTICS
IF
5.3
2015-06-01
22
OA
AI
Kuhlmann, Marco; Koller, Alexander; Satta, Giorgio
分享
收藏
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization
COMPUTATIONAL LINGUISTICS
IF
5.3
2012-09-01
5
OA
AI
Kuhlmann, Marco; Satta, Giorgio
分享
收藏
Splittability of Bilexical Context-Free Grammars is Undecidable
COMPUTATIONAL LINGUISTICS
IF
5.3
2011-12-01
0
OA
AI
Nederhof, Mark-Jan; Satta, Giorgio
分享
收藏
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar
COMPUTATIONAL LINGUISTICS
IF
5.3
2010-09-01
1
OA
AI
Nesson, Rebecca; Satta, Giorgio; Shieber, Stuart M.
分享
收藏
研究方向
暂无研究方向
合作学者
合作期刊
S
Stuart M. Shieber
H 指数: 50 · 论文数: 214
D
Daniel Gildea
H 指数: 36 · 论文数: 167
D
David Chiang
H 指数: 31 · 论文数: 197
P
Peter Jönsson
H 指数: 29 · 论文数: 208
A
Adam Lopez
H 指数: 27 · 论文数: 128
查看更多