Using Ranked Semirings for Representing Morphology Automata

  • Thomas Hanneforth
Conference paper

DOI: 10.1007/978-3-642-04131-0_1

Part of the Communications in Computer and Information Science book series (CCIS, volume 41)
Cite this paper as:
Hanneforth T. (2009) Using Ranked Semirings for Representing Morphology Automata. In: Mahlow C., Piotrowski M. (eds) State of the Art in Computational Morphology. SFCM 2009. Communications in Computer and Information Science, vol 41. Springer, Berlin, Heidelberg

Abstract

We propose a class of complex weight structures called ranked semirings for the compact representation of morphological analysers based on weighted finite-state automata. In an experiment, we compare this compact representation with the conventional representation based on letter transducers.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Thomas Hanneforth
    • 1
  1. 1.Department for LinguisticsUniversity of PotsdamGermany

Personalised recommendations