The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Giorgio Satta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anna Corazza, Renato de Mori, Giorgio Satta
    Computation of Upper-Bounds for Stochastic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:344-349 [Conf]
  2. Giorgio Satta, Oliviero Stock
    A Tabular Method for Island-Driven Context-Free Grammar Parsing. [Citation Graph (0, 0)][DBLP]
    AAAI, 1991, pp:143-148 [Conf]
  3. Jason Eisner, Giorgio Satta
    Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars. [Citation Graph (0, 0)][DBLP]
    ACL, 1999, pp:- [Conf]
  4. Daniel Gildea, Giorgio Satta, Hao Zhang
    Factoring Synchronous Grammars by Sorting. [Citation Graph (0, 0)][DBLP]
    ACL, 2006, pp:- [Conf]
  5. I. Dan Melamed, Giorgio Satta, Benjamin Wellington
    Generalized Multitext Grammars. [Citation Graph (0, 0)][DBLP]
    ACL, 2004, pp:661-668 [Conf]
  6. Mark-Jan Nederhof, Giorgio Satta
    Parsing non-recursive CFGs. [Citation Graph (0, 0)][DBLP]
    ACL, 2002, pp:112-119 [Conf]
  7. Mark-Jan Nederhof, Giorgio Satta
    Probabilistic Parsing Strategies. [Citation Graph (0, 0)][DBLP]
    ACL, 2004, pp:542-549 [Conf]
  8. Mark-Jan Nederhof, Giorgio Satta
    An Alternative Method of Training Probabilistic LR Parsers. [Citation Graph (0, 0)][DBLP]
    ACL, 2004, pp:550-557 [Conf]
  9. Mark-Jan Nederhof, Giorgio Satta
    An Extended Theory of Head-Driven Parsing. [Citation Graph (0, 0)][DBLP]
    ACL, 1994, pp:210-217 [Conf]
  10. Mark-Jan Nederhof, Giorgio Satta
    Efficient Tabular LR Parsing. [Citation Graph (0, 0)][DBLP]
    ACL, 1996, pp:239-247 [Conf]
  11. Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
    Prefix Probabilities from Stochastic Tree Adjoining Grammars. [Citation Graph (0, 0)][DBLP]
    COLING-ACL, 1998, pp:953-959 [Conf]
  12. Owen Rambow, Giorgio Satta
    Synchronous Models of Language. [Citation Graph (0, 0)][DBLP]
    ACL, 1996, pp:116-123 [Conf]
  13. Giorgio Satta
    Recognition of Linear Context-Free Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ACL, 1992, pp:89-95 [Conf]
  14. Giorgio Satta, Eric Brill
    Efficient Transformation-Based Parsing. [Citation Graph (0, 0)][DBLP]
    ACL, 1996, pp:255-262 [Conf]
  15. Giorgio Satta, John C. Henderson
    String Transformation Learning. [Citation Graph (0, 0)][DBLP]
    ACL, 1997, pp:444-451 [Conf]
  16. Giorgio Satta, William Schuler
    Restrictions on Tree Adjoining Languages. [Citation Graph (0, 0)][DBLP]
    COLING-ACL, 1998, pp:1176-1182 [Conf]
  17. Mark-Jan Nederhof, Giorgio Satta
    A Variant of Early Parsing. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1997, pp:84-95 [Conf]
  18. Mark-Jan Nederhof, Giorgio Satta
    Left-To-Right Parsing and Bilexical Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    ANLP, 2000, pp:272-279 [Conf]
  19. Owen Rambow, Giorgio Satta
    A Rank Hierarchy for Determinsitic Tree-Walking Transducers. [Citation Graph (0, 0)][DBLP]
    CAAP, 1994, pp:309-321 [Conf]
  20. Alessandra Giorgi, Fabio Pianesi, Giorgio Satta
    A Computational Approach to Binding Theory. [Citation Graph (0, 0)][DBLP]
    COLING, 1990, pp:120-125 [Conf]
  21. Alberto Apostolico, Cinzia Pizzi, Giorgio Satta
    Optimal Discovery of Subword Associations in Strings. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:270-277 [Conf]
  22. Giorgio Satta
    The Membership Problem for Unordered Vector Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:267-275 [Conf]
  23. Alberto Lavelli, Giorgio Satta
    Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars. [Citation Graph (0, 0)][DBLP]
    EACL, 1991, pp:27-32 [Conf]
  24. Fabio Ciravegna, Alberto Lavelli, Giorgio Satta
    Bringing Information Extraction out of the Labs: the NoName Environment. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:416-420 [Conf]
  25. Giorgio Satta, Oliviero Stock
    Formal Properties and Implementation of Bidirectional Charts. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:1480-1485 [Conf]
  26. Anna Corazza, Giorgio Satta
    Cross-Entropy and Estimation of Probabilistic Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    HLT-NAACL, 2006, pp:- [Conf]
  27. Mark-Jan Nederhof, Giorgio Satta
    Estimation of Consistent Probabilistic Context-free Grammars. [Citation Graph (0, 0)][DBLP]
    HLT-NAACL, 2006, pp:- [Conf]
  28. Giorgio Satta, Enoch Peserico
    Some Computational Complexity Results for Synchronous Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    HLT/EMNLP, 2005, pp:- [Conf]
  29. Giorgio Satta, Oliviero Stock
    Bidirectional Context-Free Grammar Parsing for Natural Language Processing. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:69, n:1-2, pp:123-164 [Journal]
  30. Robert Frank, Giorgio Satta
    Optimality Theory and the Generative Complexity of Constraint Violability. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 1998, v:24, n:2, pp:307-315 [Journal]
  31. Giorgio Satta
    Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 1994, v:20, n:2, pp:173-191 [Journal]
  32. Mark-Jan Nederhof, Giorgio Satta
    Efficient Tabular LR Parsing [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  33. Owen Rambow, Giorgio Satta
    Synchronous Models of Language [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  34. Mark-Jan Nederhof, Giorgio Satta
    A Variant of Earley Parsing [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  35. Mark-Jan Nederhof, Giorgio Satta
    Probabilistic Parsing Strategies [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  36. Mark-Jan Nederhof, Giorgio Satta
    Tabular Parsing [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  37. Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
    Prefix Probabilities from Stochastic Tree Adjoining Grammars [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  38. Giorgio Satta, William Schuler
    Restrictions on Tree Adjoining Languages [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  39. Filomena Ferrucci, Giuliano Pacini, Giorgio Satta, Maria I. Sessa, Genoveffa Tortora, Maurizio Tucci, Giuliana Vitiello
    Symbol-Relation Grammars: A Formalism for Graphical Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:131, n:1, pp:1-46 [Journal]
  40. Mark-Jan Nederhof, Giorgio Satta
    The language intersection problem for non-recursive context-free grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:192, n:2, pp:172-184 [Journal]
  41. Mark-Jan Nederhof, Giorgio Satta
    Probabilistic parsing strategies. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:406-436 [Journal]
  42. Mark-Jan Nederhof, Giorgio Satta
    IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:21, n:, pp:287-317 [Journal]
  43. Giorgio Satta
    Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:1, pp:27-45 [Journal]
  44. Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta
    Efficient text fingerprinting via Parikh mapping. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:5-6, pp:409-421 [Journal]
  45. Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta
    Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1994, v:16, n:10, pp:1018-1027 [Journal]
  46. Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta
    Computation of Probabilities for an Island-Driven Parser. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1991, v:13, n:9, pp:936-950 [Journal]
  47. Owen Rambow, Giorgio Satta
    Independent Parallelism in Finite Copying Parallel Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:223, n:1-2, pp:87-120 [Journal]
  48. Anna Corazza, Giorgio Satta
    Probabilistic Context-Free Grammars Estimated from Infinite Distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2007, v:29, n:8, pp:1379-1393 [Journal]

  49. Guided Learning for Bidirectional Sequence Classification. [Citation Graph (, )][DBLP]


  50. Optimal $k$-arization of Synchronous Tree-Adjoining Grammar. [Citation Graph (, )][DBLP]


  51. Treebank Grammar Techniques for Non-Projective Dependency Parsing. [Citation Graph (, )][DBLP]


  52. Synchronous Rewriting in Treebanks. [Citation Graph (, )][DBLP]


  53. Parsing Algorithms based on Tree Automata. [Citation Graph (, )][DBLP]


  54. Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. [Citation Graph (, )][DBLP]


  55. Comparing Italian parsers on a common Treebank: the EVALITA experience. [Citation Graph (, )][DBLP]


Search in 0.494secs, Finished in 0.497secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002