Paper: Compounding And Derivational Morphology In A Finite-State Setting

ACL ID P03-1025
Title Compounding And Derivational Morphology In A Finite-State Setting
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2003
Authors
  • Jonas Kuhn (University of Texas at Austin, Austin TX)

This paper proposes the application of finite-state approximation techniques on a unification-based grammar of word for- mation for a language like German. A refinement of an RTN-based approxima- tion algorithm is proposed, which extends the state space of the automaton by se- lectively adding distinctions based on the parsing history at the point of entering a context-free rule. The selection of history items exploits the specific linguistic nature of word formation. As experiments show, this algorithm avoids an explosion of the size of the automaton in the approxima- tion construction. 1 The locus of word formation rules in grammars for NLP In English orthography, compounds following pro- ductive word formation patterns are spelled with spaces or hyphens separating the components (e.g. ,...