Jump to content

Morphological parsing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 119.95.157.206 (talk) at 10:39, 27 June 2008 (spelled out FST). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The goal of morphological parsing is to find out what morphemes a given word is built from. It should be able to distinguish between orthographic rules and morphological rules. For example, the word 'foxes' can be decomposed into 'fox' (the stem), and 'es' (a suffix indicating plurality).

The generally accepted approach to morphological parsing is through a FST (finite state transducer) that inputs words and outputs their stem and modifiers. This FST is initially created through algorithmic parsing of some word source, such as a dictionary complete with modifier markups.

Another approach is an indexed lookup through a constructed Radix tree. This is not an often-taken route because it breaks down for morphologically complex languages.