Cited by 341Topic ModelingData Quality and ManagementHandwritten Text Recognition Techniques

Learning Text Similarity with Siamese Recurrent Networks

Open access
Neculoiu, Paul, Versteegh, Maarten, Rotaru, Mihai·2016·Proceedings of the 1st Workshop on Representation Learning for NLP

Abstract

This paper presents a deep architecture for learning a similarity metric on variablelength character sequences.The model combines a stack of character-level bidirectional LSTM's with a Siamese architecture.It learns to project variablelength strings into a fixed-dimensional embedding space by using only information about the similarity between pairs of strings.This model is applied to the task of job title normalization based on a manually annotated taxonomy.A small data set is incrementally expanded and augmented with new sources of variance.The model learns a representation that is selective to differences in the input that reflect semantic differences (e.g., "Java developer" vs. "HR manager") but also invariant to nonsemantic string differences (e.g., "Java developer" vs. "Java programmer").

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/w16-1617

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Jane Bromley, James W Bentz, Léon Bottou, Is- abelle Guyon, Yann LeCun, Cliff Moore, Eduard Säckinger, and Roopak Shah. 1993. Signature ver- ification using a "siamese" time delay neural net- work. International Journal of Pattern Recognition and Artificial Intelligence, 7(04):669-688.
  2. Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Cor- rado, and Jeff Dean. 2013. Distributed representa- tions of words and phrases and their compositional- ity. In Advances in neural information processing systems, pages 3111-3119.
  3. Mike Schuster and Kuldip K Paliwal. 1997. Bidirec- tional recurrent neural networks. Signal Processing, IEEE Transactions on, 45(11):2673-2681.
  4. Martijn Spitters, Remko Bonnema, Mihai Rotaru, and Jakub Zavrel. 2010. Bootstrapping information ex- traction mappings by similarity-based reuse of tax- onomies. In CEUR Workshop Proceedings, volume 673.
  5. Longqi Yang, Yin Cui, Fan Zhang, John P Pollak, Serge Belongie, and Deborah Estrin. 2015. Plate- click: Bootstrapping food preferences through an adaptive visual interface. In Proceedings of the 24th ACM International on Conference on Informa- tion and Knowledge Management, pages 183-192. ACM.

Cited by

Sorted by citations

Authors
Neculoiu, P., Versteegh, M., & Rotaru, M.
Venue
Proceedings of the 1st Workshop on Representation Learning for NLP
Published
2016
Pages
148-157
OpenAlex
W2510940142
Cited by
341
References
51
Citations by year
2026: 6 · 2025: 21 · 2024: 30 · 2023: 31 · 2022: 43 · 2021: 63 · 2020: 64 · 2019: 37 · 2018: 36 · 2017: 9 · 2012: 1
FWCI
14.73
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Workshop on Representation Learning for NLP (RepL4NLP) (publishedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Data Quality and Management
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Handwritten Text Recognition Techniques
Keywords
text similarity, Siamese network, bidirectional LSTM, character embeddings, similarity metric learning, taxonomy (general classification scheme), data augmentation, semantic representation, string embeddings

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review