( en | de | ru )

 

Disambiguation of "Satta, Giorgio"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Non-Projective Data-Driven Dependency Parsing.

, and . IWPT, page 121-132. Association for Computational Linguistics, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Riccardo Satta

Giorgio Cortellaro

Giorgio Stefanoni

Petra Sattar

Majid Sattar

 

Other publications of authors with the same name

Optimality Theory and the Generative Complexity of Constraint Violability, and . Computational Linguistics, (1999)To appear..Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication.. Computational Linguistics, 20 (2): 173-191 (1994)Splittability of Bilexical Context-Free Grammars is Undecidable., and . Comput. Linguistics, 37 (4): 867-879 (2011)Bidirectional Context-Free Grammar Parsing for Natural Language Processing., and . Artif. Intell., 69 (1-2): 123-164 (1994)Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems.. J. Comput. Syst. Sci., 56 (1): 27-45 (1998)Formal Properties and Implementation of Bidirectional Charts., and . IJCAI, page 1480-1485. Morgan Kaufmann, (1989)Comparing Italian parsers on a common Treebank: the EVALITA experience., , , , , , , , and . LREC, European Language Resources Association, (2008)Approximate PCFG Parsing Using Tensor Decomposition., , and . HLT-NAACL, page 487-496. The Association for Computational Linguistics, (2013)Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems., , and . HLT-NAACL, page 276-284. The Association for Computational Linguistics, (2010)Prefix Probability for Probabilistic Synchronous Context-Free Grammars., and . ACL, page 460-469. The Association for Computer Linguistics, (2011)