Word Sense Disambiguation (WSD) is a process of identifying proper meaning of words that may have multiple meanings. It is regarded as one of the most challenging problems in the field of Natural Language Processing (...
详细信息
Word Sense Disambiguation (WSD) is a process of identifying proper meaning of words that may have multiple meanings. It is regarded as one of the most challenging problems in the field of Natural Language Processing (NLP). Nepali Language also has words that have multiple meanings, thus giving rise to the problem of WSD in it. In this paper, we investigate the impact of NLP resources like Morphology Analyzer (MA) and Machine Readable Dictionary (MRD) in ambiguity resolution. Our results show that the accuracy in WSD is better with the availability of NLP resources like Morph Analyzer, MRD etc. lesk algorithm has been used to solve WSD problem using a sample Nepali WordNet containing few sets of Nepali nouns and the system is able to disambiguate these nouns only. The system was tested on a small set of data with limited number of nouns. The accuracy reading was between 50％-70％ depending on the sample data provided. When the same data was tested through manual morph analysis, the accuracy was seen to be considerably high (80％).
This paper discusses the implementation of geometric searching in protein structures. A comparison of geometric searching algorithms that have been used for substructure searching in small 3D molecules suggests that t...
详细信息
This paper discusses the implementation of geometric searching in protein structures. A comparison of geometric searching algorithms that have been used for substructure searching in small 3D molecules suggests that the algorithm due to lesk is most appropriate for searching for patterns of atoms in proteins; however, the computational requirements of this algorithm are considerable. An improved, two-stage procedure is described in which the lesk algorithm is used as a precursor to the subgraph isomorphism algorithm of Ullman, and it is demonstrated that geometric searching can be implemented with a reasonable degree of efficiency.
暂无评论