Bech: Link to French page

2014-10-08T07:12:57Z

Link to French page

Bech: reference shown

2012-05-21T11:40:49Z

reference shown

Bech: Documentation in English

2011-09-03T18:34:51Z

Documentation in English

Francis Tyers: New page: {{TOCD}} This page gives a brief overview of how initial consonant mutations are currently analysed, disambiguated and generated in Apertium. It uses as an example the `apertium-ga-g...`


2009-05-25T18:08:13Z
New page: {{TOCD}}  This page gives a brief overview of how initial consonant mutations are currently analysed, disambiguated and generated in Apertium. It uses as an example the <code>apertium-ga-g...
New page
{{TOCD}}



This page gives a brief overview of how initial consonant mutations are currently analysed, disambiguated and generated in Apertium. It uses as an example the <code>apertium-ga-gd</code> language pair.



===Analysis===



Analysis is taken care of by creating word-initial paradigms which simply replace the non-mutated forms with the mutated forms. For example for the initial consonant, 'b', which can be lenited as 'bh' or eclipsed as 'mb', we get the following initial mutation paradigm:



<pre>

    <pardef n="initial-b">

      <e><p><l>b</l><r>b</r></p></e>

      <e><p><l>bh</l><r>b</r></p></e>

      <e><p><l>mb</l><r>b</r></p></e>

    </pardef>

</pre>



This can then be applied to a word, e.g. "bulc" (), like:



<pre>

    <e lm="bulc"><par n="initial-b"/><i>u</i><par n="bu/lc__n"/></e>

</pre>



The initial mutation is 'b', and the word takes the <code>bu/lc__n</code> paradigm. The problem with this method is that sometimes it can cause "over analysis", but we can take care of this with disambiguation, see below.



===Disambiguation===



Disambiguation of initial-mutations can be done using [[constraint grammar]] (see the file <code>apertium-ga-gd.ga-gd.rlx</code>). The apertium-tagger is not useful for this purpose as it cannot look at surface forms of words, only lexical units. A trivial illustrative example of how the constraint grammar can be used is presented below. Lets say we want to choose between a feminine possessive determiner and a masculine possessive determiner based on the type of mutation exhibited by the following noun, for example in the following two phrases:<ref>Note that this is not really relevant for Irish to Scots Gaelic as the surface forms of each are the same</ref> 



* a pheann, &mdash; ''his pen''

* a haois &mdash; ''her age''



Here the determiner, "a", can be either masculine or feminine (that is, "his" or "her"). So, if we have the following input to the constraint grammar:



<pre>

  ^a/a<det><pos><p3><mf><pl>/a<det><pos><p3><m><sg>/a<det><pos><p3><f><sg>$ ^pheann/peann<n><m><sg><nom>/peann<n><m><pl><gen>$

  ^a/a<det><pos><p3><mf><pl>/a<det><pos><p3><m><sg>/a<det><pos><p3><f><sg>$ ^haois/aois<n><f><sg><nom>$ 

</pre>



So, first we define what we want to work with,



<pre>

LIST DetPos = (det pos);             # possessive determiner



LIST hPro = ("<h.*>"r "[aeiou].*"r); # h-prothesis

LIST Len = ("<ph.*>"r "p.*"r);       # lenition



SET DetPosF = DetPos | (f);          # feminine possessive determiner

SET DetPosM = DetPos | (m);          # masculine possessive determiner

</pre>



This should be fairly straightforward, then we write rules that say "Choose the feminine possessive when the noun that follows is subject to h-prothesis, and the masculine possessive when the noun that follows is subject to lenition",



<pre>

SELECT DetPosF IF (1 hPro);

SELECT DetPosM IF (1 Len);

</pre>



Applying this grammar gives:



<pre>

  ^a<det><pos><p3><m><sg>$ ^peann<n><m><sg><nom>$ 

  ^a<det><pos><p3><f><sg>$ ^oíche<n><f><sg><nom>$ 

</pre>



The desired result.



===Generation===



;Overview



Generation of initial mutations takes place in two files, where <math>x</math> is the code of the language that is being generated (<code>ga</code> for Irish, <code>gd</code> for Scottish Gaelic).



