SATTA, GIORGIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.039
EU - Europa 653
AS - Asia 369
OC - Oceania 5
AF - Africa 1
Totale 7.067
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.037
CN - Cina 259
FI - Finlandia 173
UA - Ucraina 133
DE - Germania 107
VN - Vietnam 107
SE - Svezia 105
IT - Italia 75
GB - Regno Unito 43
IE - Irlanda 6
AU - Australia 5
FR - Francia 4
CA - Canada 2
NL - Olanda 2
RU - Federazione Russa 2
CH - Svizzera 1
CZ - Repubblica Ceca 1
IN - India 1
JP - Giappone 1
LU - Lussemburgo 1
MA - Marocco 1
TR - Turchia 1
Totale 7.067
Salva come PNG Salva come JPEG
Città #
Woodbridge 974
Fairfield 953
Ann Arbor 632
Jacksonville 567
Houston 496
Wilmington 376
Cambridge 335
Ashburn 320
Seattle 314
Chandler 208
Princeton 178
Medford 110
Dong Ket 106
San Diego 79
Nanjing 76
Helsinki 57
Boardman 45
Beijing 39
Des Moines 35
Padova 28
Hebei 27
Guangzhou 23
Nanchang 21
Jiaxing 18
Shenyang 16
Changsha 14
Norwalk 13
Roxbury 13
London 11
New York 10
Tianjin 9
Jinan 8
Milan 8
Indiana 7
Kharkiv 7
Dublin 6
Renton 6
Florence 5
Sydney 5
Borås 3
Frankfurt am Main 3
Munich 3
Ningbo 3
Nuremberg 3
Rockville 3
Sant'elena 3
Bologna 2
Chiavari 2
Edinburgh 2
Enna 2
Kilburn 2
Mirano 2
Ogden 2
Rimini 2
Saint Petersburg 2
San Francisco 2
Taizhou 2
Tappahannock 2
Bordeaux 1
Buffalo 1
Fuzhou 1
Hanoi 1
Hounslow 1
Lappeenranta 1
Leawood 1
Legnago 1
Luxembourg 1
Mumbai 1
Orange 1
Phoenix 1
Piove Di Sacco 1
Rome 1
Southwark 1
Stuttgart 1
Trento 1
Trieste 1
Ventimiglia 1
Waltham 1
Yellow Springs 1
Yenibosna 1
Totale 6.222
Salva come PNG Salva come JPEG
Nome #
Symbol-Relation Grammars: a Formalism for Graphical Languages 139
Optimality Theory and the Generative Complexity of Constraint Violability 124
Independent Parallelism in Finite Copying Parallel Rewriting Systems 110
Estimation of Consistent Probabilistic Context-free Grammars 110
Cross-Entropy and Estimation of Probabilistic Context-Free Grammars 101
Restrictions on Tree Adjoining Languages 100
A Tabular Method for Dynamic Oracles in Transition-Based Parsing 100
Computation of Probabilities for an Island-Driven Parser 99
Synchronous Models of Language 96
Probabilistic Parsing Strategies 95
Discovering subword associations in strings in time linear in the output size. 92
Synchronous context-free grammars and optimal linear parsing strategies 92
Lexicalization and Generative Power in CCG 91
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems 91
NEW DEVELOPMENTS IN PARSING TECHNOLOGY 88
Cache Transition Systems for Graph Parsing 87
BiDirectional Context-Free Grammar Parsing for Natural Language Processing 86
Efficient Tabular LR Parsing 86
Bidirectional parsing of lexicalized tree adjoining grammars 86
Computation of Distances for Regular and Context-Free Probabilistic Languages 85
Efficient Parsing for Head-Split Dependency Trees 85
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars 84
Efficient Transformation-Based Parsing 84
Treebank Grammar Techniques for Non-Projective Dependency Parsing 84
Some Computational Complexity Results for Synchronous Context-Free Grammars 84
A New Parsing Algorithm for Combinatory Categorial Grammar 84
Weighted DAG Automata for Semantic Graphs 84
A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing 83
Efficient Text Fingerprinting Via Parikh Mapping 82
Optimal discovery of subword associations in strings 81
A Variant of Earley Parsing 81
An Alternative Method of Training Probabilistic LR parsers 80
Computing Partition Functions of PCFGs 79
Probabilistic Context-Free Grammars Estimated from Infinite Distributions 79
The Language Intersection Problem for Non-Recursive Context-Free Grammars 76
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing 76
A Polynomial-Time Parsing Algorithm for TT-MCTAG 75
A Rank Hierarchy for Deterministic Tree-Walking Transducers 75
Prefix probabilities for linear context-free rewriting systems 70
Parsing Non-Recursive Context-Free Grammars 70
Synchronous Rewriting in Treebanks 69
Language Models for Automatic Speech Recognition 69
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization 69
String Transformation Learning 69
Prefix Probabilities from Stochastic Tree Adjoining Grammars 69
Language Modeling using Stochastic Context-Free Grammars 68
Generalized Multitext Grammars 68
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammars 67
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata 66
A computational approach to Binding Theory 66
Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars 66
Complexity of parsing for some lexicalized formalisms 64
An extended theory of head-driven parsing 64
Probabilistic Parsing Strategies 63
Synchronous Context-Free Grammars and Optimal Parsing Strategies 63
An Information Theoretic Measure to Evaluate Parsing Difficulty Across Treebanks 63
Factoring Synchronous Grammars by Sorting 62
Ordered Tree Decomposition for HRG Rule Extraction 62
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy 61
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems 59
Sequence-to-sequence Models for Cache Transition Systems 59
Optimal k-arization of Synchronous Tree-Adjoining Grammar 58
An Incremental Parser for Abstract Meaning Representation 57
Z-Automata for Compact and Direct Representation of Unranked Tree Languages 55
Prefix Probabilities for Linear Context-Free Rewriting Systems 53
On the Complexity of Non-Projective Data-Driven Dependency Parsing 52
Splittability of Bilexical Context-Free Grammars is Undecidable 51
Probabilistic parsing as intersection 49
Proceedings of the Fourth Italian Conference on Computational Linguistics (CLiC-it 2017) 49
Probabilistic Parsing Strategies 48
Left-To-Right Parsing and Bilexical Context-Free Grammars 47
Recognition of Linear Context-Free Rewriting Systems 47
An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two 46
Parsing Algorithms based on Tree Automata 44
Prefix Probabilities for Linear Indexed Grammars 44
Tree Adjoining Grammar Parsing and Boolean Matrix Multiplication 44
On the Complexity of CCG Parsing 44
Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing 42
Dynamic Programming Algorithms for Transition-Based Dependency Parsers 42
The Membership Problem for Unordered Vector Languages 42
Tabular Parsing 42
Guided Learning for Bidirectional Sequence Classification 42
Algorithmic aspects of natural language processing 42
Computation of Infix Probabilities for Probabilistic Context-Free Grammars 41
Approximate PCFG Parsing Using Tensor Decomposition 41
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems 40
A Faster Parsing Algorithm for Lexicalized Tree-Adjoining Grammars 39
Computation of Probabilities for Island-Driven Parsers 39
The Parsing Problem for Tree Adjoining Grammars 39
Probabilistic Parsing Strategies 39
Formal Properties of Non-Locality 37
Head-Driven BiDirectional Parsing: A Tabular Method 37
IDL-Expressions: A Compact Representation for Finite Languages in Generation Systems 36
Partially ordered multiset context-free grammars and free-word-order parsing 36
Analyzing an italian treebank with state-of-the-art statistical parsers 36
Synchronous String Rewriting 35
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs 33
Optimality Theory and Generative Complexity 32
Theory of parsing 31
Computational Aspects of Operator-Variable Structures 31
Totale 6.582
Salva come PNG Salva come JPEG
Categoria #
all - tutte 23.687
article - articoli 8.554
book - libri 335
conference - conferenze 0
curatela - curatele 156
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.042
Totale 33.774
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019506 0 0 0 0 0 0 0 0 0 0 276 230
2019/20201.682 281 47 17 121 176 152 134 193 215 138 103 105
2020/20211.067 47 126 25 106 25 59 19 95 210 87 121 147
2021/20221.117 39 177 130 40 89 44 48 111 57 26 153 203
2022/2023697 237 0 1 55 137 89 0 44 86 4 26 18
2023/2024145 13 42 28 26 7 5 3 1 7 10 3 0
Totale 7.181