Difference between revisions of "Unigram tagger"

Revision as of 03:21, 14 January 2016

The code is a clone of apertium and is at m5w/apertium. It has the same dependencies as apertium, so one should install it in the same way. See Installation and Minimal installation from SVN for more information.

This code's apertium-tagger implements the three unigram models in A set of open-source tools for Turkish natural language processing. See section 5.3.

See section 5.3.1. This model scores each analysis string in proportion to its frequency with add-one smoothing. Consider the following corpus.

^a/a<a>$
^a/a<b>$
^a/a<b>$

Passed the lexical unit ^a/a<a>/a<b>/a<c>$, the tagger assigns the analysis string a<a> a score of

f + 1 =
  (1) + 1 =
  2

and a<b> a score of (2) + 1 = 3. The tagger assigns the unknown analysis string a<c> a score of 1.

@@ Line 12: / Line 12: @@
 ^a/a<b>$
 </pre>
-Passed the lexical unit <code>^a/a<a>/a<b>/a<c>$</code>, the tagger assigns the analysis string <code>a<a></code> a score of
+Passed the lexical unit <code>^a/a&lt;a&gt;/a&lt;b&gt;/a&lt;c&gt;$</code>, the tagger assigns the analysis string <code>a&lt;a&gt;</code> a score of
 <pre>
 f + 1 =
   (1) + 1 =
-</pre> and <code>a<b></code> a score of <code>(2) + 1 = 3</code>. The tagger assigns the unknown analysis string <code>a<c></code> a score of <code>1</code>.
+</pre> and <code>a&lt;b&gt;</code> a score of <code>(2) + 1 = 3</code>. The tagger assigns the unknown analysis string <code>a&lt;c&gt;</code> a score of <code>1</code>.
 [[Category:Development]]