Giorgio Satta

Cituota

	Visi	Nuo 2020
Šaltiniai	3458	628
h-rodyklė	30	12
i10-rodyklė	78	16

200

100

150

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202515 35 23 21 29 32 34 68 49 42 72 54 88 92 131 104 173 195 191 145 159 169 167 165 167 181 163 129 164 109 136 83 7

Viešas pasiekiamumas

Peržiūrėti viską

14 straipsnių

0 straipsnių

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

Mark-Jan NederhofUniversity of St AndrewsPatvirtintas el. paštas st-andrews.ac.uk
Anna CorazzaAssociate Professor, Università degli Studi di Napoli Federico IIPatvirtintas el. paštas unina.it
Marco KuhlmannLinköping UniversityPatvirtintas el. paštas liu.se
Renato De MoriMc Gill UniversityPatvirtintas el. paštas cs.mcgill.ca
Carlos Gómez-RodríguezUniversidade da Coruña, CITICPatvirtintas el. paštas udc.es
Daniel GildeaProfessor of Computer Science, University of RochesterPatvirtintas el. paštas cs.rochester.edu
Alberto LavelliFBK-irstPatvirtintas el. paštas fbk.eu
Shay CohenUniversity of EdinburghPatvirtintas el. paštas inf.ed.ac.uk
Owen RambowStony Brook UniversityPatvirtintas el. paštas stonybrook.edu
Robert FrankProfessor of Linguistics, Yale UniversityPatvirtintas el. paštas yale.edu
Jason EisnerProfessor of Computer Science, Johns Hopkins UniversityPatvirtintas el. paštas cs.jhu.edu
Oliviero StockFBK Distinguished FellowPatvirtintas el. paštas fbk.eu
Xiaochang PengFacebookPatvirtintas el. paštas fb.com
Fabio CiravegnaDipartimento di Informatica, Università di TorinoPatvirtintas el. paštas unito.it
Malvina NissimProfessor of Computational Linguistics and Society, Rijksuniversiteit GroningenPatvirtintas el. paštas rug.nl
Roberto BasiliUniversity of Rome, Tor Vergata (Italy)Patvirtintas el. paštas info.uniroma2.it
Libin ShenCEO, Leyan TechPatvirtintas el. paštas leyantech.com
Marco DamonteAmazonPatvirtintas el. paštas amazon.com
Stuart ShieberHarvard UniversityPatvirtintas el. paštas seas.harvard.edu
Laura KallmeyerProfessor of Computational Linguistics, Duesseldorf UniversityPatvirtintas el. paštas phil.uni-duesseldorf.de

Stebėti

Giorgio Satta

University of Padua

Patvirtintas el. paštas dei.unipd.it - Pagrindinis puslapis

natural language processing computational linguistics natural language parsing formal languages


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
Guided learning for bidirectional sequence classification L Shen, G Satta, A Joshi Proceedings of the 45th annual meeting of the association of computational …, 2007	238	2007
An incremental parser for abstract meaning representation M Damonte, SB Cohen, G Satta arXiv preprint arXiv:1608.06111, 2016	218	2016
Efficient parsing for bilexical context-free grammars and head automaton grammars J Eisner, G Satta Proceedings of the 37th Annual Meeting of the Association for Computational …, 1999	197	1999
Optimality theory and the generative complexity of constraint violability R Frank, G Satta Computational linguistics 24 (2), 307-315, 1998	194	1998
On the complexity of non-projective data-driven dependency parsing R McDonald, G Satta Proceedings of the Tenth International Conference on Parsing Technologies …, 2007	157	2007
Dynamic programming algorithms for transition-based dependency parsers M Kuhlmann, C Gómez-Rodríguez, G Satta Proceedings of the 49th Annual Meeting of the Association for Computational …, 2011	127	2011
Efficient text fingerprinting via Parikh mapping A Amir, A Apostolico, GM Landau, G Satta Journal of Discrete Algorithms 1 (5-6), 409-421, 2003	81	2003
Generalized multitext grammars ID Melamed, G Satta, B Wellington Proceedings of the 42nd Annual Meeting of the Association for Computational …, 2004	74	2004
Some computational complexity results for synchronous context-free grammars G Satta, E Peserico Proceedings of Human Language Technology Conference and Conference on …, 2005	67	2005
Independent parallelism in finite copying parallel rewriting systems O Rambow, G Satta Theoretical Computer Science 223 (1-2), 87-120, 1999	67	1999
Learning to tag for information extraction from text F Ciravegna ECAI Workshop on Machine Learning for Information Extraction, 2000	63	2000
A polynomial-time dynamic oracle for non-projective dependency parsing C Gómez-Rodríguez, F Sartorio, G Satta Proceedings of the 2014 Conference on Empirical Methods in Natural Language …, 2014	61	2014
Tree-adjoining grammar parsing and boolean matrix multiplication G Satta Computational linguistics 20 (2), 173-191, 1994	60	1994
Probabilistic parsing as intersection MJ Nederhof, G Satta Proceedings of the Eighth International Conference on Parsing Technologies …, 2003	59	2003
Treebank grammar techniques for non-projective dependency parsing M Kuhlmann, G Satta Proceedings of the 12th Conference of the European Chapter of the ACL (EACL …, 2009	58	2009
Symbol–relation grammars: a formalism for graphical languages F Ferrucci, G Pacini, G Satta, MI Sessa, G Tortora, M Tucci, G Vitiello Information and Computation 131 (1), 1-46, 1996	55	1996
Computation of Probabilities A Corazza, R De Mori, R Gretter, G Satta IEEE Transactions on Pattern Analysis and Machine Intelligence 13 (9), 1991	53	1991
Bidirectional context-free grammar parsing for natural language processing G Satta, O Stock Artificial Intelligence 69 (1-2), 123-164, 1994	50	1994
Recognition of linear context-free rewriting systems G Satta 30th Annual Meeting of the Association for Computational Linguistics, 89-95, 1992	45	1992
Lexicalization and generative power in CCG M Kuhlmann, A Koller, G Satta Computational Linguistics 41 (2), 215-247, 2015	44	2015

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai