Compiling Generalized Two-Level Rules and Grammars
New methods to compile morphophonological two-level rules into finite-state machines are presented. Compilation of the original and new two-level rules and grammars is formulated using an operation called the generalized restriction that constructs a one-tape finite-state automaton over an input alphabet of symbol pairs.
The generalized restriction is first used to compile the original two-level formalism where the rules were restricted to single symbol pairs as their centers (i.e. the left-hand sides of the rules). The solution handles also strings of symbol pairs (or regular expressions over the pair alphabet) as centers of two-level rules. Then, the treatment of context conditions is generalized with unions and relative complements etc. Moreover, an extended rule type, the presence requirement, combines the generalized context conditions with center conditions at both sides of the rules. The left-hand side specifies where the rule applies and the right-hand side specifies which of the applications are successful.
The original two-level grammars were represented as a separate finite-state machine for each rule and the whole grammar as their intersection. The new methods are used first to redefine this setup, and then to implement a uniform conflict resolution scheme for all rules. The resolution scheme prefers successful and the longest embedded applications of rules, but it treats partially overlapping or explicitly independent applications of rules conjunctively. The composite rules of the original formalism have a marginal status in the new formalism because only identity pairs are allowed in locations where no rule is applicable.
KeywordsRegular Expression Context Condition Identity Pair Input Alphabet Phonological Rule
Unable to display preview. Download preview PDF.
- 1.Yli-Jyrä, A.M., Koskenniemi, K.: Compiling contextual restrictions on strings into finite-state automata. In: Cleophas, L., Watson, B.W., (eds.) The Eindhoven FASTAR Days, Proceedings. Number 04/40 in Computer Science Reports, Eindhoven, The Netherlands, Technische Universiteit Eindhoven (2004), http://www.ling.helsinki.fi/~aylijyra/dissertation/7.pdf
- 2.Koskenniemi, K.: Two-level morphology: a general computational model for word-form recognition and production. Number 11 in Publications. Department of General Linguistics, University of Helsinki, Helsinki (1983)Google Scholar
- 3.Karttunen, L., Koskenniemi, K., Kaplan, R.M.: A compiler for two-level phonological rules. Report CSLI-87-108, Center for Study of Language and Information, Stanford University, CA (1987)Google Scholar
- 4.Karttunen, L., Beesley, K.R.: Two-level rule compiler. Technical Report ISTL-92-2, Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California (1992), www.xrce.xerox.com/competencies/content-analysis/fssoft/docs/twolc-92/twolc92.html
- 5.Karttunen, L., Beesley, K.R.: Two-level rule compiler. An additional documentation file on the CD-ROM supplement of Beesley and Karttunen (March 5, 2003)Google Scholar
- 6.Beesley, K.R., Karttunen, L.: Finite State Morphology. In: CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003)Google Scholar
- 7.Karttunen, L.: Constructing lexical transducers. In: Proceedings of the Conference 15th COLING 1994, Kyoto, Japan, vol. 1, pp. 406–411 (1994), http://acl.ldc.upenn.edu/C/C94/C94-1066.pdf
- 9.Bear, J.: A morphological recognizer with syntactic and phonological rules. In: Proceedings of the Conference 11th COLING 1986, Bonn, Germany, pp. 272–276 (1986), http://acl.ldc.upenn.edu/C/C86/C86-1065.pdf
- 10.Bear, J.: Backwards phonology. In: Proceedings of the Conference 13th COLING 1990, vol. 3, pp. 13–20 (1990), http://acl.ldc.upenn.edu/C/C90/C90-3003.pdf
- 11.Kempe, A., Karttunen, L.: Parallel replacement in finite state calculus. In: Proceedings of the Conference 16th COLING 1996, Copenhagen, Denmark, vol. 2, pp. 622–627 (1996), http://arxiv.org/abs/cmp-lg/9607007