Bassam Haddad

Detection and Correction of Non-Words in Arabic: A Hybrid Approach

As Arabic is known for its highly inflectional morphological structure, this hybrid approach is utilizing morphological knowledge in form of consistent root-pattern relationships, and some morpho-syntactical knowledge based on affixation and morphographemic rules to specify the word recognition and non-word correction process. Furthermore this paper is proposing novel probabilistic measures for completing the task of the correction by locating, reducing and ranking of the most probable correction candidates in Arabic derivative words. In this context based on frequency of occurrence analysis, two probabilistic measures are introduced, Root-Pattern Predictive Value, RPV, and Pattern-Root Predictive Value, PPV. Moreover, keyboard effect, letter sound and similarity are considered in addition to some lexical features as a supplementary aid to improve the process of error detection and correction.

A compositional approach towards semantic representation and construction of ARABIC

In spite of the fact that Arabic offers a well-studied theoretical and historical linguistic knowledge, unfortunately, it has so far received very little computational research and in particular on the level of semantic analysis. The most computational research efforts have been focused on morphological and syntax analysis, whereas research on Arabic computational semantics has been neglected. The main goal of this paper is to characterize the fundamental issues involved in deep logic-based semantic representation of Arabic sentences. The focus of attention of this work is relying on the principle of compositionality for Arabic semantic analysis, utilizing λ-calculus and type theory analysis of some Arabic syntactical constituents for achieving a semantic construction model for a fragment of ARABIC. Since semantic representation has to be compositional in Natural Language Understanding Systems, this approach offers a central concept for developing more intelligent and robust Arabic NLP systems.

Semantic Representation of Arabic: A Logical Approach towards Compositionality and Generalized Arabic Quantifiers

Research on semantic processing of Arabic language and in particular on deep semantic analysis considering the compositionality of its syntactical structure has so far received very little computational research. This work is therefore attempting to fill some essential aspects of this gap in introducing a logic-based compositional model covering fundamental issues involved in semantic analysis of Arabic sentences. The focus of attention is relying on studying the compositionality of important Arabic syntactical constituents and on extending the concept of the generalized natural language quantification to Generalized Arabic Quantifiers GAQ utilizing lambda-calculus and the type theoretical analysis of Arabic structure. Since semantic representation has to be compositional in natural language understanding systems this approach attempts to propose an element framework for developing more practical and intelligent Arabic natural language processing systems.

Structural Outlooks for the OTIS-Arrangement Network

Recent studies have revealed that the Optical Transpose Interconnection Systems OTIS are promising candidates for future high-performance parallel computers. This paper presents and evaluates a general method for algorithm development on the OTIS-Arrangement network OTIS-AN as an example of OTIS network. The proposed method can be used and customized for any other OTIS network. Furthermore, it allows efficient mapping of a wide class of algorithms into the OTIS-AN. This method is based on grids and pipelines as popular structures that support a vast body of parallel applications including linear algebra, divide-and-conquer types of algorithms, sorting, and FFT computation. This study confirms the viability of the OTIS-AN as an attractive alternative for large-scale parallel architectures.

Efficient grid on the OTIS-Arrangment network

Many recent studies have revealed that the Optical Transpose Interconnection Systems (OTIS) are promising candidates for future high-performance parallel computers. In this paper, we present and evaluate a general method for algorithm development on the OTIS-Arrangement network (OTIS-AN) as an example of OTIS network. The proposed method could be used and customized for any other OTIS network. Furthermore it allows efficient mapping of a wide class of algorithms into the OTIS-AN. This method is based on grids as popular structure that support a vast body of parallel applications including linear algebra, divide-and-conquer type of algorithms, sorting, and FFT computation. This study confirms the viability of the OTIS-AN as an attractive alternative for large-scale parallel architectures.