Finite State Machine Pattern-Root Arabic Morphological Generator, Analyzer and Diacritizer (2020.lrec-1)
Copied to clipboard
| Challenge: | Using a finite-state morphologizer, we generate and analyze undiacritized Modern Standard Arabic (MSA) words. |
| Approach: | They propose to use a finite-state Arabic Morphologizer to generate and analyze undiacritized Arabic words and diacritize them. |
| Outcome: | The proposed model generates and analyzes undiacritized Modern Standard Arabic (MSA) words and diacritizes them. |
Similar Papers
Camel Morph MSA: A Large-Scale Open-Source Morphological Analyzer for Modern Standard Arabic (2024.lrec-main)
Copied to clipboard
| Challenge: | Camel Morph MSA is the largest open-source Modern Standard Arabic morphological analyzer and generator. |
| Approach: | They present Camel Morph MSA, the largest open-source Arabic morphological analyzer and generator. |
| Outcome: | The analysis can produce 1.45B analyses and 535M unique diacritizations, almost an order of magnitude larger than SAMA on a 10B word corpus. |
Computational Morphology and Lexicography Modeling of Modern Standard Arabic Nominals (2024.findings-eacl)
Copied to clipboard
| Challenge: | Modern Standard Arabic (MSA) nominals present many morphological and lexical modeling challenges that have not been consistently addressed before. |
| Approach: | They propose to use a morphological framework to model Arabic nominals using a proposed morphology framework. |
| Outcome: | The proposed model improves accuracy and consistency compared to a commonly used morphological analyzer and generator. |
NeoAraBERT: A Modern Foundation Model for Arabic Embeddings with Diacritics-Aware Tokenization and POS-Targeted Masking (2026.findings-acl)
Copied to clipboard
Chadi Abou Chakra, Hadi Khaled Hamoud, Osama Rakan Al Mraikhat, Qusai Abu Obaida, Mohamad Ballout, Fadi Zaraket
| Challenge: | NeoAraBERT is an open-source text-embedding model for Arabic. |
| Approach: | They propose to train Arabic text-embedding models on open-source datasets . they benchmarked NeoAraBERT against five top-performing Arabic models on 23 tasks . |
| Outcome: | The proposed model outperforms five other models on 23 tasks in Arabic . it shows substantial improvement on classical and modern standard Arabic compared to other models . |
BabyFST - Towards a Finite-State Based Computational Model of Ancient Babylonian (2020.lrec-1)
Copied to clipboard
| Challenge: | morphological analyzer for Akkadian is not yet available for the extinct language . we present a general finite-state based model for Babylonian that can achieve a coverage of 97.3% and a recall of 93.7% on token level. |
| Approach: | They propose a general finite-state based morphological model for Babylonian that can achieve a coverage of 97.3% and recall up to 93.7% on lemmatization and POS-tagging tasks. |
| Outcome: | The proposed model can achieve coverage and recall of 97.3% on lemmatization and POS-tagging tasks on token level from a transcribed input. |
Morphosyntactic Tagging with Pre-trained Language Models for Arabic and its Dialects (2022.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained morphosyntactic tagging models outperform existing systems in Modern Standard Arabic and all the Arabic dialects studied. |
| Approach: | They present results on morphosyntactic tagging across different varieties of Arabic using pre-trained transformer language models. |
| Outcome: | The proposed models outperform existing systems in Modern Standard Arabic, 2.8% in Gulf, 1.6% in Egyptian, and 8.3% in Levantine. |
Parser combinators for Tigrinya and Oromo morphology (L18-1)
Copied to clipboard
Patrick Littell, Tom McCoy, Na-Rae Han, Shruti Rijhwani, Zaid Sheikh, David Mortensen, Teruko Mitamura, Lori Levin
| Challenge: | morphological parsers for two Afroasiatic languages are developed using a parser-combinator paradigm . the paradigm allows rapid development and ease of integration with other systems, but at a cost of non-optimal theoretical efficiency. |
| Approach: | They propose a rule-based morphological parser paradigm for Tigrinya and Oromo languages . they use a parsers-combinator paradigm instead of a finite-state paradigm . |
| Outcome: | The proposed paradigm allows rapid development and ease of integration with other systems, but at cost of non-optimal theoretical efficiency. |
Build Fast and Accurate Lemmatization for Arabic (L18-1)
Copied to clipboard
| Challenge: | Lemmatization is the process of finding the base form (lemma) of a word by considering its inflected forms. |
| Approach: | They propose a lemmatizer for Arabic with a dataset that can be used to test lemma accuracy. |
| Outcome: | The proposed algorithm outperforms state-of-the-art Arabic lemmatization in accuracy and speed. |
An Unsupervised Method for Weighting Finite-state Morphological Analyzers (2020.lrec-1)
Copied to clipboard
| Challenge: | Morphological analysis is one of the tasks that have been studied for years. |
| Approach: | They propose a method for weighting a morphological analyzer built using finite state transducers in order to disambiguate its results. |
| Outcome: | The proposed model weights a word2vec model using untagged corpora and captures the semantic meaning of the words. |
Arabic Diacritization Using Morphologically Informed Character-Level Model (2024.lrec-main)
Copied to clipboard
Muhammad Morsy Elmallah, Mahmoud Reda, Kareem Darwish, Abdelrahman El-Sheikh, Ashraf Hatim Elneima, Murtadha Aljubran, Nouf Alsaeed, Reem Mohammed, Mohamed Al-Badrashiny
| Challenge: | Diacritics are typically omitted in Arabic writings and the reader needs to guess the proper diacritics as they are reading. |
| Approach: | They propose a morphologically informed character-level model that can recover both types of diacritics simultaneously. |
| Outcome: | The proposed model achieves lowest word-level diacritization error rate for Classical Arabic, MSA, and two dialectal Arabic texts. |
A Pointer Network Architecture for Joint Morphological Segmentation and Tagging (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Morphological Disambiguation (MD) is a task of decomposing tokens into morphemes . a simple pipeline is used to segment and tagging raw tokens . |
| Approach: | They propose a new pointer network model that combines symbolic knowledge of morphemes with the learning capacity of neural end-to-end modeling. |
| Outcome: | The proposed model outperforms all previous reported results on Hebrew and Turkish . it uses morphological knowledge and the learning capacity of neural end-to-end modeling . |