Toward the Resolution of Arabic Lexical Ambiguities with Transduction on Text Automaton

Abstract

Lexical analysis can be a way to remove ambiguities in Arabic language. So their resolution is an important task in several Natural Language Processing (NLP) applications. In this context that this paper is inscribed. Our proposed resolution method is based essentially on the use of transducers on text automata. Indeed these transducers specify the lexical and contextual rules for Arabic language. They allow the resolution of lexical ambiguities. In order to achieve this resolution method, different types of lexical ambiguities are identified and studied to extract an appropriate set of rules. After that, we described lexical rules in ELAG [19] system (Elimination of Lexical Ambiguities by Grammars), which can delete paths representing morphosyntactic ambiguities. In addition, we present an experimentation implemented in the Unitex platform and conducted by various linguistic resources to obtain disambiguated syntactic structures suitable for the syntactic analysis. The obtained results are ambitious and can be improved by adding other rules and heuristics.