Elamur Research⌕
☰
home / papers / 2023 / Using LSTM and GRU With a New Dataset for Named Entity Recognition in the Arabic Language

Using LSTM and GRU With a New Dataset for Named Entity Recognition in the Arabic Language

Summary

This work addresses Arabic named entity recognition, where labeled, structured data is scarce. Existing Arabic NER corpora mostly cover politics, economics, and medicine. Arabic also makes NER harder in several ways: it has no capitalization cue, and optional diacritics (Tashkil) and nunation (Tanween) mean one word can have several different digital spellings.

The authors assembled a new corpus covering seven subject areas: news, sport, and cooking, along with technology, medicine, history, and geography. Every token is labeled in the BIOES scheme over nine entity categories. Before training, the text is normalized by stripping diacritics and nunation.

They then trained two small sequence taggers in Google's Trax library on Colab. Each tagger has a word embedding, one LSTM or GRU layer, a ReLU dense layer, and a LogSoftmax output. Both reach roughly 80% per-token label accuracy, with LSTM slightly ahead of GRU.

The main value of the paper is the multi-domain resource for an under-served language. The modeling itself is a simple baseline.

Key points

  • Corpus size and layout: 143 Excel files, 2,104 sentences and 36,380 words. The split is 31,586 words for training, 3,107 for validation and 1,687 for test. Each row has four columns: file_name, sentence, word, tag.

  • Label scheme: nine entity types (PER, LOC, GEO/GPE, TIM, PRO, ORG, DIS, MISC) in BIOES format, which gives 37 output classes. For example, a six-word name such as "Muhammad bin Ismail bin Jaafar al-Sadiq" is tagged B-PER, I-PER ×4, E-PER.

  • Model setup:

    • 50-dimensional embeddings and 50 recurrent units.
    • Adam optimizer with alpha 0.01 and a cross-entropy loss.
    • About 609k trainable parameters for LSTM and 604k for GRU.
  • Accuracy:

    ModelIterationsValidationTest
    LSTM50081.86%80.24%
    LSTM100079.88%80.06%
    GRU50078.86%77.78%
    GRU100076.26%75.38%

    Doubling the iterations did not improve either model.

  • Training time: 88 s and 104 s for LSTM, 90 s and 114 s for GRU (500 and 1000 iterations). The evaluation metric is per-token correctness, not entity-level F1.

Interesting ideas

  • I1. BIOES adds explicit End and Single tags, so the boundaries of long multi-word names are recoverable directly from the labels instead of being inferred from where an I-run happens to stop. — For Mova (world): Mova could store entity mentions with BIOES-style boundaries, so multi-token names like "Sir Arthur Conan Doyle" become one world entity with exact spans for coreference to point at.
  • I2. Spelling variants that humans read as identical (here, diacritized vs. bare forms) are folded into one canonical key before learning, so they share statistics. — For Mova (tokens): the en crate could keep the surface form but add a normalized lookup key for curly vs. straight quotes, accents, ligatures and British/American spellings, so lemma and lexicon lookups don't split one word into several.
  • I3. The corpus is deliberately spread across several unrelated domains, and each row carries a source-file column, so a model can be checked for domain breadth rather than tuned to news text. — For Mova (learn): silver data could be tagged by domain and source (fables, school tests, word problems), with scores reported per domain to catch a parser that only works on one genre.
  • I4. Reporting the same model at two training lengths, together with training time, shows that extra training bought nothing and only cost time. — For Mova (learn): training runs could routinely log an early and a late checkpoint, plus cost, so that early stopping is chosen from evidence.
  • I5. The headline score is per-token accuracy, which in NER is easy to inflate because most tokens are outside any entity; this is a reminder to pick span-level metrics. — For Mova (learn): Mova's evaluation should score whole entity spans and include an "everything is O" baseline as a negative control, so a tagger can't look good by predicting the majority tag.

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

Fields: Linguistics & languages

Topics: Named entity recognition · Part-of-speech tagging

Cite

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