* <code>apertium-ga-gd.pre-<math>x</math>.t1x</code> &mdash; Transfer rules which add tags defining the mutation to the beginning of words which should be mutated.

* <code>apertium-ga-gd.muta-<math>x</math>.dix</code> &mdash; A post-generation dictionary which takes the tag and the initial letter of the word and outputs the mutated form.



For example, when translating the phrase "do theach" (your house) from Irish to Scottish Gaelic, the result will be do <u>th</u>aigh (where the initial mutation is marked by an underscore). The output of <code>apertium-transfer</code> will be:



<pre>

  ^do<det><pos><p2><mf><sg>$ ^taigh<n><m><sg><nom>$ 

</pre>



This is then passed through <code>apertium-ga-gd.pre-gd</code>, which adds a tag, <code><l1></code> for lenition.



<pre>

  ^do<det><pos><p2><mf><sg>$ ^<l1>$^taigh<n><m><sg><nom>$ 

</pre>



The morphological generator then outputs the surface forms of the words, and appends an "alarm" signal to the mutation tag.



<pre>

  do ~<l1>taigh

</pre>



Finally, the mutation dictionary, <code>apertium-ga-gd.muta-gd.dix</code>, replaces the string <code>~<l1>t</code> with 'th', which is the lenited form of 't'.



<pre>

  do thaigh

</pre>



;apertium-ga-gd.pre-<math>x</math>.t1x



As mentioned above, the input to this stage is:



<pre>

  ^do<det><pos><p2><mf><sg>$ ^taigh<n><m><sg><nom>$ 

</pre>



A simplified (although functioning) rule in this file might look something like:



<pre>

<pattern>

  <pattern-item n="det"/>

  <pattern-item n="nom"/>

</pattern>

<choose> 

  <when> <!-- When the lemma of the determiner is "do", 

              apply lenition to the following noun -->

    <test>

      <equal>

        <clip pos="1" side="tl" part="lem"/>

        <lit v="do"/>

      </equal>

     </test>

     <out>

      <lu><clip pos="1" side="tl" part="whole"/></lu>

      <b/>

      <lu><lit-tag v="l1"/></lu>    <!-- Lenition -->

      <lu><clip pos="2" side="tl" part="whole"/></lu>

    </out>

  </when>

</choose>



</pre>



And the output will be, 



<pre>

  ^do<det><pos><p2><mf><sg>$ ^<l1>$^taigh<n><m><sg><nom>$ 

</pre>



;apertium-ga-gd.muta-<math>x</math>.dix



The input to this stage is:



<pre>

  do ~<l1>taigh

</pre>



The "rule", or rather "entry" in the mutation dictionary will look like:



<pre>

    <e>

      <p>

        <l><a/><s n="l1"/>t</l>

        <r>th</r>

      </p>

      <par n="alphabet"/> 

    </e>

</pre>



Here, the alphabet is defined as a paradigm which for any given input letter, just outputs the letter unchanged. So this basically says, 



:"When we have the alarm symbol '~', followed by a tag indicating lenition followed by a 't' and then any alphabetic character, output 'th' followed by the next character"



The output of this stage is a correctly mutated phrase, 



<pre>

  do thaigh

</pre>



[[Category:Documentation]]

← Older revision		Revision as of 07:12, 8 October 2014
Line 1:		Line 1:
			[[Mutation de la consonne initiale\|En français]]

	{{TOCD}}		{{TOCD}}

← Older revision		Revision as of 18:34, 3 September 2011
Line 170:		Line 170:

	[[Category:Documentation]]		[[Category:Documentation]]
			[[Category:Documentation in English]]

@@ Line 168: / Line 168: @@
   do thaigh
 </pre>
+== Notes ==
+<references/>
 [[Category:Documentation]]

Initial consonant mutation - Revision history

Bech: Link to French page

Bech: reference shown

Bech: Documentation in English

Francis Tyers: New page: {{TOCD}} This page gives a brief overview of how initial consonant mutations are currently analysed, disambiguated and generated in Apertium. It uses as an example the apertium-ga-g...

Francis Tyers: New page: {{TOCD}} This page gives a brief overview of how initial consonant mutations are currently analysed, disambiguated and generated in Apertium. It uses as an example the `apertium-ga-g...`