Ideas for Google Summer of Code/Sliding-window part-of-speech tagger
< Ideas for Google Summer of Code
Jump to navigation
Jump to search
Revision as of 00:37, 6 April 2013 by Francis Tyers (talk | contribs)
The idea is to implement the unsupervised part-of-speech tagger (as described here) as a drop-in replacement for the current hidden-Markov-model tagger. It should have support for unknown words, and also for "forbid" descriptions (not described in the paper). The tagger has a very intuitive interpretation (believe me, even if you find the maths a bit daunting). I (Mlforcada) am available for questions (I invented the tagger, I should be able to remember!).
Task
- Implement a supervised training algorithm.
- Implement the tagger described in the paper.
- Come up with an XML-based format for writing forbid rules.
Coding challenge
Write a filter that reads in the output of Apertium morphological analyser and writes out either a random one (-r
) or the first one (-f
) of the lexical form for each surface form in a new format, respecting superblanks.
The new format would convert things as follows:
^I/I<num><mf><sg>/I<prn><subj><p1><mf><sg>$ ^have/have<vbhaver><inf>/have<vbhaver><pres>/have<vblex><inf>/have<vblex><pres>$ ^a/a<det><ind><sg>$ ^saw/saw<n><sg>/saw<vblex><inf>/saw<vblex><pres>/see<vblex><past>$^../..<sent>$
To, for instance:
I.prn.subj.pl.mf.sg have.vbhaver.inf a.det.ind.sg saw.n.sg ..sent
Frequently asked questions
- none yet, ask us something! :)