<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="1992"/><title>Two-Level Morphology with Composition</title><author surname="Karttunen" givenname="Lauri"><org  name="Palo Alto Research Center" country="USA" city="Palo Alto"/></author><author surname="Kaplan" givenname="Ronald M."><org  name="Palo Alto Research Center" country="USA" city="Palo Alto"/></author><author surname="Zaenen" givenname="Annie"><org  name="Palo Alto Research Center" country="USA" city="Palo Alto"/></author></firstpageheader><frontmatter><p><b>Two-Level Morphology with Composition</b></p><p>Lauri Karttunen, Ronald M. Kaplan, and Annie Zaenen</p><p><i>Xerox Palo Alto Research Center Center for the Study of Language and Information Stanford University</i></p><p><i>1. Limitations of "Kimmo" systems</i></p><p>The advent of two-level morphology (Koskenniemi [1], Karttunen [2], Antworth [3], Ritchie <i>et al. </i>[4]) has made it relatively easy to develop adequate morphological (or at least morphographical) descriptions for natural languages, clearly superior to earlier "cut-and-paste" approaches to mor­phology. Most of the existing "Kimmo" systems developed within this paradigm consist of</p><p>• linked lexicons stored as annotated letter trees</p><p>• morphological information on the leaf nodes of trees</p><p>• transducers that encode morphological alternations</p></frontmatter><abstract></abstract></header><body><section title=""><p>An analysis of an inflected word form is produced by mapping the input form to a sequence of lexical forms through the transducers and by composing some out­put from the annotations on the leaf nodes of the lexical paths that were traversed.</p><p>Comprehensive morphological descrip­tions of this type have been developed for several languages including Finnish, Swedish, Russian, English, Swahili, and Arabic. Although they have several good features, these Kimmo-sys terns also have some limitations. The ones we want to ad­dress in this paper are the following:</p><p>(1) <b>Lexical representations tend to be arbitrary. </b>Because it is difficult to write and test two-level systems that map between pairs of radically dissimilar forms, lexical representations in existing two-level analyzers tend to stay close to the surface forms.</p><p>This is not a problem <b>for </b>morpho­logically simple languages like English because, for most words, inflected forms are very similar to the canonical dictionary entry. Except for a small number of irregular verbs and nouns, it <b>is </b>not difficult to create a two-level description for English in which lexical forms coincide with the canonical citation forms found in a dictionary.</p><p>However, current analyzers for mor­phologically more complex languages (Finnish and Russian, for example) are not as satisfying in this respect. In these systems, lexical forms typically contain diacritic markers and special symbols; they are not real words in the language. For example, in Finnish the lexical counterpart of of in T took' might be rendered as <i>otTallln, </i>where T, <i>at,</i><i> </i>and <i>II </i>are an arbitrary encoding of morpho­logical alternations that determine the allomorphs of the stem and the past tense morpheme. The canonical citation form <i>ottaa </i>'to take' is composed from annotations on the leaf nodes of the letter trees that are linked to match the input. It is not in any direct way related to the lexical form produced by the transducers.</p><p>(2) Morphological <b>categories are not directly encoded as part of the lexical form. </b>Instead of morphemes like <i>Plural </i>or <i>Past, </i>we typically see suffix strings like +s, and +ed, which do <b>not by </b>themselves indi­cate what morpheme <b>they </b>express. Different realizations <b>of the same </b>morpho­logical category <b>are often </b>represented as different even on the <b>lexical </b>side.</p><p>These characteristics lead to some un­desirable consequences:</p><doubt alpha="56.4" length="78" tooSmall="False" monospace="0.0">Actes deCOlJNG-92,Nantes,23-28août141Proc. ofCOLING-92,Nantes, Aug.23-28, 1992</doubt><page local="2" global="1993"/><p>I. Generation <b>is more cumbersome and less efficient than analysis. </b>Because the information about morphological cate­gories is available only on the leaf nodes of the trees, many paths through the struc­ture may have to be tried before the right one is found. Some ways around this problem have been invented (Barton [5]) but in practice their use is limited.</p><p>II. <b>Annotated letter trees cannot be minimized. </b>Although letter trees, anno­tated with morphological information, are a kind of finite-state network, they cannot be minimized because all the information associated with the leaf nodes would get lost when the branching tails are merged.</p><p>The approach that we describe in this paper overcomes these problems and al­lows a representation of morphological in­formation that maps more easily to the representation found in traditional lexi­cons. On this basis we have constructed morphological analyzers for English and French (with Carol Neidle) at Xerox <b>PARC.</b></p></section><section number="2." title="Desiderata"><p>We follow two simple principles:</p><p>(1) <b>Inflected forms of the same word are mapped to the same canonical dictio­nary form. </b>This applies to both regular and irregular forms. For example, in our English analyzer the surface forms <i>happier </i>and <i>better </i>are directly matched with the lexical forms <i>happy </i>and <i>good, </i>respectively, rather than some nonwords.</p><p>(2) <b>Morphological categories are repre­sented as part of the lexical form. </b>Instead of encoding morphological categories such as <i>Plural, Comparative, IstPerson </i>as annota­tions on strings that realize them, we in­clude them directly in the lexical represen­tation. Consequently, our two-level repre­sentation of <i>happier </i>and <i>better </i>are:</p><p><i>lexical level      </i>happy +Comp +Adj <i>surface level     </i>happi     er 0 <i>lexical level       </i>good   +Comp +Adj <i>surface level      </i>bett        er 0</p><p>Figure 1</p><p>The stems are presented as the lemmas found in a dictionary, followed by mor­phological tags. 0 serves here as the epsilon symbol. Because there is no need to have other annotations on the lexicon trees, problems I and II in Section 1 have been eliminated. Lexical forms are always sequences of morphemes in their canonical representation.</p><p>The only obstacle to this approach is that the rules that constrain the surface realization of lexical forms become more difficult to write when there is little or no similarity between the two levels of repre­sentation. Designing such rules and under­standing their interactions is a hard task even with the computational assistance provided by a complete compiler for the two-level formalism (Karttunen et al. [6]).</p><p>As the distance between lexical and sur­face form increases, the mapping is easier to describe by allowing one or more intermediate levels of representation. The solution we adopted combines the two-level rule formalism with the cascade model of finite-state morphology dis­cussed by Kaplan &amp; Kay [7].</p></section><section number="3." title="Composition of two-level rules"><p>Our formal understanding of finite-state morphology is based on the demonstrations that both rewriting rules and two-level rules denote regular relations on strings (Kaplan [9]). The correspondence between regular relations and finite-state transducers and the closure properties of regular relations provide the computational and mathematical tools that our approach depends on. One of the earliest results of finite-state morphology is the observation that regular relations are closed under composition (Johnson [8], Kaplan&amp;Kay [7], Kaplan [9]).<page local="3" global="1994"/> Consequently, a single transducer can be constructed whose behavior is exactly the same as a set of transducers arranged in an ordered feeding cascade:</p><p><b><i>lexical string</i></b> <b><i>intermediate string </i></b>♦ <b><i>surface string surface string</i></b></p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">!</doubt><doubt alpha="50.0" length="6" tooSmall="False" monospace="0.0">f St ,</doubt><p>Figure 2</p><p>This observation was originally made about transducers corresponding to phonological rewrite rules, but it applies to regular relations or transducers no matter how they are specified. Although regular relations in general are not closed under intersection, the subclass of relations denoted by standard two-level rules is closed under this operation (Kaplan [9]). Thus <b>fstj </b>and <b>f</b>st2 in Figure 2 may represent either a single two-level rule or the intersection of any number of rules.</p><p>When the relationship between lexical and surface forms is complex, the descrip­tive task of setting up rules that relate the two levels can be simplified by decompos­ing the complex relation to a series of less opaque matches. For efficient recognition and generation, the resulting cascade can be reduced to a single transducer. Al­though it would be possible in principle to produce the same single transducer directly from two-level rules, we have found many cases in our descriptions of English and French where the composition approach is not only easier but also linguistically more justified. We describe one such case in detail.</p></section><section number="4." title="French compound plurals"><p>French plurals can be formed in a vari­ety of ways. Some of the most common patterns are illustrated in Figure 3.</p><p>We omit here the actual two-level rules; what Figure 3 illustrates is simply the joint effect of several rules that con­strain the realization of the plural mor­pheme and the shape of the stem in regu­lar nouns. Note that the constraints here are local; the stem and the plural morpheme are in a fixed position with respect to each other.</p><p><b>'message '</b> <b>message +masc +pl</b></p><doubt alpha="54.8" length="31" tooSmall="False" monospace="0.0">message 0 s nez       +masc +pl</doubt><doubt alpha="42.9" length="7" tooSmall="False" monospace="0.0">nez 0 0</doubt><doubt alpha="64.0" length="25" tooSmall="False" monospace="0.0">cheveu   +masc +pl 'hair'</doubt><doubt alpha="100.0" length="6" tooSmall="False" monospace="0.0">cheveu</doubt><doubt alpha="65.4" length="26" tooSmall="False" monospace="0.0">cheval   +masc +pl 'horse'</doubt><doubt alpha="100.0" length="6" tooSmall="False" monospace="0.0">chevau</doubt><p>Figure 3</p><p>In compound nouns and adjectives, several patterns are possible: (1) only the first part of the compound is marked for the plural, (2) both are, (3) none are or (4) only the last is.<page local="4" global="14"/> The possible patterns and some examples are given in Figure 4.</p><doubt alpha="52.4" length="42" tooSmall="False" monospace="0.0">Actes de COUNG-92, Nantes, 23-28 août 1992</doubt><doubt alpha="44.7" length="47" tooSmall="False" monospace="0.0">143 Proc. op COLING-92, Nantes, Aug. 23-28,1992</doubt><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b><i>lexical</i></b></p></td><td class="cell"><p><b><i>string</i></b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b><i>composite transducer</i></b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><p>The interesting cases are those in which the first part needs to be pluralized. In a simple two-level system, the information about plural formation summarized in Figure 3 would have to be rewritten and adapted so that the rules could apply over a. distance in the position just before the hyphen.</p><p><u>No plural marking at all</u> <i>un je-ne-sais-quoi     </i>'a certain something' <i>des je-ne-sais-quoi</i> <u>Plural marking on the first compound</u> <i>un chef-d'oeuvre </i>'masterpiece' <i>des chefs-d'oeuvre</i> <u>Plural marking on the second compound</u> <i>une mini-jupe </i>'mini-skirt' <i>des mini-jupes</i> <u>Plural marking on both compounds</u> une porte-fenêtre   Trench window' des portes-fenêtres</p><p>Figure 4</p><p>The simple rules for regular plural for­mation illustrated in Figure 3 do not work for first parts of compounds because the affected elements are not in the same con­figuration relative to each other. Although it is possible to modify the rules, the new versions would be rather complicated and do not capture the simple fact that the plu­rals <i>portes </i>and <i>fenêtres </i>in <i>portes-fenêtres </i>in themselves are regular, the only thing that is special about the word is that plurality is expressed in both parts of the com­pound.</p><p>We avoid these complications by creat­ing a cascade of two-level rules in which the first stage is only concerned with the plurals of compounds. It starts from a lexi­cal form in which the words are marked for the pattern that they take and creates an intermediate level in which the information about number and gender is distributed over the agreeing parts. This is illustrated in Figure 5 for the masculine plural of <i>social-démocrate, </i>a word in which both parts get pluralized.</p><doubt alpha="60.0" length="40" tooSmall="False" monospace="0.0">social    0     0 -democrate+DPL+masc+pl</doubt><p><b>social+masc+pl-démocrate 0 +masc+pl </b>Figure 5</p><p>The effect of the first stage of rules is to copy the morphological tags from the end of the compound to the middle whenever the +<b>dpl </b>(double plural) diacritic is pre­sent.</p><p>The second layer of rules applies uni­formly to simple nouns as well as com­pounds. In the case at hand, the two plu­rals in <i>sociaux-démocrates </i>are realized in the regular way, as shown in Figure 6.</p><p><b>social +masc +pl -démocrate +masc +pl</b></p><doubt alpha="44.7" length="38" tooSmall="False" monospace="0.0">sociau   0      x   -démocrate     0 a</doubt><p>Figure 6</p><p>By first intersecting the rules in each set and then composing the results in the way shown in Figure 2, we end up with a transducer that eliminates the intermedi­ate level altogether and maps the lexical representation directly to the correct sur­face form, and vice versa. Figure 7 illus­trates the final result.</p><p><b>social 0 -démocrate +DPL +masc +pl</b> <b>sociau x -démocrate    0 </b><b>Os</b></p><p>Figure 7<page local="5" global="15"/></p><doubt alpha="53.5" length="43" tooSmall="False" monospace="0.0">Actes de COLING-92, Nantes, 23-28 août 1992</doubt><p>The representation in Figure 7 fulfills the desiderata laid out in Section 2 except that it contains a special diacritic +<b>dpl </b>that marks the behavior of <i>social-démocrate, </i>with respect to plural formation. In the next section, we show how that diacritic can be eliminated.</p></section><section number="5." title="Composition with the lexicon"><p>By choosing the canonical dictionary form as the lexical form in our English and French analyzers and by including mor­phological categories directly as part of that representation, we have eliminated the need for additional annotations in the lexical structure that are common in exist­ing Kimmo systems. We can treat the letter tree as a simple finite-state network in which all morphological information is carried on the branches of the tree and not on the leaves.</p><p>Taking this idea one step further, we may think of the lexicon as a trivial first stage in a cascade of transducers that maps between the lexical and the surface levels. The second stage is the two-level rule sys­tem. In the case of our analyzers for English and French, the rule system starts out with three levels but reduces to two by intersection and composition. The final stage is the composition of the rule system with the lexicon.</p><p>This progression of pushing the original Kaplan &amp; Kay [7] program to its logical conclusion is depicted in Figure 8.</p><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">Stage 1</doubt><doubt alpha="100.0" length="7" tooSmall="False" monospace="0.0">LEXICON</doubt><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">fsl;</doubt><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">fst;</doubt><doubt alpha="50.0" length="4" tooSmall="False" monospace="0.0">i_J_</doubt><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">LlIJ</doubt><p><b>fsl.</b></p><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">tslk</doubt><p><b><i>surface string</i></b> <b><i><u>Cejrical string</u></i></b> <b>LEXICON o</b></p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">&amp;</doubt><doubt alpha="83.3" length="6" tooSmall="False" monospace="0.0">Stage2</doubt><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">FST,</doubt><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">FST?</doubt><doubt alpha="50.0" length="2" tooSmall="False" monospace="0.0">V7</doubt><doubt alpha="83.3" length="6" tooSmall="False" monospace="0.0">Stage3</doubt><doubt alpha="83.3" length="6" tooSmall="False" monospace="0.0">Stage4</doubt><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">FST;</doubt><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">FST2</doubt><p>Figure 8</p><p>Figure 8 sketches the construction of our morphological analyzers for English and French. Arrows labeled with &amp; repre­sent intersection, arrows marked with o stand for composition. (We have simpli­fied this picture slightly by omitting the composition of small bookkeeping rela­tions that are necessary to model properly the interpretation of epsilon transitions in two-level rules.)</p><p>Stage 1 consists of two parallel two-level rule systems arranged in a cascade, as illustrated in Section 4. In Stage 2, the rules on each level have been intersected to a single transducer. Stage 3 shows the composition of the two-level rule systems to a single transducer and Stage 4 repre­sents the final result: a transducer that maps sequences of canonical dictionary forms and morphological categories to the corresponding surface forms, and vice versa. Although the conceptual picture is quite straightforward, the actual com­putations to produce the structures can be resource intensive, in some cases quite impractical.<page local="6" global="16"/></p><doubt alpha="44.7" length="47" tooSmall="False" monospace="0.0">145Proc. of COLING-92. Nantes, Aug. 23-28, 1992</doubt><p>At the last stage, when the idiosyncratic behavior of particular lexical items has been taken into account in the composition of the lexicon with the rule transducers, all morphological diacritics such as the <b>+DPL </b>tag for French nouns with double plurals can be eliminated because the rules that depend on them have been applied. In full compliance with our desiderata in Section 2, the resulting transducer maps, among other things, <i>social-démocrate+masc+pl </i>directly to <i>sociaux-démocrates, </i>and vice versa.</p></section><section number="6." title="Discussion"><p>Finite-state morphology rests on the ob­servation that ordinary morphological al­ternations involve regular relations. This is the basis of the early work by Kaplan and Kay [7] on converting ordered rewrite rules to a cascade of transducers and the parallel transducers of Koskenniemi's two-level model [1]. In recent times the two-level model has been more popular. It has turned out (Karttunen [10]) that parallel two-level constraints are even expressive enough to account for phenomena that require rule ordering in the classical phonological rule formalism. But there is no computational or theoretical reason to insist on two-level descriptions. Because the mathematical properties of rewrite and two-level rules are now well-understood (Kaplan [9], Ritchie [11]), we can compose any n-level description to just two levels. In our work on English and French mor­phology we came across many instances in which the introduction of an extra level is both practical and linguistically motivated. The case of French compound plurals is a typical example.</p><p>Our success in composing the rule sys­tem with the lexicon (Stage 4 in Figure 8) is due to a number of fortunate characteristics that morphological alternations and lexicons of natural languages seem to have even though they are not necessary or even probable from a formal point of <b>view.</b><b> </b>We at least were surprised by some of our results. The most important of these delightful discoveries are:</p><p>(1) <b>Small case studies can be mis­leading. </b>The composition of a rule trans­ducer against a lexicon containing a hand­ful of words is so much larger than the input lexicon that one is tempted to con­clude that the method can never succeed on a large scale. However, this blowup seems not to occur when the lexicon is already large.</p><p>(2) <b>Intersections and compositions of rule transducers tend to be large, but not nearly </b>as <b>large as they might be. </b>The result of intersecting a few dozen two-level rules may have thousands or tens of thousands of states, but not trillions as the worst case scenario predicts. Many rules tend to apply either in quite similar or in quite different environments. The finite state machinery can represent such pat­terns without multiplying state sets.</p><p>(3) <b>Composition with the lexicons reduces the complexity of rule inter­actions. </b>It might turn out that the composition of a large lexicon with an even larger rule transducer is bigger than either one of the input structures. In reality, the size of the result seems to be somewhere in the middle. The rules constrain the realization of all possible lexical forms. In the composition, their scope is restricted to just the forms <b>that </b>actually exist in the language. It turns out that this restriction makes the <b>result </b>smaller rather than larger even though <b>the </b>lexicon itself is a very <b>irregular </b>collection of forms.</p><p>The fact that it is possible to construct a lexical transducer for the whole language raises interesting theoretical issues. In <b>lin­</b>guistics it is commonly assumed that lexical entries and the rules for realizing them exist independently from one another.<page local="7" global="147"/> That assumption is, of course, also the starting point of the work that we are re­porting about in this paper. The initial separation between the lexicon and the rules is useful in constructing a system for word recognition and generation. The rules are, in a sense, a decomposition of a very complex mapping between lexical and surface forms to a set of simpler rela­tions that we can comprehend and ma­nipulate. But in the construction of the fi­nal result individual rules and the distinct lexicon disappear. The rules play no role at all in the actual generation and recognition process. They are needed only for the pur­pose of enlarging the lexicon, although other acquisition methods can be envi­sioned. The rules are true generalizations about the two-level lexicon constructed with them but they are not a part of it.</p><doubt alpha="47.8" length="92" tooSmall="False" monospace="0.0">Actes de COLING-92, Nantes, 23-28 août 1992 14 6Proc. of COLING-92, Nantes, Aug. 23-28, 1992</doubt><p>In linguistics the psychological reality of rules is often taken to be established by the observation that a simple listing of all forms would be not only implausible but even impossible, given that the brain must have some storage limitations. The general organization of the system like the one we have described suggests that the role of rules might be quite different. Instead of being essential for the production and comprehension of speech, the rules that linguists are trying to discover may be—if they exist in the mind at all—only sec­ondary reflections on the generalizations that can be encoded in the finite-state lexi­cal structure itself.</p></section><references><p>[1] Koskenniemi, K. <i>Two-level Morphol­ogy. A General Computational Model for Word-Form Recognition and Production. </i>Department of General Linguistics. University of Helsinki. 1983.</p><p>[2] Karttunen, L. <b>KIMMO: </b>a General Morphological Processor. <i>Texas Lin­guistics Forum, </i>22:217-228. 1983.</p><p>[3] Antworth, E. L. <b><i>PC-KIMMO: </i></b><i>a two-level processor for morphological analysis. </i>Occasional Publications in Academic Computing No. 16, Summer Institute of Linguistics, Dallas, Texas. 1990.</p><p>[4] Ritchie, G. D., G. J. Russell, A. W. Black, S. G. Pulman. <i>Computational Morphology. Practical Mechanisms for the English Lexicon. </i>The <b>MIT </b>Press, Cambridge, MA. 1991</p><p>[5] Barton, E., R. Berwick, E. Ristad. <i>Computational Complexity and Natural Language. </i>The <b>MIT </b>Press, Cambridge <b>MA. </b>1987.</p><p>[6] Karttunen, L., K. Koskenniemi, and R. M. Kaplan. A Compiler for Two-level Phonological Rules. In Dal-rymple, M. <i>et al. Tools for Morphologi­cal Analysis. </i>Center for the Study of Language and Information. Stanford University. Palo Alto. 1987.</p><p>[7] Kaplan, R. M. and M. Kay. Phonolog­ical rules and finite-state transducers [Abstract], <i>Linguistic Society of Amer­ica Meeting Handbook. </i>Fifty-sixth An­nual Meeting, December 27-30, 1981. New York.</p><p>[8] Johnson, C. Douglas. <i>Formal Aspects of Phonological Description. </i>Mouton. The Hague. 1972.</p><p>[9] Kaplan, R. M. Regular models of phonological rule systems. Alvey Workshop on Parsing and Pattern Recognition. Oxford University, April 1988.</p><p>[10] Karttunen, Lauri. Finite-State Con­straints. In the <i>Proceedings of the Inter­national Conference on Current Issues in Computational Linguistics, </i>June 10-14, 1991.<page local="8" global="14"/> Universiti Sains Malaysia, Pe-nang, Malaysia. 1991.</p><p>[11] Ritchie, Graeme D. Languages Gen­erated by Two-level Morphological</p><p>Rules. Research Paper 496. Depart­ment of Artificial intelligence, Uni­versity of Edinburgh, 1990. To appear in <i>Computational Linguistics.</i></p><doubt alpha="100.0" length="6" tooSmall="False" monospace="0.0">Resume</doubt><p>Cet article décrit une nouvelle utilisation des transducteurs réguliers en analyse morphologique. Les systèmes Kimmo standard se composent d'un lexique en forme d'arborescence de caractères (trie) avec des sommets finals annotés d'information morphologique et un ensemble de transducteurs qui transcrivent les représentations lexicales en formes fléchies. Bienque ces systèmes soient supérieurs aux techniques an­térieures d'analyse morphologique "cut-and-paste", ils ont un certain nombre de désavantages: les formes lexicales sont souvent arbitraires et différentes des lemmes d'un dictionnaire normal; l'ana­lyse morphologique n'est pas encodée directement dans la forme lexicale. Le résultat est que la synthèse est souvent plus ardue que l'analyse et que les struc­tures ne sont pas optimales.</p><p>Les analyseurs morphologiques con­struits à Xerox-PARC pour le français et l'anglais se basent sur deux principles simples: 1. les formes fléchies d'un même mot se basent sur un même lemme; 2. les catégories morphologiques font partie intégrante de la forme lexicale. Ainsi les formes lexicales sont toujours des séquences de morphemes. Il est difficile d'achever ces deux résultats désirables dans le cadre d'une description classique à deux niveaux parce que la distance entre les formes lexicales et les formes de surface est longue et très difficile à décrire avec un seul ensemble de régies phonologiques à deux niveaux.</p><p>Il est possible de résoudre ces problèmes en exploitant d'une façon plus approfondie les principes de la phonologie à deux niveaux. En guise d'exemple, l'article décrit une cascade de règles à deux niveaux qui permet une description simple du pluriel des mots composés en français. La première série de règles insère des annotations de nombre et de genre après chaque élément de mots à pluriel double <i>(social-démocrate ~ sociaux-démo­</i><i>crates),</i><i> </i>la séconde série de règles détermine la réalisation du nombre et du genre réquise par les racines.</p><p>Les caractéristiques mathématiques des transducteurs réguliers sont bien connues. Elles permettent la combinaison de trans­ducteurs correspondant à des systèmes de règles à deux niveaux par composition et par intersection. Ainsi il est possible de réduire un système à niveaux multiples à un seul transducteur qui contrôle simul­tanément toutes les alternances morpho­logiques d'un langue. Vu que dans les lexiques anglais et français développés à Xerox toute l'information morphologique est codée directement avec le lemme, il est possible d'aller plus loin et de composer le lexique entier avec les règles. Le trans­ducteur résultant, un lexique à deux niveaux, transcrit les formes lexicales directement en formes de surface et vice versa. Les règles ne sont utilisées que dans la phase de construction. L'analyse et la synthèse ne font usage que du trans­ducteur lexical résultant.</p></references></body></article>