Elamur Research⌕
☰
home / papers / 2014 / Rule-and Dictionary-based Solution for Variations in Written Arabic Names in Social Networks, Big Data, Accounting Systems and Large Databases

Rule-and Dictionary-based Solution for Variations in Written Arabic Names in Social Networks, Big Data, Accounting Systems and Large Databases

Paper · 2014 · Ahmad B.A. Hassanat and Ghada Awad Altarawneh

Summary

Arabic personal names often appear in several spellings. Causes include omitted vowels, accent-driven letter swaps, hamza handling, final-letter alternations, and old 7-bit mainframes that could not store some characters. A search for one spelling therefore misses records stored under another. Exact matching forces users to type every variant, and plain approximate matching returns unrelated names.

Jordan's government office for civil registration and passports supplied the authors with about 75,000 distinct first names covering 9.9 million living and deceased Jordanian citizens. Their pipeline had three stages:

  • Offline, pair every name with others at Levenshtein distance one or less.
  • Filter those pairs with a subset of Alshamsan's catalogue of reasons why Arabic names diverge.
  • Correct the result by hand.

The automatic stage alone produced about 7% false acceptances and 7.9% false rejections, so manual editing took over 500 hours. The final dictionary links each name to its alternatives and marks the most frequent form as the standard spelling. It supports two uses: normalizing names when records are entered, and expanding a search query to all variants. This matters for banking, accounting, social networks and security watch lists.

Key points

  • Source data: about 75,000 distinct raw first names belonging to 9.9 million Jordanian citizens, living and dead.
  • The final dictionary holds 17,992 names, and each has between 1 and 13 alternative spellings.
  • The rule-based construction alone gave at least 7% erroneous acceptances and 7.9% erroneous rejections, which were fixed by more than 500 hours of manual editing.
  • Search cost:
    • A dictionary lookup costs O(log k).
    • Querying the target database for all variants costs O(m log n).
    • Since k and m are effectively constant, the total is about O(log n), so the expansion barely slows normal search.
  • Female names have more variants than male ones because of their typical feminine endings (ى, ا, ءا, ة/ه). Legacy 7-bit encodings are named as a cause not covered in Alshamsan's catalogue.

Interesting ideas

  • I1. Cheap generator plus linguistic filter. Gather candidate variant pairs with a cheap, recall-oriented step (edit distance ≤ 1), then keep only pairs that a known cause of variation explains, so each link carries a reason.
  • I2. Precompile instead of expanding online. The authors argue that applying rules at query time causes a combinatorial blow-up and yields non-names, so they freeze vetted variants into an indexed table.
  • I3. Most frequent form as canonical. Each variant cluster gets a standard form chosen by corpus frequency rather than by prescriptive choice.
  • I4. Report false acceptances and false rejections separately. The two error types are measured apart, showing that the automatic stage both over-links and under-links.
  • I5. One resource for both writing and reading. The same mapping normalizes names at insertion time and expands them at query time.

For Mova

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

  • I1 (tokens): Spelling-variant links (colour/color, judgement/judgment, archaic forms in tales) could be built the same way, with each accepted pair tagged by the rule that licenses it, keeping lemma normalization explainable.
  • I2 (world): Compiled knowledge such as alias tables for entities and measures could be generated and checked offline once, leaving runtime with only a cheap indexed lookup.
  • I3 (tokens): When several surface forms map to one lemma or entity name, picking the most attested one as canonical gives a reproducible, data-justified default.
  • I4 (learn): Self-induced repair rules and silver-data merges could be scored on both error directions, so a rule that boosts coverage cannot hide the spurious links it adds.
  • I5 (back): The variant table used to normalize input could also guide generation, so output uses the canonical spelling that understanding mapped to.

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

 Fields, topics and concepts

Cite

Cite as Ahmad B.A. Hassanat and Ghada Awad Altarawneh. 2014. Rule-and Dictionary-based Solution for Variations in Written Arabic Names in Social Networks, Big Data, Accounting Systems and Large Databases. arXiv:1502.05441 · Research Journal of Applied Sciences, Engineering and Technology, 2014, 8(14): 1630-1638.

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

@misc{hassanat2014rule,
  title = {{Rule-and Dictionary-based Solution for Variations in Written Arabic Names in Social Networks, Big Data, Accounting Systems and Large Databases}},
  author = {Ahmad B.A. Hassanat and Ghada Awad Altarawneh},
  year = {2014},
  doi = {10.48550/arxiv.1502.05441},
  eprint = {1502.05441},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.48550/arxiv.1502.05441}
}

References

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

  1. Alghamdi, M. (2005). Algorithms for Romanizing Arabic names. Journal of King Saud University: Computer Sciences and Information , 17, 1-27. find
  2. Al-Onaizan, Y., & Knight, K. (2002). Machine Transliteration of Names in Arabic Text. SEMITIC 02 Proceedings of the ACL-02 workshop on Computational approaches to Semitic languages, (pp. 1-10). Stroudsburg, PA. find
  3. Alshamsan, I. S. (2003. (in Arabic)). Discrepancies in the writing Arabic names in letters and diacritics: forms and causes. The standardization of the Romanization of Arabic proper names: the security dimensions, (pp. 9-54). Riyadh. find
  4. Arbabi, M., Fischthal, S. M., Cheng, V. C., & Bart, E. (1994). Algorithms for Arabic names transliteration. IBM Journal of Research and Development , 38 (2). find
  5. Buckwalter, T. (2004). Buckwalter Arabic Morphological Analyzer version 2.0. Linguistic Data Consortium, (LDC Cat alog No.: LDC2004L02, ISBN 1-58563-324-0.). University of Pennsylvania. find
  6. Elsebai, A., Meziane, F., & Belkredim, F. Z. (2009). A Rule Based Persons Names Arabic Extraction System. Communications of the IBIMA , 11, ISSN: 1943-7765. find
  7. FARGHALY, A., & SHAALAN, K. (2009). Arabic Natural Language Processing:Challenges and Solutions. ACM Transactions on Asian Language Information Processing , 8 (4). ↗
  8. Freeman, A. T., Condon, S. L., & Ackerman, C. M. (2006). Cross Linguistic Name Matching in English and Arabic: A 'One to Many Mapping' Extension of the Levenshtein Edit Distance Algorithm. Proceedings of the Human Language Technology Conference of the North American Chapter of the ACL (pp. 471–478). New York: Association for Computational Linguistics.
  9. Halpern, J. (2007). The challenges and pitfalls of Arabic Romanization and Arabization. Computational Approaches to Arabic Script Languages 2. Stanford, CA. find
  10. Levenshtein, V. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics - Doklady , 10 (10), 707–710. find
  11. Soudi, A., Bosch, A., & GUNTER, N. (2007). Arabic Computational Morphology: Knowledge-Based and Empirical Methods. Netherlands: (Text, Speech, and Language Technology), Springer. ↗

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/hassanat-2015-rule-dictionary-based-solution-variations/