Unsupervised Morphological Relatedness

Abstract

Assessment of the similarities between texts has been studied for decades from different perspectives and for several purposes. One interesting perspective is the morphology. This article reports the results on a study on the assessment of the morphological relatedness between natural language words. The main idea is to adapt a formal string alignment algorithm namely Needleman-Wunsch’s to accommodate the statistical char-acteristics of the words in order to approximate how similar are the linguistic morphologies of the two words. The approach is unsupervised from end to end and the experiments show an nDCG reaching 87% and an r-precision reaching 81%.

Authors and Affiliations

Ahmed Khorsi, Abeer Alsheddi

Keywords

Related Articles

Cancer Classification from DNA Microarray Data using mRMR and Artificial Neural Network

Cancer is the uncontrolled growth of abnormal cells in the body and is a major death cause nowadays. It is notable that cancer treatment is much easier in the initial stage rather than it outbreaks. DNA microarray based...

Figural a Flexibility Test for Improving Creative Thinking in an Arabic Learning Environment A Saudi Arabia-Based Case Study

The capability of graduates to be flexible in the face of rapidly altering situations is an increasingly crucial requirement that teachers should be conscious of, given that persistent development and technological progr...

An Algorithm for Summarization of Paragraph Up to One Third with the Help of Cue Words Comparison

In the fast growing information era utility of technology are more precise than completing the assignment manually. The digital information technology creates a knowledge-based society with high-tech global economy which...

On the Use of Arabic Tweets to Predict Stock Market Changes in the Arab World

Social media users nowadays express their opinions and feelings about many event occurring in their lives. For certain users, some of the most important events are the ones related to the financial markets. An interestin...

Routing Discovery Algorithm Using Parallel Chase Packet

On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route dis...

Download PDF file
  • EP ID EP91026
  • DOI 10.14569/IJACSA.2016.071047
  • Views 157
  • Downloads 0

How To Cite

Ahmed Khorsi, Abeer Alsheddi (2016). Unsupervised Morphological Relatedness. International Journal of Advanced Computer Science & Applications, 7(10), 348-355. https://europub.co.uk/articles/-A-91026