BOSS_Morphemes_DE Class Reference
[BOSS Transcription Module]

#include <boss_morphemes_de.h>

List of all members.

Public Member Functions
	BOSS_Morphemes_DE (BOSS::Config &cl, MySQL_Handler *data_base)
	~BOSS_Morphemes_DE ()
string	operator() (const string &word) const
Private Member Functions
t_SSPairVector	selectLong (t_SubStringEntryDList &slist) const
bool	is_vowel (const string &phone) const
void	maximum_onset (BOSS::t_SVector &coda, t_SDeque &onset) const
string	t_SVector_to_string (const BOSS::t_SVector &v) const
BOSS::t_SVector	try_parse (const string &phones) const
t_SSPairVector	join_stems (const t_SSPairVector &trans) const
BOSS::t_SVector	syllable_border (const t_SSPairVector &joined_trans) const
BOSS::t_SVector	morpheme_border (const t_SSPairVector &joined_trans, const BOSS::t_SVector &syl_chain) const
BOSS::t_SVector	apply_morphonology (const t_SSPairVector &trans, const BOSS::t_SVector &final_trans) const
Private Attributes
BOSS::Config &	cl
MySQL_Handler *	data_base
BOSS::FSA *	pfsa
BOSS_MorphemeLexicon_DE	lexicon

---

Detailed Description

Author:

Karlheinz Stoeber In this application the term morph is used in a slightly different way than the defintion of a morpheme, because in some cases we are using a concatenation of morphemes instead of single morphemes. This is very important for the selection mechanism This class uses a lexicon to create a graph which contains all possible morpheme that can be used to concatenate the word. Then a unique solution is searched in this graph. A unique solution is a path which defines a set of morphemes. The concatenation of all morpheme nodes must be identical to the word used as input. The selection criteria are: Select the paths with the minimal number of morphemes Select the paths where the multiplication of the numbers of morpheme characters is minimal Select the path where the multiplication of the number of morpheme characters multiplied by the morpheme position is minimal

Joerg Broeggelwirth By concatenating morphs new syllable boundaries occur. These boundaries are basically determined by the maximum onset principle. Moreover, the algorithms deal with the necessary morphophonological processes, e.g. "Auslautverhärtung" (final devoicing).

---

Member Function Documentation

string BOSS_Morphemes_DE::t_SVector_to_string (  const BOSS::t_SVector &  v  )  const [inline, private]

---

Member Data Documentation

BOSS::Config& BOSS_Morphemes_DE::cl [private]

MySQL_Handler* BOSS_Morphemes_DE::data_base [private]

BOSS_MorphemeLexicon_DE BOSS_Morphemes_DE::lexicon [private]

BOSS::FSA* BOSS_Morphemes_DE::pfsa [private]

---

The documentation for this class was generated from the following files:

• boss_morphemes_de.h
• boss_morphemes_de.cpp

---