Le, P., Zuidema, W. (2015) Compositional Distributional Semantics with Long Short Term Memory.

In Proceedings of the Fourth Joint Conference on Lexical and Computational Semantics: *SEM 2015 : June 4-5, 2015, Denver, Colorado, UAA (pp 10-19). The *SEM 2015 Organizing Committee.

Le, P., Zuidema, W. (2016) Quantifying the vanishing gradient and long distance dependency problem in recursive neural networks and recursive LSTMs.

In Blunsom, P. Cho, K. Cohen, S. Grefenstette, E. Hermann, K.M. Rimell, L. Weston, J. Yih, S.W. (Eds.), The 54th Annual Meeting of the Association for Computational Linguistics. Proceedings of the 1st Workshop on Representation Learning for NLP: ACL 2016 : August 11th, 2016, Berlin, Germany (pp 87-93). The Association for Computational Linguistics.

Le, P., Zuidema, W. (2020) DoLFIn: Distributions over Latent Features for Interpretability.

In Scott, D. Bel, N. Zong, C. (Eds.), The 28th International Conference on Computational Linguistics: COLING 2020 : Proceedings of the Conference : December 8-13, 2020, Barcelona, Spain (Online) (pp 1468-1474). International Committee on Computational Linguistics.

Le, P. (2015) Enhancing the Inside-Outside Recursive Neural Network Reranker for Dependency Parsing.

In IWPT 2015 : 14th International Conference on Parsing Technologies: proceedings of the conference : July 22-24, 2015, Bilbao, Spain (pp 87-91). Association for Computational Linguistics.

Le, P. (2016) Learning vector representations for sentences: The recursive deep learning approach.

Thesis, fully internal | UvA-DARE

Leal, R.A. (2008) Predicate liftings versus nabla modalities.

Electronic Notes in Theoretical Computer Science, Vol. 203 (pp 195-220)

Article | https://doi.org/10.1016/j.entcs.2008.05.026 | UvA-DARE

Leal, R.A. (2011) Modalities through the looking glass: a study on coalgebraic modal logics and their applications.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Lee, S., Bloem, J. (2023) Comparing domain-specific and domain-general BERT variants for inferred real-world knowledge through rare grammatical features in Serbian.

In Piskorski, J. Marcińczuk, M. Nakov, P. Ogrodniczuk, M. Pollak, S. Přibáň, P. Rybak, P. Steinberger, J. Yangarber, R. (Eds.), The 9th Workshop on Slavic Natural Language Processing 2023: EACL 2023 : proceedings of the workshop (SlavicNLP 2023) : May 6, 2023 (pp 47-60). Association for Computational Linguistics.

Lee, S., Bloem, J. (2024) Impact of Task Adapting on Transformer Models for Targeted Sentiment Analysis in Croatian Headlines.

In Calzolari, N. Kan, M.-Y. Hoste, V. Lenci, A. Sakti, S. Xue, N. (Eds.), The 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024): main conference proceedings : 20-25 May, 2024, Torino, Italia (pp 8662–8674) (COLING
LREC). ELRA Language Resources Association.

Lee, T., Prakash, A., de Wolf, R., Yuen, H. (2016) On the sum-of-squares degree of symmetric quadratic functions.

In Raz, R. (Eds.), 31st Conference on Computational Complexity: CCC'16, May 29 to June 1, 2016, Tokyo, Japan (Leibniz International Proceedings in Informatics, Vol. 50). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Lee, T., Romashchenko, A. (2004) On Polynomially Time Bounded Symmetry of Information.

In Fiala, J. Koubek, V. Kratochvíl, J. (Eds.), Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004 : proceedings (pp 463-475) (Lecture Notes in Computer Science, Vol. 3153). Springer.

Lee, T., Romashchenko, A. (2005) Resource bounded symmetry of information revisited.

Theoretical Computer Science, Vol. 345 (pp 386-405)

Article | https://doi.org/10.1016/j.tcs.2005.07.017 | UvA-DARE

Lee, T., Wei, Z., de Wolf, R. (2017) Some upper and lower bounds on PSD-rank.

Mathematical programming, Vol. 162 (pp 495-521)

Article | https://doi.org/10.1007/s10107-016-1052-0 | UvA-DARE

Lee, T. (2002) Arithmetical Definability over Finite Structures.

Technical Reports. Institute for Logic, Language and Computation.

Working paper | UvA-DARE

Lee, T. (2003) Arithmetical definability over finite structures.

Mathematical Logic Quarterly, Vol. 49 (pp 385-392)

Article | https://doi.org/10.1002/malq.200310041 | UvA-DARE

Lee, T. (2006) Kolmogorov Complexity and formula size lower bounds.

ILLC.

Thesis, fully internal | UvA-DARE

Leffel, T., Cremers, A., Gotzner, N., Romoli, J. (2019) Vagueness in Implicature: The Case of Modified Adjectives.

Journal of Semantics, Vol. 36 (pp 317-348)

Article | https://doi.org/10.1093/jos/ffy020 | UvA-DARE

Leidinger, A.J., Rogers, R. (2023) Which Stereotypes Are Moderated and Under-Moderated in Search Engine Autocompletion?.

In FAccT '23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency (pp 1049–1061). Association for Computing Machinery.

Leidinger, A.J., van Rooij, R., Shutova, E. (2023) The Language of Prompting: What linguistic properties make a prompt successful?.

Paper | https://arxiv.org/abs/2311.01967 | UvA-DARE

Leidinger, A.J. (2022) Generating stereotypes from implicitly hateful posts.

Working paper | UvA-DARE