Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Nicholas Monath"'
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:7788-7796
Clustering algorithms are often evaluated using metrics which compare with ground-truth cluster assignments, such as Rand index and NMI. Algorithm performance may vary widely for different hyperparameters, however, and thus model selection based on o
Publikováno v:
Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies.
We study algorithms for approximating pairwise similarity matrices that arise in natural language processing. Generally, computing a similarity matrix for $n$ data points requires $\Omega(n^2)$ similarity computations. This quadratic scaling is a sig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2423772c85ca3d5a5953388e240662d9
http://arxiv.org/abs/2112.09631
http://arxiv.org/abs/2112.09631
Autor:
Mert Terzihan, Yuan Wang, Bryon Tjanaka, Manzil Zaheer, Avinava Dubey, Gokhan Mergen, Marc Najork, Yuchen Wu, Amr Ahmed, Andrew McCallum, Guru Guruganesh, Nicholas Monath
Publikováno v:
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining.
The applicability of agglomerative clustering, for inferring both hierarchical and flat clustering, is limited by its scalability. Existing scalable hierarchical clustering methods sacrifice quality for speed and often lead to over-merging of cluster
Publikováno v:
BCB
Tools to explore scientific literature are essential for scientists, especially in biomedicine, where about a million new papers are published every year. Many such tools provide users the ability to search for specific entities (e.g. proteins, disea
Autor:
Manzil Zaheer, Andrew McCallum, Kumar Shridhar, Mrinmaya Sachan, Nicholas Monath, Raghuveer Thirukovalluru
Publikováno v:
Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021
ACL/IJCNLP (Findings)
ACL/IJCNLP (Findings)
State of the art end-to-end coreference resolution models use expensive span representations and antecedent prediction mechanisms. These approaches are expensive both in terms of their memory requirements as well as compute time, and are particularly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56ebb625c54183deaf993c1bab1c20b1
Autor:
Shruti Chanumolu, Dung Thai, Sankaranarayanan Ananthakrishnan, Mukund Sridhar, Nicholas Monath, Andrew McCallum, Raghuveer Thirukovalluru
Publikováno v:
Proceedings of the 6th Workshop on Representation Learning for NLP (RepL4NLP-2021).
Smart assistants are tasked to answer various questions regarding world knowledge. These questions range from retrieval of simple facts to retrieval of complex, multi-hops question followed by various operators (i.e., filter, argmax). Semantic parsin
Publikováno v:
NAACL-HLT
Due to large number of entities in biomedical knowledge bases, only a small fraction of entities have corresponding labelled training data. This necessitates entity linking models which are able to link mentions of unseen entities using learned repre
Publikováno v:
Proceedings of the Fourth Workshop on Computational Models of Reference, Anaphora and Coreference.
Publikováno v:
Findings of the Association for Computational Linguistics: EMNLP 2020.
A case-based reasoning (CBR) system solves a new problem by retrieving `cases' that are similar to the given problem. If such a system can achieve high accuracy, it is appealing owing to its simplicity, interpretability, and scalability. In this pape