no code implementations • 19 Feb 2022 • Rasika Bhalerao, Mohammad Al-Rubaie, Anand Bhaskar, Igor Markov
We propose Continuous Word2Vec (CW2V), our data-driven method to learn word embeddings that ensures that perturbations of words have embeddings similar to those of the original words.
no code implementations • 10 Aug 2021 • Julia A. Palacios, Anand Bhaskar, Filippo Disanto, Noah A. Rosenberg
Here, we investigate enumerative properties of the set of binary ranked and unranked tree shapes that are compatible with a perfect phylogeny, and hence, the binary ranked and unranked tree shapes conditioned on an observed pattern of mutations under the in? nitely-many-sites mutation model.