All Stories

  1. CYK Parsing over Distributed Representations

    Article • Algorithms, October 2020, MDPI AG

    Giorgio Satta, Prof. Fabio Massimo Zanzotto

  2. Z-Automata for Compact and Direct Representation of Unranked Tree Languages

    Article • January 2019, Springer Science + Business Media

    Giorgio Satta

  3. On the Complexity of CCG Parsing

    Article • Computational Linguistics, September 2018, The MIT Press

    Giorgio Satta

  4. Cache Transition Systems for Graph Parsing

    Article • Computational Linguistics, March 2018, The MIT Press

    Giorgio Satta

  5. Weighted DAG Automata for Semantic Graphs

    Article • Computational Linguistics, March 2018, The MIT Press

    Giorgio Satta

  6. Sequence-to-sequence Models for Cache Transition Systems

    Article • January 2018, Association for Computational Linguistics (ACL)

    Giorgio Satta

  7. An Incremental Parser for Abstract Meaning Representation

    Article • January 2017, Association for Computational Linguistics (ACL)

    Giorgio Satta

  8. Preface

    Article • January 2017, OpenEdition

    Giorgio Satta

  9. Synchronous Context-Free Grammars and Optimal Parsing Strategies

    Article • Computational Linguistics, June 2016, The MIT Press

    Giorgio Satta

  10. Synchronous context-free grammars and optimal linear parsing strategies

    Article • Journal of Computer and System Sciences, November 2015, Elsevier

    Giorgio Satta

  11. Lexicalization and Generative Power in CCG

    Article • Computational Linguistics, June 2015, The MIT Press

    Giorgio Satta

  12. A New Parsing Algorithm for Combinatory Categorial Grammar

    Article • December 2014, The MIT Press

    Giorgio Satta

  13. A Tabular Method for Dynamic Oracles in Transition-Based Parsing

    Article • December 2014, The MIT Press

    Giorgio Satta

  14. A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing

    Article • January 2014, Association for Computational Linguistics (ACL)

    Giorgio Satta

  15. Efficient Parsing for Head-Split Dependency Trees

    Article • December 2013, The MIT Press

    Giorgio Satta

  16. Prefix probabilities for linear context-free rewriting systems

    Article • Journal of Logic and Computation, January 2013, Oxford University Press (OUP)

    Giorgio Satta

  17. An information-theoretic measure to evaluate parsing difficulty across treebanks

    Article • ACM Transactions on Speech and Language Processing, January 2013, ACM (Association for Computing Machinery)

    Giorgio Satta

  18. Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization

    Article • Computational Linguistics, September 2012, The MIT Press

    Giorgio Satta

  19. Splittability of Bilexical Context-Free Grammars is Undecidable

    Article • Computational Linguistics, December 2011, The MIT Press

    Giorgio Satta

  20. Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar

    Article • Computational Linguistics, September 2010, The MIT Press

    Giorgio Satta

  21. Discovering subword associations in strings in time linear in the output size

    Article • Journal of Discrete Algorithms, June 2009, Elsevier

    Giorgio Satta

  22. Computing Partition Functions of PCFGs

    Article • Research on Language and Computation, March 2009, Springer Science + Business Media

    Giorgio Satta

  23. Optimal reduction of rule length in linear context-free rewriting systems

    Article • January 2009, Association for Computational Linguistics (ACL)

    Giorgio Satta

  24. Treebank grammar techniques for non-projective dependency parsing

    Article • January 2009, Association for Computational Linguistics (ACL)

    Giorgio Satta

  25. Computing Partition Functions of PCFGs

    Article • Research on Language and Computation, October 2008, Springer Science + Business Media

    Giorgio Satta

  26. Computation of distances for regular and context-free probabilistic languages

    Article • Theoretical Computer Science, May 2008, Elsevier

    Giorgio Satta

  27. Probabilistic Context-Free Grammars Estimated from Infinite Distributions

    Article • IEEE Transactions on Pattern Analysis and Machine Intelligence, August 2007, Institute of Electrical & Electronics Engineers (IEEE)

    Giorgio Satta

  28. Probabilistic parsing strategies

    Article • Journal of the ACM, May 2006, ACM (Association for Computing Machinery)

    Giorgio Satta

  29. Cross-entropy and estimation of probabilistic context-free grammars

    Article • January 2006, Association for Computational Linguistics (ACL)

    Giorgio Satta

  30. Estimation of consistent probabilistic context-free grammars

    Article • January 2006, Association for Computational Linguistics (ACL)

    Giorgio Satta

  31. Some computational complexity results for synchronous context-free grammars

    Article • January 2005, Association for Computational Linguistics (ACL)

    Giorgio Satta

  32. The language intersection problem for non-recursive context-free grammars

    Article • Information and Computation, August 2004, Elsevier

    Giorgio Satta

  33. IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing

    Article • Journal of Artificial Intelligence Research, March 2004, AI Access Foundation

    Giorgio Satta

  34. Optimal Discovery of Subword Associations in Strings

    Article • January 2004, Springer Science + Business Media

    Giorgio Satta

  35. Efficient text fingerprinting via Parikh mapping

    Article • Journal of Discrete Algorithms, October 2003, Elsevier

    Giorgio Satta

  36. Independent parallelism in finite copying parallel rewriting systems

    Article • Theoretical Computer Science, July 1999, Elsevier

    Giorgio Satta

  37. Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems

    Article • Journal of Computer and System Sciences, February 1998, Elsevier

    Giorgio Satta

  38. Restrictions on tree adjoining languages

    Article • January 1998, Association for Computational Linguistics (ACL)

    Giorgio Satta

  39. String transformation learning

    Article • January 1997, Association for Computational Linguistics (ACL)

    Giorgio Satta

  40. A variant of Earley parsing

    Article • January 1997, Springer Science + Business Media

    Giorgio Satta

  41. Symbol–Relation Grammars: A Formalism for Graphical Languages

    Article • Information and Computation, November 1996, Elsevier

    Giorgio Satta

  42. Bidirectional context-free grammar parsing for natural language processing

    Article • Artificial Intelligence, September 1994, Elsevier

    Giorgio Satta

  43. Optimal probabilistic evaluation functions for search controlled by stochastic context-free grammars

    Article • IEEE Transactions on Pattern Analysis and Machine Intelligence, January 1994, Institute of Electrical & Electronics Engineers (IEEE)

    Giorgio Satta

  44. Language modeling using stochastic context-free grammars

    Article • Speech Communication, October 1993, Elsevier

    Giorgio Satta

  45. Computation of probabilities for an island-driven parser

    Article • IEEE Transactions on Pattern Analysis and Machine Intelligence, January 1991, Institute of Electrical & Electronics Engineers (IEEE)

    Giorgio Satta

  46. A rank hierarchy for deterministic tree-walking transducers

    Article • Springer Science + Business Media

    Giorgio Satta

  47. Probabilistic Parsing

    Article • Springer Science + Business Media

    Giorgio Satta