@misc{shaker2023using,
  title = {{Using LSTM and GRU With a New Dataset for Named Entity Recognition in the Arabic Language}},
  author = {Shaker, Alaa and Aldarf, Alaa and Bessmertny, Igor},
  year = {2023},
  doi = {10.48550/arxiv.2304.03399},
  eprint = {2304.03399},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.48550/arxiv.2304.03399}
}

References

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

  1. S. A. Alzboun, S. K. Tawalbeh, M. Al-Smadi, Y. Jararweh, Using bidirectional long short-term memory and conditional random fields for labeling arabic named entities: A comparative study, in: 2018 Fifth International Conference on Social Networks Analysis, Management and Security (SNAMS), IEEE, 2018, pp. 135–140. doi: 10.1109/SNAMS.2018.8554623 . ↗
  2. W. Etaiwi, A. Awajan, D. Suleiman, Statistical arabic name entity recognition approaches: A survey, Procedia computer science 113 (2017) 57– 64. doi: 10.1016/j.procs.2017.08.288 . ↗
  3. A. Shaker, I. Bessmertny, L. Miroslavskaya, Y. Koroleva, Quantum semantic model for searching text in arabic language, SCIEN-TIFIC AND TECHNICAL JOURNAL OF INFORMATION TECHNOLOGIES, MECHANICS AND OPTICS 21 (2021). doi: 10.17586/ 2226-1494-2021-21-1-102-108 . find
  4. M. Al-Smadi, S. Al-Zboon, Y. Jararweh, P. Juola, Transfer learning for arabic named entity recognition with deep neural networks, Ieee Access 8 (2020) 37736–37745. doi: 10.1109/ACCESS. 2020.2973319 . ↗
  5. K. Shaalan, A survey of arabic named entity recognition and classification, Computational Linguistics 40 (2014) 469–510. doi: 10.1109/ACCESS. 2020.2973319 . ↗
  6. R. Grishman, The NYU System for MUC-6 or Where’s the Syntax?, Technical Report, NEW YORK UNIV NY DEPT OF COMPUTER SCIENCE, 1995. find
  7. R. Alfred, L. Leongm, O. Chin, K. Chin, P. Anthony, Malay named entity recognition based on rule-based approach, Computational Linguistics 4 (2014) 300–306. doi: 10.7763/IJMLC.2014.V4. 428 . ↗
  8. S. Hochreiter, J. Schmidhuber, Long short-term memory, Neural computation 9 (1997) 1735– 1780. doi: 10.1162/neco.1997.9.8.1735 . ↗
  9. V. Krishnan, V. Ganapathy, Named entity recognition, Stanford Lecture CS229 (2005). find
  10. A. Shaker, A. Aldarf, I. Bessmertny, The effectiveness of using bell inequality test for information retrieval in arabic texts, in: A. Penskoiand, P. Kustarev, D. Mouromtsev (Eds.), Proceedings of the 12th Majorov International Conference on Software Engineering and Computer Systems (MICSECS 2020), volume 2893, ITMO University, ITMO University, Saint Petersburg, Russia, 2020. find
  11. S. Hochreiter, The vanishing gradient problem during learning recurrent neural nets and problem solutions, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 6 (1998) 107–116. doi: 10.1142/S0218488598000094 . ↗
  12. S. Yang, X. Yu, Y. Zhou, Lstm and gru neural network performance comparison study: Taking yelp review dataset as an example, in: 2020 International workshop on electronic communication and artificial intelligence (IWECAI), IEEE, 2020, pp. 98– 101. doi: 10.1109/IWECAI50956.2020.00027 . ↗
  13. R. Cahuantzi, X. Chen, S. Güttel, A comparison of lstm and gru networks for learning symbolic sequences, arXiv preprint arXiv:2107.02248 (2021). ↗
  14. D. P. Kingma, J. L. Ba, Adam: A method for stochastic optimization, in: the 3rd International Conference for Learning Representations, San Diego, USA, 2015. find

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/shaker-2023-using-lstm-gru-new-dataset/