Parantak Singh

Results 6 issues of Parantak Singh

1. Added preprocessing class, @someshsingh22 and @rajaswa , please check if this implementation would work. 2. Added Optimal String Alignment (OSA) to Levenshtein, and made minor code changes to the...

I'll be implementing Word Mover's distance. I'll be using gensim. Since we've added tensorflow to our dependencies now, I don't think gensim should be an issue.

1. Needleman-Wunsch Algorithm 2. Smith-Waterman Algorithm These algorithms were originally developed for DNA sequencing but I read on SO, that they are at times used as string similarity metrics as...

question

I believe implementing these self-explanatory functions could make for good perturbations. Though, I am not quite sure which category they'd go under. @rajaswa and @someshsingh22, thoughts? I'll implement this in...

enhancement

We can find similar words from the pre-trained glove embeddings or word2vec for that matter. We can directly load the file and work upon it or use gensim. @rajaswa and...

enhancement
Priority: Low

If possible, implement as a character perturbation: Find words with character embeddings in proximity (in hyperspace) to the word that is being edited. #### RESOURCES: https://towardsdatascience.com/the-definitive-guide-to-bidaf-part-2-word-embedding-character-embedding-and-contextual-c151fc4f05bb https://arxiv.org/pdf/1812.05271.pdf https://towardsdatascience.com/besides-word-embedding-why-you-need-to-know-character-embedding-6096a34a3b10 I'll update...

question