Difference between revisions of "User:Aida/Application"

From Apertium
Jump to navigation Jump to search
Line 63: Line 63:
|
|
# run first testvoc
# run first testvoc
# run coverage scripts
# get first frequency lists
# get first frequency lists
# write ≥4 lexical selection rules
# write ≥4 lexical selection rules
# write ≥3 transfer rules
# write ≥3 transfer rules
# write ≥4 disambig rules
# write ≥4 disambiguatino rules
note: should be in IRC every day
note: should be in IRC every day


Line 81: Line 80:
|
|
# total 4200 stems in dix
# total 4200 stems in dix
# clean testvoc for {{tag|postadv}} {{tag|ij}}
# adding unknown words {{tag|postadv}} {{tag|ij}} {{tag|adv}}
# adding transfer rules
# adding transfer rules
# 500-word evaluation, WER ~40%
# 500-word evaluation, WER ~40%
Line 95: Line 94:
|
|
# total 4900 stems in dix
# total 4900 stems in dix
# clean testvoc for {{tag|num}} {{tag|post}}
# adding unknown words {{tag|num}} {{tag|post}} {{tag|prn}} {{tag|det}}
# adding transfer rules
# adding transfer rules


Line 106: Line 105:
|
|
# total 5600 stems in dix
# total 5600 stems in dix
# clean testvoc for {{tag|cnjcoo}} {{tag|cnjadv}} {{tag|cnjsub}}
# adding unknown words {{tag|cnjcoo}} {{tag|cnjadv}} {{tag|cnjsub}}
# adding transfer rules
# adding transfer rules


Line 120: Line 119:
|
|
# total 6300 stems in dix
# total 6300 stems in dix
# clean testvoc for {{tag|adv}}
# adding unknown words {{tag|adj}} {{tag|n}} {{tag|np}}
# adding transfer rules
# adding transfer rules
|
|
Line 132: Line 131:
|
|
# total 7000 stems in dix
# total 7000 stems in dix
# clean testvoc for {{tag|prn}} {{tag|det}}
# clean testvoc for #
# adding transfer rules
# adding transfer rules


Line 144: Line 143:
|
|
# total 7700 stems in dix
# total 7700 stems in dix
# clean testvoc for {{tag|adj}} {{tag|adj}}{{tag|advl}}
# correcting tags and clean testvoc for #
# adding transfer rules
# adding transfer rules


Line 164: Line 163:
|
|
# total 9100 stems in dix
# total 9100 stems in dix
# correcting tags and clean testvoc for #
# clean testvoc for {{tag|n}} {{tag|num}}{{tag|subst}} {{tag|np}} {{tag|adj}}{{tag|subst}}
# adding transfer rules
# adding transfer rules


Revision as of 17:19, 17 March 2014

  • Name:Aida Sundetova
  • 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, so 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
      • Adopt English-Kazakh language
    • 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 Language 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 if 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, my major is 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.

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
  1. finish coding challenge with WER ~45%
  2. total 3660 stems in dix
  • Demonstrated ability to add stems to dix and lexc.
  • A couple easy lexical selection rules are still not written.
  • Needs for transfer rules in eng-kaz.t1x
17 April - 1 June
  1. run first testvoc
  2. get first frequency lists
  3. write ≥4 lexical selection rules
  4. write ≥3 transfer rules
  5. write ≥4 disambiguatino rules

note: should be in IRC every day

  • demonstrated ability to work with lexical selection rules
  • Needs for lexical rules in eng-kaz.lrx
  • got only some experience with coverage scripts


1 1 - 22 June
  1. total 4200 stems in dix
  2. adding unknown words <postadv> <ij> <adv>
  3. adding transfer rules
  4. 500-word evaluation, WER ~40%
  • demonstrated ability to work with constraint grammar rules and disambiguating
  • Needs for CG rules in eng-kaz.rlx
2 23 - 29 June
  1. total 4900 stems in dix
  2. adding unknown words <num> <post> <prn> <det>
  3. adding transfer rules
  • demonstrated ability to work with transfer rules and chunking
  • Needs for transfer rules in eng-kaz.t1x
3 30 - 6 July
  1. total 5600 stems in dix
  2. adding unknown words <cnjcoo> <cnjadv> <cnjsub>
  3. adding transfer rules
  • demonstrated ability to work with transfer rules and chunking
  • Needs for transfer rules in eng-kaz.t1x
4 7 - 13 July
  1. total 6300 stems in dix
  2. adding unknown words <adj> <n> <np>
  3. adding transfer rules
  • demonstrated ability to work with transfer rules
  • Needs for transfer rules in eng-kaz.t2x
5 14 - 20 July
  1. total 7000 stems in dix
  2. clean testvoc for #
  3. adding transfer rules
  • demonstrated ability to work with transfer rules
  • Needs for transfer rules in eng-kaz.t2x
6 21 - 27 July
  1. total 7700 stems in dix
  2. correcting tags and clean testvoc for #
  3. adding transfer rules
  • Needs for "cleaning" tags rules in eng-kaz.t4x
7 28 - 3 August
  1. total 8400 stems in dix
  2. adding transfer rules
  • Needs for transfer rules in eng-kaz.t1x
  • Needs for transfer rules in eng-kaz.t4x
8 4 - 10 August
  1. total 9100 stems in dix
  2. correcting tags and clean testvoc for #
  3. adding transfer rules
  • Needs for transfer rules in eng-kaz.t1x
  • Needs for transfer rules in eng-kaz.t2x
9 11 - 17 August
  1. total 9800 stems in dix
  2. adding transfer rules
  • Needs for transfer rules in eng-kaz.t2x
10 18 - 22 August
  1. total 10500 stems in dix
  2. finish with WER ~30%
  3. adding transfer rules
  • Finishing documentation

Tips and Tricks

Adding stems quickly

  • Add top stems from frequency lists of unknown forms
  • Use spectie's dix-entries-to-be-checked script
Retrieved from "https://wiki.apertium.org/w/index.php?title=User:Aida/Application&oldid=47250"