Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling

Re: Perl and Morphology

by ronald (Beadle)
on Mar 14, 2002 at 22:39 UTC ( #151847=note: print w/ replies, xml ) Need Help??

in reply to Perl and Morphology

First, you have to decide the kinds of languages you want to be able to parse. If the list begins and ends with Turkish, you can simplify a lot, as you don't have to worry about non-concatenative kinds of morphology (e.g. reduplication, infixation, ablaut), or even prefixation, for that matter.

You don't say whether your goal is to learn about parsing or simply to be able to parse Turkish words. If the latter, you can save yourself a lot of time and effort by using the parser available at:

You get results like the following for 'baSlar':


You can use Perl to submit words for parsing and then map the results onto English. You'll also need to preprocess the words to apply some phonological rules, like vowel harmony. For example, you won't get any results from 'baSimda' and have to submit as 'baSImda' instead. You could apply the harmony rules with s///, though if you apply harmony to all words, it will apply incorrectly to disharmonic roots and non-harmonizing suffixes. It's pretty hard to avoid that problem without first having the morphological parse!


Comment on Re: Perl and Morphology
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://151847]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (4)
As of 2016-02-14 09:17 GMT
Find Nodes?
    Voting Booth?

    How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?

    Results (468 votes), past polls