G
Giorgio Satta
Researcher at University of Padua
Publications - 135
Citations - 2904
Giorgio Satta is an academic researcher from University of Padua. The author has contributed to research in topics: Parsing & Parser combinator. The author has an hindex of 27, co-authored 134 publications receiving 2787 citations. Previous affiliations of Giorgio Satta include University of Pennsylvania & IEEE Computer Society.
Papers
More filters
Proceedings Article
Guided Learning for Bidirectional Sequence Classification
TL;DR: In this paper, the tasks of learning the order of inference and training the local classifier are dynamically incorporated into a single perceptron-like learning algorithm, which achieves an error rate of 2.67% on the standard PTB test set.
Proceedings ArticleDOI
Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars
Jason Eisner,Giorgio Satta +1 more
TL;DR: This work presents O(n4) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O( n5) by one step and an improved grammar constant by another.
Proceedings ArticleDOI
An Incremental Parser for Abstract Meaning Representation
TL;DR: This article proposed a transition-based parser for AMR that parses sentences left-to-right, in linear time, and showed that their parser is competitive with the state of the art on the LDC2015E86 dataset and that it outperforms state-of-theart parsers for recovering named entities and handling polarity.
Proceedings ArticleDOI
On the Complexity of Non-Projective Data-Driven Dependency Parsing
Ryan McDonald,Giorgio Satta +1 more
TL;DR: This paper investigates several non-projective parsing algorithms for dependency parsing, providing novel polynomial time solutions under the assumption that each dependency decision is independent of all the others, called here the edge-factored model.
Journal Article
Optimality theory and the generative complexity of constraint violability
Robert Frank,Giorgio Satta +1 more
TL;DR: It is shown that the conditions under which the phonological descriptions that are possible within the view of constraint interaction embodied in Optimality Theory remain within the class of rational relations are correct when GEN is itself a rational relation.