Methods for Matching English Language Addresses

• URL: http://arxiv.org/abs/2403.12092v1
• Date: Thu, 14 Mar 2024 10:39:14 GMT
• Title: Methods for Matching English Language Addresses
• Authors: Keshav Ramani, Daniel Borrajo,
• Abstract summary: We formalize a framework to generate matching and mismatching pairs of addresses in the English language. We evaluate various methods to automatically perform address matching.
• Score: 1.2930673139458417
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Addresses occupy a niche location within the landscape of textual data, due to the positional importance carried by every word, and the geographical scope it refers to. The task of matching addresses happens everyday and is present in various fields like mail redirection, entity resolution, etc. Our work defines, and formalizes a framework to generate matching and mismatching pairs of addresses in the English language, and use it to evaluate various methods to automatically perform address matching. These methods vary widely from distance based approaches to deep learning models. By studying the Precision, Recall and Accuracy metrics of these approaches, we obtain an understanding of the best suited method for this setting of the address matching task.

Related papers

• AddressCLIP: Empowering Vision-Language Models for City-wide Image Address Localization [57.34659640776723]
  We propose an end-to-end framework named AddressCLIP to solve the problem with more semantics. We have built three datasets from Pittsburgh and San Francisco on different scales specifically for the IAL problem.
  arXiv  Detail & Related papers  (2024-07-11T03:18:53Z)
• Improvement in Semantic Address Matching using Natural Language Processing [16.09672533759915]
  Address matching is an important task for many businesses especially delivery and take out companies. Existing solution uses similarity of strings, and edit distance algorithms to find out the similar addresses from the address database. This paper discuss semantic Address matching technique, by which we can find out a particular address from a list of possible addresses.
  arXiv  Detail & Related papers  (2024-04-17T18:42:36Z)
• Address Matching Based On Hierarchical Information [7.860920215887625]
  This paper proposes a novel method to leverage the hierarchical information in deep learning method. Experimental findings demonstrate that the proposed method improves the current approach by 3.2% points.
  arXiv  Detail & Related papers  (2023-05-10T03:45:22Z)
• Find a Way Forward: a Language-Guided Semantic Map Navigator [53.69229615952205]
  This paper attacks the problem of language-guided navigation in a new perspective. We use novel semantic navigation maps, which enables robots to carry out natural language instructions and move to a target position based on the map observations. The proposed approach has noticeable performance gains, especially in long-distance navigation cases.
  arXiv  Detail & Related papers  (2022-03-07T07:40:33Z)
• Multinational Address Parsing: A Zero-Shot Evaluation [0.3211619859724084]
  Address parsing consists of identifying the segments that make up an address, such as a street name or a postal code. Previous work on neural networks has only focused on parsing addresses from a single source country. This paper explores the possibility of transferring the address parsing knowledge acquired by training deep learning models on some countries' addresses to others.
  arXiv  Detail & Related papers  (2021-12-07T21:40:43Z)
• Cross-domain Speech Recognition with Unsupervised Character-level Distribution Matching [60.8427677151492]
  We propose CMatch, a Character-level distribution matching method to perform fine-grained adaptation between each character in two domains. Experiments on the Libri-Adapt dataset show that our proposed approach achieves 14.39% and 16.50% relative Word Error Rate (WER) reduction on both cross-device and cross-environment ASR.
  arXiv  Detail & Related papers  (2021-04-15T14:36:54Z)
• Fake it Till You Make it: Self-Supervised Semantic Shifts for Monolingual Word Embedding Tasks [58.87961226278285]
  We propose a self-supervised approach to model lexical semantic change. We show that our method can be used for the detection of semantic change with any alignment method. We illustrate the utility of our techniques using experimental results on three different datasets.
  arXiv  Detail & Related papers  (2021-01-30T18:59:43Z)
• SIRI: Spatial Relation Induced Network For Spatial Description Resolution [64.38872296406211]
  We propose a novel relationship induced (SIRI) network for language-guided localization. We show that our method is around 24% better than the state-of-the-art method in terms of accuracy, measured by an 80-pixel radius. Our method also generalizes well on our proposed extended dataset collected using the same settings as Touchdown.
  arXiv  Detail & Related papers  (2020-10-27T14:04:05Z)
• Deep Contextual Embeddings for Address Classification in E-commerce [0.03222802562733786]
  E-commerce customers in developing nations like India tend to follow no fixed format while entering shipping addresses. It is imperative to understand the language of addresses, so that shipments can be routed without delays. We propose a novel approach towards understanding customer addresses by deriving motivation from recent advances in Natural Language Processing (NLP)
  arXiv  Detail & Related papers  (2020-07-06T19:06:34Z)
• Leveraging Subword Embeddings for Multinational Address Parsing [0.0764671395172401]
  We build a single model capable of learning to parse addresses from multiple countries at the same time. We achieve accuracies around 99 % on the countries used for training with no pre-processing nor post-processing needed. We explore the possibility of transferring the address parsing knowledge obtained by training on some countries' addresses to others with no further training in a zero-shot transfer learning setting.
  arXiv  Detail & Related papers  (2020-06-29T16:14:27Z)
• IMRAM: Iterative Matching with Recurrent Attention Memory for Cross-Modal Image-Text Retrieval [105.77562776008459]
  Existing methods leverage the attention mechanism to explore such correspondence in a fine-grained manner. It may be difficult to optimally capture such sophisticated correspondences in existing methods. We propose an Iterative Matching with Recurrent Attention Memory (IMRAM) method, in which correspondences are captured with multiple steps of alignments.
  arXiv  Detail & Related papers  (2020-03-08T12:24:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.