Searchable List of Research Output

Filter Publications
  • Sammar, T., Huurdeman, H.C., Ben-David, A., Kamps, J., de Vries, A.P. (2014) Uncovering the Unarchived Web.
    In SIGIR '14: proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval: July 6-11 2014, Gold Coast, Queensland, Australia (pp 1199-1202). ACM.
  • Sandu, G., Proietti, C., Rivenc, F. (2018) Bivalence and Future Contingency.
    In Hansson, S.O. Hendricks, V.F. (Eds.), Introduction to Formal Philosophy (pp 333-347) (Springer Undergraduate Texts in Philosophy). Springer.
  • Sangati, F., Mazza, C. (2009) An English dependency treebank à la Tesnière.
    In Passarotti, M. Przepiórkowski, A. Raynaud, S. Van Eynde, F. (Eds.), Proceedings of The Eighth International Workshop onTreebanks and Linguistic Theories (TLT8) (pp 173-184). EDUCatt.
  • Sangati, F., van Cranenburgh, A. (2015) Multiword Expression Identification with Recurring Tree Fragments and Association Measures.
    In NAACL HLT 2015 : 11th Workshop on Multiword Expressions: proceedings of the workshop : June 4, 2015, Denver, Colorado, USA (pp 10-18). The Association for Computational Linguistics.
    Conference contribution | https://doi.org/10.3115/v1/W15-0902 | UvA-DARE
  • Sangati, F., Zuidema, W., Bod, R. (2009) A generative re-ranking model for dependency parsing.
    In Proceedings of the 11th International Conference on Parsing Technologies, IWPT-09: 7-9 October 2009, Paris, France (pp 238-241). Association for Computational Linguistics (ACL).
  • Sangati, F., Zuidema, W., Bod, R. (2010) Efficiently extract recurring tree fragments from large treebanks.
    In Calzolari, N. Choukri, K. Maegaard, B. Mariani, J. Odijk, J. Piperidis, S. Rosner, M. Tapias, D. (Eds.), Proceedings of the 7th international conference on Language Resources and Evaluation (LREC'10) (pp 219-226). European Language Resources Association (ELRA).
  • Sangati, F., Zuidema, W. (2008) Communication, cooperation and coherence: putting mathematical models into perspective.
    In Smith, A.D.M. Smith, K. Ferrer i Cancho, R. (Eds.), The evolution of language: proceedings of the 7th International Conference (EVOLANG7), Barcelona, Spain, 12-15 March 2008 (pp 491-492). World Scientific.
  • Sangati, F., Zuidema, W. (2009) Unsupervised methods for head assignments.
    In Lascarides, A. Gardent, C. Nivre, J. (Eds.), Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: EACL 2009: 30 March-3 April 2009, Megaron Athens International Conference Centre, Athens, Greece (pp 701-709). Association for Computational Linguistics (ACL).
  • Sangati, F., Zuidema, W. (2011) Accurate parsing with compact tree-substitution grammars: double-DOP.
    In Conference on Empirical Methods in Natural Language Processing: Proceedings of the Conference (pp 84-95). The Association for Computational Linguistics.
  • Sangati, F. (2009) Generative re-ranking model for dependency parsing of Italian sentences.
    In Poster and workshop proceedings of the 11th Conference of the Italian Association for Artificial Intelligence (EVALITA 2009), 12th December 2009, Reggio Emilia, Italy
  • Sangati, F. (2009) A simple DOP model for constituency parsing of Italian sentences.
    In Poster and workshop proceedings of the 11th Conference of the Italian Association for Artificial Intelligence (EVALITA 2009), 12th December 2009, Reggio Emilia, Italy
  • Sangati, F. (2010) A probabilistic generative model for an intermediate constituency-dependency representation.
    In Proceedings of the ACL 2010 Student Research Workshop, Uppsala, Sweden (pp 19-24). Association for Computational Linguistics (ACL).
  • Sangati, F. (2012) Decomposing and regenerating syntactic trees.
    Institute for Logic, Language and Computation.
    Thesis, fully internal | UvA-DARE
  • SanJuan, E., Huet, S., Kamps, J., Ermakova, L. (2022) Overview of the CLEF 2022 SimpleText Task 1: Passage Selection for a Simplified Summary.
    In Faggioli, G. Ferro, N. Hanbury, A. Potthast, M. (Eds.), Proceedings of the Working Notes of CLEF 2022 - Conference and Labs of the Evaluation Forum: Bologna, Italy, September 5th to 8th, 2022 (pp 2762-2772) (CEUR Workshop Proceedings, Vol. 3180). CEUR-WS.
  • SanJuan, E., Huet, S., Kamps, J., Ermakova, L. (2023) Overview of the CLEF 2023 SimpleText Task 1: Passage Selection for a Simplified Summary.
    In Aliannejadi, M. Faggioli, G. Ferro, N. Vlachos, M. (Eds.), Working Notes of the Conference and Labs of the Evaluation Forum (CLEF 2023): Thessaloniki, Greece, September 18th to 21st, 2023 (pp 2823-2834) (CEUR Workshop Proceedings, Vol. 3497). CEUR-WS.
  • SanJuan, E., Huet, S., Kamps, J., Ermakova, L. (2024) Overview of the CLEF 2024 SimpleText Task 1: Retrieve Passages to Include in a Simplified Summary.
    In Faggioli, G. Ferro, N. Galuščáková, P. García Seco de Herrera, A. (Eds.), Working Notes of the Conference and Labs of the Evaluation Forum (CLEF 2024): Grenoble, France, 9-12 September, 2024 (pp 3115-3128) (CEUR Workshop Proceedings, Vol. 3740). CEUR-WS.
  • Santocanale, L., Venema, Y. (2007) Completeness for flat modal fixpoint logics.
    In Dershowitz, N. Voronkov, A. (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning: 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007 : proceedings (pp 499-513) (Lecture Notes in Computer Science
    Lecture Notes in Artificial Intelligence, Vol. 4790). Springer.
  • Santocanale, L., Venema, Y. (2010) Completeness for flat modal fixpoint logics.
    Annals of Pure and Applied Logic, Vol. 162 (pp 55-82)
  • Santocanale, L., Venema, Y. (2010) Uniform interpolation for monotone modal logic.
    In Beklemishev, L. Goranko, V. Shehtman, V. (Eds.), Advances in Modal Logic: AiML 8 (pp 350-370). College Publications.
  • Santoli, T., Schaffner, C. (2017) Using Simon's Algorithm to Attack Symmetric-Key Cryptographic Primitives.
    Quantum Information & Computation, Vol. 17 (pp 65-78)

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact