Ahmed Abdelali

Ahmed Abdelali

Auto-generated profile, based on publicly available information

Ahmed Abdelali

Qatar Computing Research Institute, Hamad Bin Khalifa University, Doha, Qatar

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 August 2007
Verified
Conference Paper
Open access
PDF file
PCPeter A. Chew
Peter A. Chew
BBBrett W. Bader
Brett W. Bader
TKTamara G. Kolda
Tamara G. Kolda
AAAhmed Abdelali
Ahmed Abdelali
A standard approach to cross-language information retrieval (CLIR) uses Latent Semantic Analysis (LSA) in conjunction with a multilingual parallel aligned corpus. This approach has been shown to be successful in identifying similar documents across languages - or more precisely, retrieving the most similar document in one language to a query in another language. However, the approach has severe drawbacks when applied to a related task, that of clustering documents "language-independently", so that documents about similar topics end up closest to one another in the semantic space regardless of their language. The problem is that documents are generally more similar to other documents in the same language than they are to documents in a different language, but on the same topic. As a result, when using multilingual LSA, documents will in practice cluster by language, not by topic. We propose a novel application of PARAFAC2 (which is a variant of PARAFAC, a multi-way generalization of the singular value decomposition [SVD]) to overcome this problem. Instead of forming a single multilingual term-by-document matrix which, under LSA, is subjected to SVD, we form an irregular three-way array, each slice of which is a separate term-by-document matrix for a single language in the parallel corpus. The goal is to compute an SVD for each language such that V (the matrix of right singular vectors) is the same across all languages. Effectively, PARAFAC2 imposes the constraint, not present in standard LSA, that the "concepts" in all documents in the parallel corpus are the same regardless of language. Intuitively, this constraint makes sense, since the whole purpose of using a parallel corpus is that exactly the same concepts are expressed in the translations. We tested this approach by comparing the performance of PARAFAC2 with standard LSA in solving a particular CLIR problem. From our results, we conclude that PARAFAC2 offers a very promising alternative to LSA not only for multilingual document clustering, but also for solving other problems in cross-language information retrieval.

1 May 2007 in Information Processing & Management
Verified
Journal Article
Closed access
AAAhmed Abdelali
Ahmed Abdelali
JCJim Cowie
Jim Cowie
HSHamdy S. Soliman
Hamdy S. Soliman

31 March 2021 in ACM Transactions on Asian and Low-Resource Language Information Processing
Verified
Journal Article
Open access
KDKareem Darwish
Kareem Darwish
AAAhmed Abdelali
Ahmed Abdelali
HMHamdy Mubarak
Hamdy Mubarak
MEMohamed Eldesouki
Mohamed Eldesouki
Diacritics (short vowels) are typically omitted when writing Arabic text, and readers have to reintroduce them to correctly pronounce words. There are two types of Arabic diacritics: The first are core-word diacritics (CW), which specify the lexical selection, and the second are case endings (CE), which typically appear at the end of word stems and generally specify their syntactic roles. Recovering CEs is relatively harder than recovering core-word diacritics due to inter-word dependencies, which are often distant. In this article, we use feature-rich recurrent neural network model that use a variety of linguistic and surface-level features to recover both core word diacritics and case endings. Our model surpasses all previous state-of-the-art systems with a CW error rate (CWER) of 2.9% and a CE error rate (CEER) of 3.7% for Modern Standard Arabic (MSA) and CWER of 2.2% and CEER of 2.5% for Classical Arabic (CA). When combining diacritized word cores with case endings, the resultant word error rates are 6.0% and 4.3% for MSA and CA, respectively. This highlights the effectiveness of feature engineering for such deep neural models.

5 January 2011 in Natural Language Engineering
Verified
Journal Article
Closed access
PDF file
PCPeter A. Chew
Peter A. Chew
BBBrett W. Bader
Brett W. Bader
SHStephen Helmreich
Stephen Helmreich
AAAhmed Abdelali
Ahmed Abdelali
SVStephen J. Verzi
Stephen J. Verzi
In this article, we demonstrate several novel ways in which insights from information theory (IT) and computational linguistics (CL) can be woven into a vector-space-model (VSM) approach to information retrieval (IR). Our proposals focus, essentially, on three areas: pre-processing (morphological analysis), term weighting, and alternative geometrical models to the widely used term-by-document matrix. The latter include (1) PARAFAC2 decomposition of a term-by-document-by-language tensor, and (2) eigenvalue decomposition of a term-by-term matrix (inspired by Statistical Machine Translation). We evaluate all proposals, comparing them to a ‘standard’ approach based on Latent Semantic Analysis, on a multilingual document clustering task. The evidence suggests that proper consideration of IT within IR is indeed called for: in all cases, our best results are achieved using the information-theoretic variations upon the standard approach. Furthermore, we show that different information-theoretic options can be combined for still better results. A key function of language is to encode and convey information, and contributions of IT to the field of CL can be traced back a number of decades. We think that our proposals help bring IR and CL more into line with one another. In our conclusion, we suggest that the fact that our proposals yield empirical improvements is not coincidental given that they increase the theoretical transparency of VSM approaches to IR; on the contrary, they help shed light on why aspects of these approaches work as they do.

1 October 2010
Verified
Conference Paper
Closed access
SZSoraya Zaidi
Soraya Zaidi
MLM-T. Laskri
M-T. Laskri
AAAhmed Abdelali
Ahmed Abdelali
Information extraction (IE) from corpora is texts analysis in order to extract structured information such as Named Entities (NE) which may be names of person, organization, address, date, location etc. ... GATE is a software toolkit written in Java from 1995 and widely used worldwide by many communities (scientists, companies, teachers, students) for natural language processing. We have experimented Gate for extracting terms by writing new Jape rules (Java Annotation Pattern Engine) and used them on a tagged corpus developed at Leeds University. These terms will be used in the texts-based ontologies building. In our case this ontology will be incorporated into a search engine to expand queries on the Web, in the specified domain.

22 September 2003 in Journal of the American Society for Information Science and Technology
Verified
Journal Article
Closed access
PDF file
AAAhmed Abdelali
Ahmed Abdelali