Elamur Research⌕
☰
home / papers / 2024 / Methods for Matching English Language Addresses

Methods for Matching English Language Addresses

Paper · 2024 · Keshav Ramani and Daniel Borrajo

Summary

The paper looks at deciding whether two English address strings point to the same place. Ordinary string similarity struggles here because each token's position and role carry meaning. A one-character edit can be harmless, like an abbreviation, or can change the location entirely, like a different house number. The authors define a match as two addresses referring to the same building, a choice driven by financial-services use cases. They then build a synthetic generator of matching and non-matching pairs from US-style addresses. Matches come from realistic edits such as abbreviation swaps and dropped words. Non-matches include harder cases where property or road numbers are altered. On this data they compare a range of distance measures, including Jaccard, Levenshtein, Jaro-Winkler and TF-IDF, against an ESIM model with GloVe embeddings, with and without character embeddings. The ESIM variants reach about 0.94–0.95 test accuracy and stay balanced between precision and recall. Many distance baselines achieve high precision only at the cost of poor recall. The work matters for entity resolution and record linkage, where addresses are common and there are few English benchmarks.

Key points

  • The dataset starts from 10,000 base addresses of the form building, street, city, state:
    • building numbers and street names come from the Faker library;
    • cities come from the top 1000 US cities by population (a plotly dataset), with city–state pairings kept correct.
  • Each address gets a prefix of type Floor, Apartment or Name:
    • Apartment uses APT/APARTMENT/SUITE/STE/UNIT;
    • Floor uses FLOOR/LEVEL;
    • Name uses ATTN or C/O plus a Faker name.
  • Matching pairs are built through word substitution within equivalence groups (APT/APARTMENT, SUITE/STE, ROAD/RD, STREET/ST, AVE/AVENUE) and through word deletion. Non-matches include tweaked property or road numbers, not just random other addresses.
  • In Test 4, averaged over 5 random seeds:
    • ESIM scored 0.93 precision, 0.95 recall and 0.94 accuracy on test;
    • ESIM + Char scored 0.95 precision, 0.94 recall and 0.95 accuracy;
    • test time was about 1 s, and training took roughly 530–830 s.
  • Among the distance-based methods, the best accuracy in that table is 0.88. Several of them combine about 0.98 precision with recall near 0.16–0.24.

Interesting ideas

  • I1. Matches are produced by meaning-preserving edits, while non-matches are produced by tiny meaning-changing edits such as a different number, which yields hard negatives with controllable difficulty.
  • I2. What counts as a match is fixed explicitly at a chosen granularity (building), and the methods are kept independent of that choice so the level can be moved to unit or district.
  • I3. The paper shows that two pairs with equal edit distance (an altered house number versus an appended letter) can deserve opposite verdicts, so token role outweighs raw character distance.
  • I4. Small curated equivalence groups of abbreviations (ST/STREET, STE/SUITE) do much of the work of turning surface variation into a matchable form.
  • I5. Results report precision, recall, accuracy and runtime, with means and standard deviations over seeds, which shows that high-precision baselines can hide very low recall.

For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

  • I1 (learn): Evaluation with negative controls could pair each test sentence with a minimally altered version whose correct answer must change, which exposes readers that only pattern-match surface form.
  • I2 (world): Identity of place entities in the world of a text could carry an explicit granularity setting, so "same location" can be answered at building, city or region level.
  • I3 (frames): Coreference between place mentions should compare parsed components such as number, street and city slot by slot, rather than falling back to string similarity.
  • I4 (tokens): The lemma/normalization layer could map address and title abbreviations to canonical lemmas, so later stages see one form while the original token stays recorded.
  • I5 (learn): Evaluation reports could always show precision and recall separately, along with seed variance, so a cautious component that rarely fires is not mistaken for a good one.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

 Institutions

Also on the byline: J.P. Morgan.

 Fields, topics and concepts

Cite

Cite as Keshav Ramani and Daniel Borrajo. 2024. Methods for Matching English Language Addresses. arXiv:2403.12092.

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.48550/arxiv.2403.12092 · arXiv 2403.12092

@misc{ramani2024methods,
  title = {{Methods for Matching English Language Addresses}},
  author = {Keshav Ramani and Daniel Borrajo},
  year = {2024},
  doi = {10.48550/arxiv.2403.12092},
  eprint = {2403.12092},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.48550/arxiv.2403.12092}
}

References

13 references, 3 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Yue Lin, Mengjun Kang, Yuyang Wu, Qingyun Du, and Tao Liu. “A deep learning architecture for semantic address matching”. In: International Journal of Geographical Information Science 34 (Feb. 2020), pp. 559– 576. DOI : 10.1080/13658816.2019.1681431. ↗
  2. Sam Comber and Daniel Arribas-Bel. “Machine learning innovations in address matching: A practical comparison of word2vec and CRFs”. In: Transactions in GIS 23.2 (2019), pp. 334–348. ↗
  3. Rui Santos, Patricia Murrieta-Flores, Pável Calado, and Bruno Martins. “Toponym matching through deep neural networks”. In: International Journal of Geographical Information Science 32.2 (2018), pp. 324–348. DOI : 10 . 1080 / 13658816 . 2017 . 1390119. eprint: https://doi . org / 10 . 1080 / 13658816 . 2017.1390119. URL : https://doi.org/10.1080/13658816.2017.1390119. ↗
  4. Bernhard E Boser, Isabelle M Guyon, and Vladimir N Vapnik. “A training algorithm for optimal margin classifiers”. In: Proceedings of the fifth annual workshop on Computational learning theory. 1992, pp. 144–152. find
  5. Nello Cristianini, John Shawe-Taylor, et al. An introduction to support vector machines and other kernel-based learning methods. Cambridge university press, 2000. find
  6. Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. Efficient Estimation of Word Representations in Vector Space. 2013. arXiv: 1301.3781 [cs.CL]. ↗
  7. Qian Chen, Xiaodan Zhu, Zhen-Hua Ling, Si Wei, Hui Jiang, and Diana Inkpen. “Enhanced LSTM for Natural Language Inference”. In: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) (2017). DOI : 10.18653/v1/p17- 1152. URL : http://dx.doi.org/10.18653/v1/P17-1152. ↗
  8. Jeffrey Pennington, Richard Socher, and Christopher D Manning. “Glove: Global vectors for word representation”. In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP). 2014, pp. 1532–1543.
  9. Jian Chen, Jianpeng Chen, Xiangrong She, Jian Mao, and Gang Chen. “Deep Contrast Learning Approach for Address Semantic Matching”. In: Applied Sciences 11.16 (2021), p. 7608. ↗
  10. G. Salton. Introduction to Modern Information Retrieval. McGraw Hill, 1983. find
  11. Jianxiong Dong and Jim Huang. “Enhance word representation for out-of-vocabulary on Ubuntu dialogue corpus”. In: CoRR abs/1802.02614 (2018). arXiv: 1802.02614. URL : http://arxiv.org/abs/1802.02614. ↗
  12. Günter Klambauer, Thomas Unterthiner, Andreas Mayr, and Sepp Hochreiter. “Self-Normalizing Neural Networks”. In: (2017). DOI : 10 . 48550 / ARXIV. 1706 . 02515. URL : https://arxiv.org/abs/1706.02515. ↗
  13. Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. “Bert: Pre-training of deep bidirectional transformers for language understanding”. In: arXiv preprint arXiv:1810.04805 (2018). ↗

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/ramani-2024-methods-matching-english-language-addresses/