SATTA, GIORGIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.141
EU - Europa 731
AS - Asia 604
OC - Oceania 5
AF - Africa 1
Totale 7.482
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.139
CN - Cina 261
SG - Singapore 233
FI - Finlandia 173
UA - Ucraina 133
DE - Germania 108
VN - Vietnam 107
SE - Svezia 105
IT - Italia 80
FR - Francia 75
GB - Regno Unito 43
IE - Irlanda 6
AU - Australia 5
RU - Federazione Russa 3
CA - Canada 2
NL - Olanda 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.482
Salva come PNG Salva come JPEG
Città #
Woodbridge 974
Fairfield 953
Ann Arbor 632
Jacksonville 567
Houston 496
Wilmington 376
Cambridge 353
Ashburn 320
Seattle 314
Chandler 208
Princeton 178
Singapore 175
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
Santa Clara 22
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
Frankfurt am Main 4
Bologna 3
Borås 3
Munich 3
Ningbo 3
Nuremberg 3
Rockville 3
Sant'elena 3
Chiavari 2
Edinburgh 2
Enna 2
Kilburn 2
Mirano 2
Ogden 2
Rimini 2
Saint Petersburg 2
San Francisco 2
Taizhou 2
Tappahannock 2
Treviso 2
Bordeaux 1
Buffalo 1
Fuzhou 1
Hanoi 1
Hounslow 1
Kostroma 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.442
Salva come PNG Salva come JPEG
Nome #
Symbol-Relation Grammars: a Formalism for Graphical Languages 140
Optimality Theory and the Generative Complexity of Constraint Violability 125
Estimation of Consistent Probabilistic Context-free Grammars 114
Independent Parallelism in Finite Copying Parallel Rewriting Systems 111
Restrictions on Tree Adjoining Languages 103
Probabilistic Parsing Strategies 103
Cross-Entropy and Estimation of Probabilistic Context-Free Grammars 102
Computation of Probabilities for an Island-Driven Parser 101
A Tabular Method for Dynamic Oracles in Transition-Based Parsing 100
Synchronous Models of Language 98
Discovering subword associations in strings in time linear in the output size. 94
Synchronous context-free grammars and optimal linear parsing strategies 94
Cache Transition Systems for Graph Parsing 94
NEW DEVELOPMENTS IN PARSING TECHNOLOGY 93
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems 93
Lexicalization and Generative Power in CCG 92
Computation of Distances for Regular and Context-Free Probabilistic Languages 90
Weighted DAG Automata for Semantic Graphs 90
Bidirectional parsing of lexicalized tree adjoining grammars 89
BiDirectional Context-Free Grammar Parsing for Natural Language Processing 88
Efficient Tabular LR Parsing 88
Efficient Text Fingerprinting Via Parikh Mapping 88
Efficient Transformation-Based Parsing 87
Efficient Parsing for Head-Split Dependency Trees 87
Some Computational Complexity Results for Synchronous Context-Free Grammars 86
A New Parsing Algorithm for Combinatory Categorial Grammar 86
A Variant of Earley Parsing 86
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars 85
Treebank Grammar Techniques for Non-Projective Dependency Parsing 85
An Alternative Method of Training Probabilistic LR parsers 84
A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing 84
Optimal discovery of subword associations in strings 83
Computing Partition Functions of PCFGs 82
The Language Intersection Problem for Non-Recursive Context-Free Grammars 81
Probabilistic Context-Free Grammars Estimated from Infinite Distributions 81
A Polynomial-Time Parsing Algorithm for TT-MCTAG 79
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing 79
A Rank Hierarchy for Deterministic Tree-Walking Transducers 76
Language Models for Automatic Speech Recognition 75
Generalized Multitext Grammars 73
Synchronous Rewriting in Treebanks 72
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization 72
Prefix Probabilities from Stochastic Tree Adjoining Grammars 72
Prefix probabilities for linear context-free rewriting systems 71
Parsing Non-Recursive Context-Free Grammars 71
Probabilistic Parsing Strategies 70
Synchronous Context-Free Grammars and Optimal Parsing Strategies 70
Language Modeling using Stochastic Context-Free Grammars 69
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata 69
A computational approach to Binding Theory 69
String Transformation Learning 69
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammars 68
Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars 68
An extended theory of head-driven parsing 66
Factoring Synchronous Grammars by Sorting 66
Complexity of parsing for some lexicalized formalisms 65
Ordered Tree Decomposition for HRG Rule Extraction 65
An Information Theoretic Measure to Evaluate Parsing Difficulty Across Treebanks 64
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy 63
An Incremental Parser for Abstract Meaning Representation 63
Optimal k-arization of Synchronous Tree-Adjoining Grammar 61
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems 61
Sequence-to-sequence Models for Cache Transition Systems 60
Z-Automata for Compact and Direct Representation of Unranked Tree Languages 58
Formal Properties of Non-Locality 56
On the Complexity of Non-Projective Data-Driven Dependency Parsing 56
Prefix Probabilities for Linear Context-Free Rewriting Systems 56
Splittability of Bilexical Context-Free Grammars is Undecidable 54
Left-To-Right Parsing and Bilexical Context-Free Grammars 53
Probabilistic Parsing Strategies 53
Proceedings of the Fourth Italian Conference on Computational Linguistics (CLiC-it 2017) 53
Probabilistic parsing as intersection 52
Parsing Algorithms based on Tree Automata 50
An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two 50
Recognition of Linear Context-Free Rewriting Systems 49
Tabular Parsing 48
Guided Learning for Bidirectional Sequence Classification 47
Prefix Probabilities for Linear Indexed Grammars 47
Tree Adjoining Grammar Parsing and Boolean Matrix Multiplication 46
Computation of Probabilities for Island-Driven Parsers 45
The Parsing Problem for Tree Adjoining Grammars 45
On the Complexity of CCG Parsing 45
Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing 44
Computation of Infix Probabilities for Probabilistic Context-Free Grammars 44
Dynamic Programming Algorithms for Transition-Based Dependency Parsers 44
Algorithmic aspects of natural language processing 44
Approximate PCFG Parsing Using Tensor Decomposition 44
The Membership Problem for Unordered Vector Languages 43
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems 42
IDL-Expressions: A Compact Representation for Finite Languages in Generation Systems 41
Partially ordered multiset context-free grammars and free-word-order parsing 41
A Faster Parsing Algorithm for Lexicalized Tree-Adjoining Grammars 41
Probabilistic Parsing Strategies 41
Analyzing an italian treebank with state-of-the-art statistical parsers 40
Head-Driven BiDirectional Parsing: A Tabular Method 40
Synchronous String Rewriting 38
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs 34
A Rewriting System for Free Word Order Syntax that is Non-Local and Mildly Context Sensitive 33
Computational Aspects of Operator-Variable Structures 33
Optimality Theory and Generative Complexity 33
Totale 6.896
Salva come PNG Salva come JPEG
Categoria #
all - tutte 26.890
article - articoli 9.600
book - libri 364
conference - conferenze 0
curatela - curatele 176
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.220
Totale 38.250
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.337 0 0 0 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/2024269 13 42 28 26 7 5 3 1 7 10 64 63
2024/2025291 0 146 92 53 0 0 0 0 0 0 0 0
Totale 7.596