„Szabad forráskódú morfológiai analizátorok összehasonlítása angolul” változatai közötti eltérés

Innen: Programozás Wiki
Ugrás a navigációhozUgrás a kereséshez
30. sor: 30. sor:
 
Hfst is a lexc/twolc implementation with some additional tools, that needs an underlying fst automaton like openfst, sfst or foma.
 
Hfst is a lexc/twolc implementation with some additional tools, that needs an underlying fst automaton like openfst, sfst or foma.
 
   
 
   
Since hfst supports  twolc, an obsolete xerox tool, instead of xfst, the more current version, its usefulness is questionable. Documentation of hfst is poor, it does not contain any full, working morphology example. Its usage with foma is questionable, since foma is based on more modern xfst/lexc pair. Support of sfst is half-hearted, for example the faroese lexc file can not be compiled using sfst as format. Hfst is not capable to show the intermediate format for sfst, just an internal binary hfst format. Hfst usage might make sense in connection with the also underdocumented openfst.
+
Since hfst supports  twolc, an obsolete xerox tool, instead of xfst, the more current version, its usefulness is questionable. Documentation of hfst is poor, it does not contain any full, working morphology example. Its usage with foma is questionable, since foma is based on the more modern xfst/lexc pair. Support of sfst is half-hearted, for example the faroese lexc file can not be compiled using sfst as format. Hfst is not capable to show the intermediate format for sfst, just an internal binary hfst format. Hfst usage might make sense in connection with the also underdocumented openfst.
  
 
==Links==
 
==Links==

A lap 2012. február 4., 23:33-kori változata

Comparison of foma and sfst

FeatureFomaSFST
DocumentationGoodGood
InstallationSimpleSimple
UsageWell documented, easyWell documented, easy
Morphological analysisWell documentedWell documented
Detailed documentationFsmbook applies 100% to fomaNot available
Internal naming Strict rules, almost only alphabetic chars are allowed, easy reading and syntax checkAlmost all characters are allowed. Can cause hard to read programs, also syntax check is hard due to this permissiveness
Regular expression facilitiesRich (for example .#. means begin of word)Basic
Code readabilityGoodSomewhat reduced due to requirement of using multiple alphabets and extremely permissive internal naming
Code inclusionNot availableEasy, using #include
Word list in extra fileNot possibleEasy, using lex files
Variable over and underdefinitionNicely handled, intuitiveSomewhat cumbersome handling, requires additional user tools
Multiple stem words handlingEasy and intuitiveSomewhat cumbersome
Agreement variablesNot availableAvailable
DebuggingGood, detailed informationGood, detailed information
Built in syntax checkingGoodPoor
Result evaluationGoodExcellent, using fst-generate
Support from authorGoodGood

Other available free tools

Openfst and hfst.

Openfst is a complete fst implementation. Documentation lacks morphology handling, therefore this tool is not for first morphology implementations.

Hfst is a lexc/twolc implementation with some additional tools, that needs an underlying fst automaton like openfst, sfst or foma.

Since hfst supports twolc, an obsolete xerox tool, instead of xfst, the more current version, its usefulness is questionable. Documentation of hfst is poor, it does not contain any full, working morphology example. Its usage with foma is questionable, since foma is based on the more modern xfst/lexc pair. Support of sfst is half-hearted, for example the faroese lexc file can not be compiled using sfst as format. Hfst is not capable to show the intermediate format for sfst, just an internal binary hfst format. Hfst usage might make sense in connection with the also underdocumented openfst.

Links