Giter Site home page Giter Site logo

ntmc-community / awesome-neural-models-for-semantic-match Goto Github PK

View Code? Open in Web Editor NEW
772.0 53.0 125.0 162 KB

A curated list of papers dedicated to neural text (semantic) matching.

License: MIT License

Python 24.23% Ruby 3.98% HTML 71.79%
deep-learning semantic-matching neu-ir information-retrieval text-similarity question-answering

awesome-neural-models-for-semantic-match's Introduction

Awesome

Awesome Neural Models for Semantic Match


A collection of papers maintained by MatchZoo Team.
Checkout our open source toolkit MatchZoo for more information!


Text matching is a core component in many natural language processing tasks, where many task can be viewed as a matching between two texts input.

equation

Where s and t are source text input and target text input, respectively. The psi and phi are representation function for input s and t, respectively. The f is the interaction function, and g is the aggregation function. More detailed explaination about this formula can be found on A Deep Look into Neural Ranking Models for Information Retrieval. The representative matching tasks are as follows:

Tasks Source Text Target Text
Ad-hoc Information Retrieval query document (title/content)
Community Question Answering question question/answer
Paraphrase Identification string1 string2
Natural Language Inference premise hypothesis
Response Retrieval context/utterances response
Long Form Question Answering question+document answer

Healthcheck

pip3 install -r requirements.txt
python3 healthcheck.py

awesome-neural-models-for-semantic-match's People

Contributors

albert-ma avatar bifeng avatar bwanglzu avatar caiyinqiong avatar chenlu19 avatar chriskuei avatar dalek-who avatar davion-liu avatar dyuyang avatar faneshion avatar lixinsu avatar wsdm2019-dapa avatar wuchen95 avatar yunhenk avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

awesome-neural-models-for-semantic-match's Issues

Recommandation (unsupervised/low ressource text alignment)

Hey guys,

Good work both on MatchZoo and this list!
I would be interested in quick advices/pointers on something related: I'd like to match related parts of texts.

More formally, I've a document, made of different sections (each with multiple sentences), and I'd like to map it to a similar text (transcription in fact), which is a bit longer, with some noise but talk about the same thing (lot of similarities) and in the same order. I made a dynamic programming algorithms which maximize a cosine similarities between sentence embeddings. Results aren't too bad, but I'd like to experiment other stuff.

Any idea?

Thanks a lot for any clue / references that seems relevant. We could discuss through gitter.im as well.

Paul


I've not much gold data (i.e. suitable segments to be training pairs), which is why I mention unsupervised/low ressources).

NAACL 2018/2019 relevant papers

NAACL 2018:
DeepAlignment: Unsupervised Ontology Matching With Refined Word Vectors
http://www.dit.unitn.it/~pavel/OM/articles/Kolyvakis_N18.pdf
DR-BILSTM: DEPENDENT READING BIDIRECTIONAL LSTM FOR NATURAL LANGUAGE
https://arxiv.org/pdf/1802.05577.pdf
Learning to Disentangle Interleaved Conversational Threads with a Siamese Hierarchical Network and Similarity Ranking
https://www.aclweb.org/anthology/N18-1164
Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering
https://arxiv.org/pdf/1710.03430.pdf

NAACL 2019:
A Complex-valued Network for Matching
https://arxiv.org/pdf/1904.05298.pdf
pair2vec: Compositional Word-Pair Embeddings for Cross-Sentence Inference
https://arxiv.org/pdf/1810.08854.pdf

AAAI 2019 relevant papers

“match”

Yang, Xiao, et al. "Adversarial training for community question answer selection based on multi-scale matching."
https://arxiv.org/abs/1804.08058

Kim, Seonhoon, et al. "Semantic sentence matching with densely-connected recurrent and co-attentive information."
https://arxiv.org/abs/1805.11360

Zhao, Boming, et al. "Preference-Aware Task Assignment in On-demand Taxi Dispatching: An Online Stable Matching Approach." (2019).
https://www.tik.ee.ethz.ch/file/5c75a1f030e8d090d46ef165f1805d34/aaai19-zhao.pdf

Tang, Min, Jiaran Cai, and Hankz Hankui Zhuo. "Multi-Matching Network for Multiple Choice Reading Comprehension." (2019).
http://xplan-lab.org/Paper_PDF/AAAI-19.pdf

Lai, Yuxuan, et al. "Lattice CNNs for Matching Based Chinese Question Answering." arXiv preprint arXiv:1902.09087 (2019).
https://arxiv.org/abs/1902.09087

Zhang, Kun, et al. "DRr-Net: Dynamic Re-read Network for Sentence Semantic Matching." (2019).
http://staff.ustc.edu.cn/~cheneh/paper_pdf/2019/Kun-Zhang-AAAI.pdf

“retrieval”

Tang, Zhiwen, and Grace Hui Yang. "Deeptilebars: Visualizing term distribution for neural information retrieval."
https://arxiv.org/abs/1811.00606

“answer”

Hu, Minghao, et al. "Read+ verify: Machine reading comprehension with unanswerable questions."
https://arxiv.org/abs/1808.05759

Yang, Xiao, et al. "Adversarial training for community question answer selection based on multi-scale matching.
https://arxiv.org/abs/1804.08058

Pang, Liang, et al. "HAS-QA: Hierarchical Answer Spans Model for Open-domain Question Answering." arXiv preprint arXiv:1901.03866 (2019).
https://arxiv.org/abs/1901.03866

(not sure)
Answer Identification from Product Reviews for User Questions by Multi-­‐task Attentive Networks Long Chen (Northwest University of China)*; Ziyu Guan (Northwest University); Wei Zhao (Xidian University); Wanqing
http://web.cse.ohio-state.edu/~sun.397/docs/AAAI19_ProdQA.pdf

abcnn

ABCNN: Attention-Based Convolutional Neural Network for Modeling Sentence Pairs

ACL 2018/2019 and CIKM 2018 relevant papers

ACL2018

ACL2019

CIKM2018

IJCAI 2018/2019 and WWW 2018/2019 relevant papers

IJCAI-2018

IJCAI-2019

WWW-2018

WWW-2019

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.