loading...
Natural Language Processing Complexity and Parallelism
Moncton, NB, Canada June 16-June 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HPCSA.2002.101916816th Annual International Symposium o ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
C. Moghrabi, Universit? de Moncton
S. E. Moussa, Wilfrid Laurier University
M. S. Eid, Universit? de Moncton
This paper reviews the processes involved in Natural Language Processing (NLP). It then demonstrates the various kinds of choices that need be taken during the execution of the word morphology, the syntactic text analysis, or text generation components. It compares the time complexity of traditional serial algorithms and examines the possible expected gain in some corresponding parallel counterparts.
Citation:
C. Moghrabi, S. E. Moussa, M. S. Eid, "Natural Language Processing Complexity and Parallelism," hpcs, pp.276, 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002
Usage of this product signifies your acceptance of the Terms of Use.