https://wiki.apertium.org/w/index.php?action=history&feed=atom&title=User%3AIlienert%2FGSocApplication2010User:Ilienert/GSocApplication2010 - Revision history2026-04-10T08:56:03ZRevision history for this page on the wikiMediaWiki 1.34.1https://wiki.apertium.org/w/index.php?title=User:Ilienert/GSocApplication2010&diff=18297&oldid=prevIlienert: /* GSoC 2010 Proposal: Detecting hidden unknown words */2010-04-07T19:25:50Z<p><span dir="auto"><span class="autocomment">GSoC 2010 Proposal: Detecting hidden unknown words</span></span></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 19:25, 7 April 2010</td>
</tr><tr>
<td colspan="2" class="diff-lineno">Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>== Contact Information ==</div></td>
</tr>
<tr>
<td class="diff-marker" data-marker="−"></td>
<td class="diff-deletedline diff-side-deleted"><div>== GSoC 2010 Proposal: Detecting hidden unknown words ==</div></td>
<td colspan="2" class="diff-empty diff-side-added"></td>
</tr>
<tr>
<td class="diff-marker"></td>
<td class="diff-context diff-side-deleted"><br /></td>
<td class="diff-marker"></td>
<td class="diff-context diff-side-added"><br /></td>
</tr>
<tr>
<td class="diff-marker"></td>
<td class="diff-context diff-side-deleted"><div>'''Name:''' Ian Lienert<br /></div></td>
<td class="diff-marker"></td>
<td class="diff-context diff-side-added"><div>'''Name:''' Ian Lienert<br /></div></td>
</tr>
<tr>
<td class="diff-marker"></td>
<td class="diff-context diff-side-deleted"><div>'''E-mail Address:''' ian.lienert@gmail.com<br /></div></td>
<td class="diff-marker"></td>
<td class="diff-context diff-side-added"><div>'''E-mail Address:''' ian.lienert@gmail.com<br /></div></td>
</tr>
<tr>
<td class="diff-marker"></td>
<td class="diff-context diff-side-deleted"><div>'''Phone:''' 1-647-885-0840<br /></div></td>
<td class="diff-marker"></td>
<td class="diff-context diff-side-added"><div>'''Phone:''' 1-647-885-0840<br /></div></td>
</tr>
<tr>
<td class="diff-marker" data-marker="−"></td>
<td class="diff-deletedline diff-side-deleted"><div>'''Skype/IRC Nick:''' ilienert<br /></div></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>'''Skype/IRC<ins class="diffchange diffchange-inline">/SourceForge</ins> Nick:''' ilienert<br /></div></td>
</tr>
<tr>
<td class="diff-marker"></td>
<td class="diff-context diff-side-deleted"><br /></td>
<td class="diff-marker"></td>
<td class="diff-context diff-side-added"><br /></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>== Why Machine Translation? ==</div></td>
</tr>
<tr>
<td class="diff-marker" data-marker="−"></td>
<td class="diff-deletedline diff-side-deleted"><div>----</div></td>
<td colspan="2" class="diff-empty diff-side-added"></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>I have always been fascinated by the most intractable problems in computer science. This is the fundamental reason I decided to become a part of the field. Amongst all of the "difficult" problems out there, I cannot perceive a more daunting one than the mastery of natural language processing. The domains of NLP problems are loosely defined and not fully understood by those whose study them. Further adding to the chaos is the sheer number of language pairs in existence. To tackle this kind of problem, collaboration is absolutely necessary and the level of thinking must be as abstract as possible, lest we be faced with an unrealistically large corpus of low-level translation rules and an unintelligible code base. This, then, is what drives me to be a part of NLP and the formalizing of the informal.</div></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><br /></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>== Why Apertium? ==</div></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>As implied above, RBMT interests me the most. This is due to the fact that it relies on the rules of language itself rather than simply what has worked well in the past as can be seen in strictly SMT systems. I have always been seeking projects that will inform and educate me. Through helping people translate language, I will have gained a better understand of how language works. The particular aspect that I wish to work on, modifying the PoS tagger to detect unknown words, deals with the part of NLP that challenges RBMT -- ambiguity. Apertium uses statistical methods to attempt to disambiguate words. Though this can be seen as SMT, it is likely a necessary step due to the fact that humans must infer context through learning.</div></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><br /></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>== My Intended Task ==</div></td>
</tr>
<tr>
<td colspan="2" class="diff-empty diff-side-deleted"></td>
<td class="diff-marker" data-marker="+"></td>
<td class="diff-addedline diff-side-added"><div>I plan to perform the modifications to the PoS tagger so as to [[Ideas_for_Google_Summer_of_Code/Detect_hidden_unknown_words|detect unknown words]]. Specifically, I will assign open-class tags to words in the train() function. I will modify the Viterbi algorithm to compare the maximum transition probability of a surface form with the emission probability of</div></td>
</tr>
</table>Ilienerthttps://wiki.apertium.org/w/index.php?title=User:Ilienert/GSocApplication2010&diff=18277&oldid=prevIlienert: Created page with '== GSoC 2010 Proposal: Detecting hidden unknown words == '''Name:''' Ian Lienert<br /> '''E-mail Address:''' ian.lienert@gmail.com<br /> '''Phone:''' 1-647-885-0840<br /> '''Sky…'2010-04-07T15:54:43Z<p>Created page with '== GSoC 2010 Proposal: Detecting hidden unknown words == '''Name:''' Ian Lienert<br /> '''E-mail Address:''' ian.lienert@gmail.com<br /> '''Phone:''' 1-647-885-0840<br /> '''Sky…'</p>
<p><b>New page</b></p><div>== GSoC 2010 Proposal: Detecting hidden unknown words ==<br />
<br />
'''Name:''' Ian Lienert<br /><br />
'''E-mail Address:''' ian.lienert@gmail.com<br /><br />
'''Phone:''' 1-647-885-0840<br /><br />
'''Skype/IRC Nick:''' ilienert<br /><br />
<br />
----</div>Ilienert