Searching for authors named "Giorgio Satta" – sorted by Relevance.
-
Restrictions on tree adjoining languages
- arXiv:cs/9810015v1 [cs.CL] 13 Oct 1998 Restrictions on Tree Adjoining Languages Giorgio Satta Dip
- Cited by 3 (0 self) – Add To MetaCart
-
Recognition Of Linear Context-Free Rewriting Systems
- -90- J-1863, NSF grant IRI 90-16592 and Ben Franklin grant 91S.3078C-1. Giorgio Satta Institute
- Cited by 8 (3 self) – Add To MetaCart
-
Some computational complexity results for synchronous context-free grammars
- Some Computational Complexity Results for Synchronous Context-Free Grammars Giorgio Satta Dept
- Cited by 13 (1 self) – Add To MetaCart
-
Optimality Theory and the Generative Complexity of Contraint Violability
- and Giorgio Satta Optimality Theory and Generative Complexity lower ranked constraints to be violated in order
- Add To MetaCart
-
A Two-Dimensional Hierarchy for Parallel Rewriting Systems
- University of Pennsylvania Giorgio Satta Universit�� di Venezia IRCS Report 94-02 University of Pennsylvania
- Cited by 6 (1 self) – Add To MetaCart
-
Efficient Tabular LR Parsing
- (1989): the construction of push- down automata from grammars and the simulation Giorgio Satta
- Cited by 12 (6 self) – Add To MetaCart
-
Probabilistic parsing strategies
- .O. Box 716 NL-9700 AS Groningen, The Netherlands markjan@(email omitted); Giorgio Satta Department
- Cited by 2 (1 self) – Add To MetaCart
-
A variant of earley parsing
- arXiv:cmp-lg/9808017 v1 31 Aug 1998 A Variant of Earley Parsing Mark-Jan Nederhof 1⋆ and Giorgio
- Cited by 2 (0 self) – Add To MetaCart
-
Efficient Transformation-Based Parsing
- Efficient Transformation-Based Parsing Giorgio Satta Eric Brill Dipartimento di Elettronica ed
- Cited by 5 (0 self) – Add To MetaCart
-
Parsing Non-Recursive Context-Free Grammars
- for ¡ Artificial Intelligence (DFKI). Giorgio Satta Dip. di Elettronica e Informatica Università di Padova via
- Cited by 2 (0 self) – Add To MetaCart

