Lemma v0.1.1 Lemma.MorphParserGenerator View Source
Functions for generating finite state transducer from a massive sets of rules.
Link to this section Summary
Functions
Given a finite state transducer fst a list of rules, produce a new fst that incorporate these rules
Given a finite state transducer fst, a list of words and a list of suffix rules; produce a new fst that incorporate these suffix rules for each of the word
Link to this section Functions
Given a finite state transducer fst a list of rules, produce a new fst that incorporate these rules
Given a finite state transducer fst, a list of words and a list of suffix rules; produce a new fst that incorporate these suffix rules for each of the word.