Searchable List of Research Output

Filter Publications
  • Lakretz, Y., Kruszewski, G., Desbordes, T., Hupkes, D., Dehaene, S., Baroni, M. (2019) The emergence of number and syntax units in LSTM language models.
    In Burstein, J. Doran, C. Solorio, T. (Eds.), The 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: NAACL HLT 2019 : proceedings of the conference : June 2-June 7, 2019 (pp 11-20). The Association for Computational Linguistics.
    Conference contribution | https://doi.org/10.18653/v1/N19-1002 | UvA-DARE
  • Lalmas, M., Kazai, G., Kamps, J., Pehcevski, J., Piwowarski, B., Robertson, S. (2007) INEX 2006 evaluation measures.
    In Fuhr, N. Lalmas, M. Trotman, A. (Eds.), Comparative Evaluation of XML Information Retrieval Systems: 5th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2006, Dagstuhl Castle, Germany, December 17-20, 2006 : revised and selected papers (pp 20-34) (Lecture Notes in Computer Science, Vol. 4518). Springer.
  • Lalonde, O., Mande, N.S., de Wolf, R. (2023) Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error.
    In Bouyer, P. Srinivasan, S. (Eds.), 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India (Leibniz International Proceedings in Informatics, Vol. 284). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • Lamers, Wout, van Eck, N.J., Colavizza, G. (2021) An appraisal of publication embedding techniques in the context of conventional bibliometric relatedness measures.
    Paper | UvA-DARE
  • Lammertink, I.L., de Heer Kloots, M., Bazioni, Mary, Raviv, Limor (2024) Learnability effects in children: are more structured languages easier to learn?.
  • Lamqaddam, H., Pereira, G., Suppaiboonsuk, Kwan (2024) It's Giving AI: exploring and investigating generative AI aesthetics.
    Digital Methods Initiative.
  • Landerreche, E., Stevens, M., Schaffner, C. (2020) Non-interactive Cryptographic Timestamping Based on Verifiable Delay Functions.
    In Bonneau, J. Heninger, N. (Eds.), Financial Cryptography and Data Security: 24th International Conference, FC 2020, Kota Kinabalu, Malaysia, February 10–14, 2020, Revised Selected Papers (pp 541-558) (Lecture Notes in Computer Science). Springer.
  • Landman, F., Veltman, F. (1984) Varieties of formal semantics: proceedings of the fourth Amsterdam Colloquium, September 1982.
    Groningen-Amsterdam Studies in Semantics. Foris Publications.
    Book (Editorship) | UvA-DARE
  • Langedijk, A., Dankers, V., Lippe, P., Bos, S., Cardenas Guevara, B., Yannakoudakis, H., Shutova, E. (2022) Meta-learning for fast cross-lingual adaptation in dependency parsing.
    In Muresan, S. Nakov, P. Villavicencio, A. (Eds.), The 60th Annual Meeting of the Association for Computational Linguistics: ACL 2022 : proceedings of the conference : May 22-27, 2022 (pp 8503–8520). Association for Computational Linguistics.
  • Langedijk, A., Mohebbi, H., Sarti, G., Zuidema, W., Jumelet, J. (2024) DecoderLens: Layerwise Interpretation of Encoder-Decoder Transformers.
    In Duh, K. Gomez, H. Bethard, S. (Eds.), Findings of the Association for Computational Linguistics: NAACL 2024: Findings: Findings 2024 : June 16-21, 2024 (pp 4764-4780). Association for Computational Linguistics.
  • Lapata, M., Titov, I., Wang, B. (2022) Structured Reordering for Modeling Latent Alignments in Sequence Transduction.
    In Ranzato, M. Beygelzimer, A. Dauphin, Y. Liang, P.S. Wortman Vaughan, J. (Eds.), 35th Conference on Neural Information Processing Systems (NeurIPS 2021): online, 6-14 December 2021 (pp 13378-13391) (Advances in Neural Information Processing Systems, Vol. 34). Neural Information Processing Systems Foundation.
  • Laplante, S., Lee, T.J., Szegedy, M. (2005) The quantum adversary method and classical formula size lower bounds.
    In Proceedings 20th annual conference on computational complexity (pp 76-90). IEEE.
    Conference contribution | UvA-DARE
  • Larooij, M., Kamps, J., Marx, M. (2023) Openbaarheid van bestuur kan vrijwel kosteloos beter.
    Economisch-Statistische Berichten, Vol. 108 (pp 36-39)
  • Laurent, M., Piovesan, T. (2015) Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone.
    SIAM Journal on Optimization, Vol. 25 (pp 2461-2493)
  • Lauridsen, F.M., Ilin, J., Bezhanishvili, G., Harding, J. (2018) MacNeille transferability for finite lattices.
    In Proceedings of the conference Logic, Algebra and Truth Degrees (pp 24-26). University of Bern.
  • Lauridsen, F.M. (2017) Intermediate logics admitting structural hypersequent calculi.
  • Lauridsen, F.M. (2019) Cuts and completions: Algebraic aspects of structural proof theory.
    Thesis, fully internal | UvA-DARE
  • Lauridsen, F.M. (2019) Intermediate logics admitting a structural hypersequent calculus.
    Studia Logica, Vol. 107 (pp 247–282)
  • Lazaridou, A., Chrupała, G., Fernández, R., Baroni, M. (2016) Multimodal Semantic Learning from Child-Directed Input.
    In Knight, K. Nenkova, A. Rambow, O. (Eds.), NAACL HLT 2016 : The 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Proceedings of the Conference : June 12-17, 2016, San Diego, California, USA (pp 387-392). The Association for Computational Linguistics.
    Conference contribution | https://doi.org/10.18653/v1/N16-1043 | UvA-DARE
  • Lazaridou, A., Titov, I., Sporleder, C. (2013) A Bayesian Model for Joint Unsupervised Induction of Sentiment, Aspect and Discourse Representations.
    In Fung, P. Poesio, M. (Eds.), ACL 2013 : 51st Annual Meeting of the Association for Computational Linguistics: proceedings of the conference : August 4-9, 2013, Sofia, Bulgaria (pp 1630-1639). Association for Computational Linguistics.

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