default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiorgio Satta
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j34]Lena Katharina Schiffer, Marco Kuhlmann, Giorgio Satta:
Tractable Parsing for CCGs of Bounded Degree. Comput. Linguistics 48(3): 593-633 (2022)- 2021
- [j33]Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta:
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. Theor. Comput. Sci. 870: 3-28 (2021) - [p2]Mark-Jan Nederhof, Giorgio Satta:
Natural language parsing. Handbook of Automata Theory (II.) 2021: 1383-1413 - 2020
- [j32]Fabio Massimo Zanzotto
, Giorgio Satta, Giordano Cristini:
CYK Parsing over Distributed Representations. Algorithms 13(10): 262 (2020)
2010 – 2019
- 2019
- [j31]Daniel Gildea, Giorgio Satta, Xiaochang Peng:
Ordered Tree Decomposition for HRG Rule Extraction. Comput. Linguistics 45(2): 339-379 (2019) - [c67]Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta:
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. FSMNLP 2019: 7-17 - [c66]Johanna Björklund, Frank Drewes, Giorgio Satta:
Z-Automata for Compact and Direct Representation of Unranked Tree Languages. CIAA 2019: 83-94 - 2018
- [j30]David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta:
Weighted DAG Automata for Semantic Graphs. Comput. Linguistics 44(1) (2018) - [j29]Daniel Gildea, Giorgio Satta, Xiaochang Peng:
Cache Transition Systems for Graph Parsing. Comput. Linguistics 44(1) (2018) - [j28]Marco Kuhlmann, Giorgio Satta, Peter Jonsson:
On the Complexity of CCG Parsing. Comput. Linguistics 44(3) (2018) - [c65]Xiaochang Peng, Daniel Gildea, Giorgio Satta:
AMR Parsing With Cache Transition Systems. AAAI 2018: 4897-4904 - [c64]Xiaochang Peng, Linfeng Song, Daniel Gildea, Giorgio Satta:
Sequence-to-sequence Models for Cache Transition Systems. ACL (1) 2018: 1842-1852 - 2017
- [c63]Marco Damonte, Shay B. Cohen, Giorgio Satta:
An Incremental Parser for Abstract Meaning Representation. EACL (1) 2017: 536-546 - [e3]Roberto Basili, Malvina Nissim, Giorgio Satta:
Proceedings of the Fourth Italian Conference on Computational Linguistics (CLiC-it 2017), Rome, Italy, December 11-13, 2017. CEUR Workshop Proceedings 2006, CEUR-WS.org 2017 [contents] - [i13]Marco Kuhlmann, Giorgio Satta, Peter Jonsson:
On the Complexity of CCG Parsing. CoRR abs/1702.06594 (2017) - 2016
- [j27]Daniel Gildea, Giorgio Satta:
Synchronous Context-Free Grammars and Optimal Parsing Strategies. Comput. Linguistics 42(2): 207-243 (2016) - [i12]Marco Damonte, Shay B. Cohen, Giorgio Satta:
An Incremental Parser for Abstract Meaning Representation. CoRR abs/1608.06111 (2016) - 2015
- [j26]Marco Kuhlmann, Alexander Koller, Giorgio Satta:
Lexicalization and Generative Power in CCG. Comput. Linguistics 41(2): 215-247 (2015) - [j25]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. 81(7): 1333-1356 (2015) - 2014
- [j24]Mark-Jan Nederhof, Giorgio Satta:
Prefix probabilities for linear context-free rewriting systems. J. Log. Comput. 24(2): 331-350 (2014) - [j23]Yoav Goldberg, Francesco Sartorio, Giorgio Satta:
A Tabular Method for Dynamic Oracles in Transition-Based Parsing. Trans. Assoc. Comput. Linguistics 2: 119-130 (2014) - [j22]Marco Kuhlmann, Giorgio Satta:
A New Parsing Algorithm for Combinatory Categorial Grammar. Trans. Assoc. Comput. Linguistics 2: 405-418 (2014) - [c62]Carlos Gómez-Rodríguez, Francesco Sartorio, Giorgio Satta:
A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing. EMNLP 2014: 917-927 - 2013
- [j21]Giorgio Satta, Marco Kuhlmann:
Efficient Parsing for Head-Split Dependency Trees. Trans. Assoc. Comput. Linguistics 1: 267-278 (2013) - [j20]Anna Corazza, Alberto Lavelli, Giorgio Satta:
An information-theoretic measure to evaluate parsing difficulty across treebanks. ACM Trans. Speech Lang. Process. 9(4): 7:1-7:31 (2013) - [c61]Francesco Sartorio, Giorgio Satta, Joakim Nivre:
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy. ACL (1) 2013: 135-144 - [c60]Shay B. Cohen, Giorgio Satta, Michael Collins:
Approximate PCFG Parsing Using Tensor Decomposition. HLT-NAACL 2013: 487-496 - [i11]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR abs/1311.6421 (2013) - 2012
- [j19]Marco Kuhlmann, Giorgio Satta:
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization. Comput. Linguistics 38(3): 617-629 (2012) - [c59]Andrea Gesmundo, Giorgio Satta, James Henderson:
Heuristic Cube Pruning in Linear Time. ACL (2) 2012: 296-300 - [e2]Giorgio Satta, Chung-Hye Han:
Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG+ 2012, Paris, France, September 26-28, 2012. ACL 2012, ISBN 978-1-937284-46-6 [contents] - [i10]Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta:
Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing. CoRR abs/1206.6735 (2012) - 2011
- [j18]Mark-Jan Nederhof, Giorgio Satta:
Splittability of Bilexical Context-Free Grammars is Undecidable. Comput. Linguistics 37(4): 867-879 (2011) - [c58]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL 2011: 450-459 - [c57]Mark-Jan Nederhof, Giorgio Satta:
Prefix Probability for Probabilistic Synchronous Context-Free Grammars. ACL 2011: 460-469 - [c56]Marco Kuhlmann, Carlos Gómez-Rodríguez, Giorgio Satta:
Dynamic Programming Algorithms for Transition-Based Dependency Parsers. ACL 2011: 673-682 - [c55]Mark-Jan Nederhof, Giorgio Satta:
Computation of Infix Probabilities for Probabilistic Context-Free Grammars. EMNLP 2011: 1213-1221 - [c54]Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta:
Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing. EMNLP 2011: 1234-1245 - [c53]Mark-Jan Nederhof, Giorgio Satta:
Prefix Probabilities for Linear Context-Free Rewriting Systems. IWPT 2011: 151-162 - [i9]Mark-Jan Nederhof, Giorgio Satta:
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. CoRR abs/1107.0026 (2011) - 2010
- [j17]Rebecca Nesson, Giorgio Satta, Stuart M. Shieber:
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar. Comput. Linguistics 36(3): 443-480 (2010) - [c52]Andreas Maletti, Giorgio Satta:
Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. ATANLP@ACL 2010 2010: 19-27 - [c51]Benoît Sagot, Giorgio Satta:
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL 2010: 525-533 - [c50]Marco Kuhlmann, Alexander Koller, Giorgio Satta:
The Importance of Rule Restrictions in CCG. ACL 2010: 534-543 - [c49]Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta:
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. HLT-NAACL 2010: 276-284
2000 – 2009
- 2009
- [j16]Alberto Apostolico, Giorgio Satta:
Discovering subword associations in strings in time linear in the output size. J. Discrete Algorithms 7(2): 227-238 (2009) - [c48]Carlos Gómez-Rodríguez, Giorgio Satta:
An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL/IJCNLP 2009: 985-993 - [c47]Laura Kallmeyer, Giorgio Satta:
A Polynomial-Time Parsing Algorithm for TT-MCTAG. ACL/IJCNLP 2009: 994-1002 - [c46]Marco Kuhlmann, Giorgio Satta:
Treebank Grammar Techniques for Non-Projective Dependency Parsing. EACL 2009: 478-486 - [c45]Andreas Maletti, Giorgio Satta:
Parsing Algorithms based on Tree Automata. IWPT 2009: 1-12 - [c44]Laura Kallmeyer, Wolfgang Maier, Giorgio Satta:
Synchronous Rewriting in Treebanks. IWPT 2009: 69-72 - [c43]Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, David J. Weir:
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. HLT-NAACL 2009: 539-547 - 2008
- [j15]Mark-Jan Nederhof, Giorgio Satta:
Computation of distances for regular and context-free probabilistic languages. Theor. Comput. Sci. 395(2-3): 235-254 (2008) - [c42]Rebecca Nesson, Giorgio Satta, Stuart M. Shieber:
Optimal k-arization of Synchronous Tree-Adjoining Grammar. ACL 2008: 604-612 - [c41]Cristina Bosco, Alessandro Mazzei, Vincenzo Lombardo, Giuseppe Attardi, Anna Corazza, Alberto Lavelli, Leonardo Lesmo, Giorgio Satta, Maria Simi:
Comparing Italian parsers on a common Treebank: the EVALITA experience. LREC 2008 - [p1]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing. New Developments in Formal Languages and Applications 2008: 229-258 - 2007
- [j14]Anna Corazza, Giorgio Satta:
Probabilistic Context-Free Grammars Estimated from Infinite Distributions. IEEE Trans. Pattern Anal. Mach. Intell. 29(8): 1379-1393 (2007) - [c40]Libin Shen, Giorgio Satta, Aravind K. Joshi:
Guided Learning for Bidirectional Sequence Classification. ACL 2007 - [c39]Ryan T. McDonald, Giorgio Satta:
On the Complexity of Non-Projective Data-Driven Dependency Parsing. IWPT 2007: 121-132 - 2006
- [j13]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic parsing strategies. J. ACM 53(3): 406-436 (2006) - [c38]Daniel Gildea, Giorgio Satta, Hao Zhang:
Factoring Synchronous Grammars by Sorting. ACL 2006 - [c37]Anna Corazza, Giorgio Satta:
Cross-Entropy and Estimation of Probabilistic Context-Free Grammars. HLT-NAACL 2006 - [c36]Mark-Jan Nederhof, Giorgio Satta:
Estimation of Consistent Probabilistic Context-free Grammars. HLT-NAACL 2006 - 2005
- [c35]Giorgio Satta, Enoch Peserico:
Some Computational Complexity Results for Synchronous Context-Free Grammars. HLT/EMNLP 2005: 803-810 - 2004
- [j12]Mark-Jan Nederhof, Giorgio Satta:
The language intersection problem for non-recursive context-free grammars. Inf. Comput. 192(2): 172-184 (2004) - [j11]Mark-Jan Nederhof, Giorgio Satta:
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. J. Artif. Intell. Res. 21: 287-317 (2004) - [c34]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing Strategies. ACL 2004: 542-549 - [c33]Mark-Jan Nederhof, Giorgio Satta:
An Alternative Method of Training Probabilistic LR Parsers. ACL 2004: 550-557 - [c32]I. Dan Melamed, Giorgio Satta, Benjamin Wellington:
Generalized Multitext Grammars. ACL 2004: 661-668 - [c31]Mark-Jan Nederhof, Giorgio Satta:
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. COLING 2004 - [c30]Alberto Apostolico, Cinzia Pizzi, Giorgio Satta:
Optimal Discovery of Subword Associations in Strings. Discovery Science 2004: 270-277 - [i8]Mark-Jan Nederhof, Giorgio Satta:
Tabular Parsing. CoRR cs.CL/0404009 (2004) - 2003
- [j10]Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta:
Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1(5-6): 409-421 (2003) - [c29]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing as Intersection. IWPT 2003: 137-148 - [c28]Mark-Jan Nederhof, Giorgio Satta, Stuart M. Shieber:
Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. IWPT 2003: 171-182 - 2002
- [c27]Mark-Jan Nederhof, Giorgio Satta:
Parsing non-recursive CFGs. ACL 2002: 112-119 - [c26]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing Strategies. DCFS 2002: 216-230 - [i7]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing Strategies. CoRR cs.CL/0211017 (2002) - 2000
- [c25]Mark-Jan Nederhof, Giorgio Satta:
Left-To-Right Parsing and Bilexical Context-Free Grammars. ANLP 2000: 272-279 - [c24]Fabio Ciravegna, Alberto Lavelli, Giorgio Satta:
Bringing Information Extraction out of the Labs: the NoName Environment. ECAI 2000: 416-420 - [c23]Giorgio Satta:
Parsing Techniques for Lexicalized Context-Free Grammars. IWPT 2000: 10-14 - [c22]Jason Eisner, Giorgio Satta:
A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars. TAG+ 2000: 79-84
1990 – 1999
- 1999
- [j9]Owen Rambow, Giorgio Satta:
Independent Parallelism in Finite Copying Parallel Rewriting Systems. Theor. Comput. Sci. 223(1-2): 87-120 (1999) - [c21]Jason Eisner, Giorgio Satta:
Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars. ACL 1999: 457-464 - 1998
- [j8]Robert Frank, Giorgio Satta:
Optimality Theory and the Generative Complexity of Constraint Violability. Comput. Linguistics 24(2): 307-315 (1998) - [j7]Giorgio Satta:
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems. J. Comput. Syst. Sci. 56(1): 27-45 (1998) - [c20]Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta:
Prefix Probabilities from Stochastic Tree Adjoining Grammars. COLING-ACL 1998: 953-959 - [c19]Giorgio Satta, William Schuler:
Restrictions on Tree Adjoining Languages. COLING-ACL 1998: 1176-1182 - [c18]Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta:
Prefix probabilities for linear indexed grammars. TAG+ 1998: 116-119 - [e1]Anne Abeillé, Tilman Becker, Giorgio Satta, K. Vijay-Shanker:
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, TAG+ 1998, University of Pennsylvania, USA, August 1998. Institute for Research in Cognitive Science 1998 [contents] - [i6]Mark-Jan Nederhof, Giorgio Satta:
A Variant of Earley Parsing. CoRR cmp-lg/9808017 (1998) - [i5]Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta:
Prefix Probabilities from Stochastic Tree Adjoining Grammars. CoRR cs.CL/9809026 (1998) - [i4]Giorgio Satta, William Schuler:
Restrictions on Tree Adjoining Languages. CoRR cs.CL/9810015 (1998) - 1997
- [c17]Giorgio Satta, John C. Henderson:
String Transformation Learning. ACL 1997: 444-451 - [c16]Mark-Jan Nederhof, Giorgio Satta:
A Variant of Earley Parsing. AI*IA 1997: 84-95 - 1996
- [j6]Filomena Ferrucci, Giuliano Pacini, Giorgio Satta, Maria I. Sessa, Genoveffa Tortora, Maurizio Tucci, Giuliana Vitiello:
Symbol-Relation Grammars: A Formalism for Graphical Languages. Inf. Comput. 131(1): 1-46 (1996) - [c15]Owen Rambow, Giorgio Satta:
Synchronous Models of Language. ACL 1996: 116-123 - [c14]Mark-Jan Nederhof, Giorgio Satta:
Efficient Tabular LR Parsing. ACL 1996: 239-247 - [c13]Giorgio Satta, Eric Brill:
Efficient Transformation-Based Parsing. ACL 1996: 255-262 - [i3]Mark-Jan Nederhof, Giorgio Satta:
Efficient Tabular LR Parsing. CoRR cmp-lg/9605018 (1996) - [i2]Owen Rambow, Giorgio Satta:
Synchronous Models of Language. CoRR cmp-lg/9605032 (1996) - 1995
- [c12]Giorgio Satta:
The Membership Problem for Unordered Vector Languages. Developments in Language Theory 1995: 267-275 - 1994
- [j5]Giorgio Satta, Oliviero Stock:
Bidirectional Context-Free Grammar Parsing for Natural Language Processing. Artif. Intell. 69(1-2): 123-164 (1994) - [j4]Giorgio Satta:
Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication. Comput. Linguistics 20(2): 173-191 (1994) - [j3]Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta:
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars. IEEE Trans. Pattern Anal. Mach. Intell. 16(10): 1018-1027 (1994) - [c11]Mark-Jan Nederhof, Giorgio Satta:
An Extended Theory of Head-Driven Parsing. ACL 1994: 210-217 - [c10]Owen Rambow, Giorgio Satta:
A Rank Hierarchy for Determinsitic Tree-Walking Transducers. CAAP 1994: 309-321 - [i1]Mark-Jan Nederhof, Giorgio Satta:
An Extended Theory of Head-Driven Parsing. CoRR abs/cmp-lg/9405026 (1994) - 1993
- [j2]Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta:
Language modeling using stochastic context-free grammars. Speech Commun. 13(1-2): 163-170 (1993) - 1992
- [c9]Anna Corazza, Renato de Mori, Giorgio Satta:
Computation of Upper-Bounds for Stochastic Context-Free Languages. AAAI 1992: 344-349 - [c8]Giorgio Satta:
Recognition of Linear Context-Free Rewriting Systems. ACL 1992: 89-95 - 1991
- [j1]Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta:
Computation of Probabilities for an Island-Driven Parser. IEEE Trans. Pattern Anal. Mach. Intell. 13(9): 936-950 (1991) - [c7]Giorgio Satta, Oliviero Stock:
A Tabular Method for Island-Driven Context-Free Grammar Parsing. AAAI 1991: 143-148 - [c6]Alberto Lavelli, Giorgio Satta:
Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars. EACL 1991: 27-32 - [c5]Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta:
Computation of upper-bounds for island-driven stochastic parsers. EUROSPEECH 1991: 215-218 - 1990
- [c4]Alessandra Giorgi, Fabio Pianesi, Giorgio Satta:
A Computational Approach to Binding Theory. COLING 1990: 120-125 - [c3]A. Corazzat, Renato de Mori, Roberto Gretter, Giorgio Satta:
Computation of probabilities for island-driven parsers. ICSLP 1990: 897-900
1980 – 1989
- 1989
- [c2]Giorgio Satta, Oliviero Stock:
Formal Properties and Implementation of Bidirectional Charts. IJCAI 1989: 1480-1485 - [c1]Giorgio Satta, Oliviero Stock:
Head-Driven Bidirectional Parsing: A Tabular Method. IWPT 1989: 43-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
