E-LIB Suche - Ergebnisse für: Satta, Giorgio

1

Tractable Parsing for CCGs of Bounded Degree:

Schiffer, Lena Katharina ; Kuhlmann, Marco ; Satta, Giorgio
Computational Linguistics. 48 (2022) 3 - p. 593-633 , 2022

Link: https://doi.org/10.1162/..

2

Bottom-up unranked tree-to-graph transducers for translatio..:

Björklund, Johanna ; Cohen, Shay B. ; Drewes, Frank.
Theoretical Computer Science. 870 (2021) - p. 3-28 , 2021

Link: https://doi.org/10.1016/..

3

CYK Parsing over Distributed Representations:

Zanzotto, Fabio Massimo ; Satta, Giorgio ; Cristini, Giordano
Algorithms. 13 (2020) 10 - p. 262 , 2020

Link: https://doi.org/10.3390/..

4

Ordered Tree Decomposition for HRG Rule Extraction:

Gildea, Daniel ; Satta, Giorgio ; Peng, Xiaochang
Computational Linguistics. 45 (2019) 2 - p. 339-379 , 2019

Link: https://doi.org/10.1162/..

5

Z-Automata for Compact and Direct Representation of Unranke..:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,

Björklund, Johanna ; Drewes, Frank ; Satta, Giorgio - p. 83-94 , 2019

Link: https://doi.org/10.1007/..

6

Weighted DAG Automata for Semantic Graphs:

Chiang, David ; Drewes, Frank ; Gildea, Daniel..
Computational Linguistics. 44 (2018) 1 - p. 119-186 , 2018

Link: https://doi.org/10.1162/..

7

Cache Transition Systems for Graph Parsing:

Gildea, Daniel ; Satta, Giorgio ; Peng, Xiaochang
Computational Linguistics. 44 (2018) 1 - p. 85-118 , 2018

Link: https://doi.org/10.1162/..

8

On the Complexity of CCG Parsing:

Kuhlmann, Marco ; Satta, Giorgio ; Jonsson, Peter
Computational Linguistics. 44 (2018) 3 - p. 447-482 , 2018

Link: https://doi.org/10.1162/..

9

CLiC-it 2017: A Retrospective:

Basili, Roberto ; Nissim, Malvina ; Satta, Giorgio
Italian Journal of Computational Linguistics. 4 (2018) 1 - p. 77-88 , 2018

Link: https://doi.org/10.4000/..

10

Synchronous Context-Free Grammars and Optimal Parsing Strat..:

Gildea, Daniel ; Satta, Giorgio
Computational Linguistics. 42 (2016) 2 - p. 207-243 , 2016

Link: https://doi.org/10.1162/..

11

Lexicalization and Generative Power in CCG:

Kuhlmann, Marco ; Koller, Alexander ; Satta, Giorgio
Computational Linguistics. 41 (2015) 2 - p. 215-247 , 2015

Link: https://doi.org/10.1162/..

12

Synchronous context-free grammars and optimal linear parsin..:

Crescenzi, Pierluigi ; Gildea, Daniel ; Marino, Andrea..
Journal of Computer and System Sciences. 81 (2015) 7 - p. 1333-1356 , 2015

Link: https://doi.org/10.1016/..

13

An information-theoretic measure to evaluate parsing diffic..:

Corazza, Anna ; Lavelli, Alberto ; Satta, Giorgio
ACM Transactions on Speech and Language Processing. 9 (2013) 4 - p. 1-31 , 2013

Link: https://doi.org/10.1145/..

14

An information-theoretic measure to evaluate parsing diffic..:

Corazza, Anna ; Lavelli, Alberto ; Satta, Giorgio
ACM Transactions on Speech and Language Processing (TSLP). 9 (2013) 4 - p. 1-31 , 2013

Link: https://dl.acm.org/doi/1..

15

Tree-Adjoining Grammars Are Not Closed Under Strong Lexical..:

Kuhlmann, Marco ; Satta, Giorgio
Computational Linguistics. 38 (2012) 3 - p. 617-629 , 2012

Link: https://doi.org/10.1162/..