Difference between revisions of "User:Aida/Application"
Jump to navigation
Jump to search
Line 45: | Line 45: | ||
! dates |
! dates |
||
!style="width: 25%"| goals |
!style="width: 25%"| goals |
||
! eval |
|||
!style="width: 25%"| accomplishments |
|||
!style="width: 35%"| notes |
!style="width: 35%"| notes |
||
|- |
|- |
||
Line 53: | Line 53: | ||
# finish coding challenge with WER ~30% |
# finish coding challenge with WER ~30% |
||
# total 300 stems in dix |
# total 300 stems in dix |
||
| {{Workeval5|4}} |
|||
| |
|||
# --- |
|||
# --- |
|||
| |
| |
||
* Demonstrated ability to add stems to dix and lexc. |
* Demonstrated ability to add stems to dix and lexc. |
||
Line 71: | Line 68: | ||
# write ≥4 disambig rules |
# write ≥4 disambig rules |
||
note: should be in IRC every day |
note: should be in IRC every day |
||
| {{Workeval5|3}} |
|||
| |
|||
# — |
|||
# -- |
|||
# -- |
|||
# -- |
|||
# -- |
|||
# — |
|||
| |
| |
||
* demonstrated ability to work with lexical selection rules |
* demonstrated ability to work with lexical selection rules |
||
Line 95: | Line 85: | ||
# 500-word evaluation, WER ~30% |
# 500-word evaluation, WER ~30% |
||
| {{Workeval5|0}} |
|||
| |
|||
| |
| |
||
Line 107: | Line 96: | ||
# adding transfer rules |
# adding transfer rules |
||
| {{Workeval5|0}} |
|||
| |
|||
# - |
|||
| |
| |
||
Line 120: | Line 106: | ||
# adding transfer rules |
# adding transfer rules |
||
| {{Workeval5|2}} |
|||
| |
|||
# -- |
|||
# -- |
|||
| |
| |
||
Line 134: | Line 117: | ||
# adding transfer rules |
# adding transfer rules |
||
|{{Workeval5|2}} |
|||
| |
|||
# -- |
|||
# -- |
|||
| |
|||
|- |
|- |
||
Line 147: | Line 126: | ||
# clean testvoc for {{tag|prn}} {{tag|det}} |
# clean testvoc for {{tag|prn}} {{tag|det}} |
||
# adding transfer rules |
# adding transfer rules |
||
|{{Workeval5|3}} |
|||
| |
|||
# -- |
|||
# -- |
|||
| |
| |
||
|- |
|- |
||
Line 159: | Line 135: | ||
# clean testvoc for {{tag|adj}} {{tag|adj}}{{tag|advl}} |
# clean testvoc for {{tag|adj}} {{tag|adj}}{{tag|advl}} |
||
# adding transfer rules |
# adding transfer rules |
||
|{{Workeval5|3}} |
|||
| |
|||
# --- |
|||
# --- |
|||
| |
| |
||
|- |
|- |
||
Line 170: | Line 143: | ||
# total 5600 stems in dix |
# total 5600 stems in dix |
||
# adding transfer rules |
# adding transfer rules |
||
|{{Workeval5|2}} |
|||
| |
|||
# --- |
|||
# --- |
|||
| |
| |
||
|- |
|- |
||
Line 182: | Line 152: | ||
# clean testvoc for {{tag|n}} {{tag|num}}{{tag|subst}} {{tag|np}} {{tag|adj}}{{tag|subst}} |
# clean testvoc for {{tag|n}} {{tag|num}}{{tag|subst}} {{tag|np}} {{tag|adj}}{{tag|subst}} |
||
# adding transfer rules |
# adding transfer rules |
||
|{{Workeval5|2}} |
|||
| |
|||
# -- |
|||
# -- |
|||
| |
| |
||
|- |
|- |
||
Line 193: | Line 160: | ||
# total 6900 stems in dix |
# total 6900 stems in dix |
||
# adding transfer rules |
# adding transfer rules |
||
|{{Workeval5|2}} |
|||
| |
|||
# -- |
|||
# -- |
|||
| |
| |
||
|- |
|- |
||
Line 204: | Line 168: | ||
# total 7600 stems in dix |
# total 7600 stems in dix |
||
# adding transfer rules |
# adding transfer rules |
||
|{{Workeval5|3}} |
|||
| |
|||
# -- |
|||
# -- |
|||
| |
| |
||
|- |
|- |
Revision as of 20:32, 14 March 2014
- Name: Sundetova Aida
- E-mail address: sun27aida@gmail.com
- Other information that may be useful to contact you: nick on the #apertium channel: Aida
- Why is it you are interested in machine translation?
- I have started to learn machine translation in 2012 when I joined to a project, which included developing machine translation from English to Kazakh. Before it I was really interested in artificial intelligence and automation of processes. I continued developing english-kazakh machine translation on Apertium and tried to know more about Apertium free/open-source machine translation platform. Knowledge of the languages, programming and my target to do translation better helped me to learn new programming language as XML and improve my working skills.
- Why is it that they are interested in the Apertium project?
- At the first, Apertium is free/open-source machine translation platform, which means that developers from other countries like me can join and start to do translations for new language pair. Apertium uses Unix “pipelines” which are very useful for fast diagnosis and debugging and I can use additional modules between existing modules, like using HFST(Helsinki finite-state transducer) for morphological analysis and generation for Kazakh language.
- Which of the published tasks are you interested in? What do you plan to do?
- I plan to improve “Apertium English-kazakh” to reach a good translation quality. I already develop this pair, but it doesn't have corpora and enough vocabulary to show adequate translation. My target is to make vocabulary coverage bigger than now by using corpora from news and wikipedia and come close to working translator.
- Include a proposal, including
- a title, --what title??
- reasons why Google and Apertium should sponsor it,
- a description of how and who it will benefit in society,
- English to Kazakh machine translation are very important, because Kazakh is Turkic language, so transfer rules, which I write for this pair can be useful for another English – Turkic Languages pairs.
- and a detailed work plan (including, if possible, a brief schedule with milestones and deliverables). Include time needed to think, to program, to document and to disseminate.
- I plan to work more on vocabulary, and add transfer rules is it needed.
- List your skills and give evidence of your qualifications. Tell us what is your current field of study,
major, etc. Convince us that you can do the work. In particular we would like to know whether you have programmed before in open-source projects.
- I have developed a English to Kazakh machine translation on Apertium since 2012 and Kazakh to English since 2013. I have great experience in writing and correcting transfer rules, lexical selection and constraint grammar rules, also adding vocabulary in monolingual and bilingual dictionaries. I study on 4th grade of bachelor's degree in Information Systems and I will graduate in the summer 2014. I know programming languages: C, C++, C#, HTML, XML, and I have basic knowledge of PHP. In addition, I can work with databases and know SQL. My mother language is Kazakh and I also speak English and Russian.
- List any non-Summer-of-Code plans you have for the Summer, especially employment, if you are applying for internships, and class-taking. Be specific about schedules and time commitments. we would like to be sure you have at least 30 free hours a week to develop for our project.
- Before 20 of June I have final exams, but I will have about 3 hours a day to work on project. After graduating from the university I will be free and can spend 30 hours a week on Apertium.
Contents
Major goals
- Good WER
- Clean testvoc
- 8'000 stems in bidix (~700 stems per week, or ~100 per day)
- Additional rules:transfer, lexical, constraint grammar(~10 per week,or ~2 per day)
Schedule
Timeline
See GSoC 2014 Timeline for complete timeline. Important coding dates follow:
- April 22nd: begin working on project
- June 27th - August 17th: midterm evaluations
- August 18th: 'pencils down' date
- August 22th: final evaluation
Workplan
week | dates | goals
|
notes |
---|---|---|---|
post-application period 23 March - 17 April |
|
| |
community bonding period 17 April - 1 June |
note: should be in IRC every day |
| |
1 | 1 - 22 June |
|
|
2 | 23 - 29 June |
|
|
3 | 30 - 6 July |
|
|
4 | 7 - 13 July |
| |
5 | 14 - 20 July |
|
|
6 | 21 - 27 July |
|
|
7 | 28 - 3 August |
|
|
8 | 4 - 10 August |
|
|
9 | 11 - 17 August |
|
|
10 | 18 - 22 August |
|
Tips and Tricks
Adding stems quickly
- Add top stems from frequency lists of unknown forms
- Use spectie's dix-entries-to-be-checked script