Title :
A finite state automata of the Arabic grammar
Author :
El-Naggar, Ayman
Author_Institution :
IBM Cairo Sci. Center, Egypt
Abstract :
A framework is presented showing that the study of the computational modeling of Arabic faces many problems. The need for a phrase structure of Arabic is indicated by showing how it is completely different from English. The phrase structures of Arabic sentences and their noun phrases are given. Some of the specific structures like the interrogative are also given. All these structures are given in the finite state automata form
Keywords :
computational linguistics; finite automata; grammars; natural languages; Arabic grammar; Arabic sentences; finite state automata; interrogative; natural language processing; noun phrases; phrase structure; semitic languages; Artificial intelligence; Automata; Computer displays; Computer interfaces; Databases; Embedded computing; Expert systems; Humans; Natural languages; Software packages;
Conference_Titel :
Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-1984-8
DOI :
10.1109/TAI.1989.65383
