Proceedings of the Workshop on Software - Software '05 2005
DOI: 10.3115/1626315.1626323
|View full text |Cite
|
Sign up to set email alerts
|

xfst2fsa

Abstract: This paper introduces xfst2fsa, a compiler which translates grammars expressed in the syntax of the XFST finite-state toolbox to grammars in the language of the FSA Utilities package. Compilation to FSA facilitates the use of grammars developed with the proprietary XFST toolbox on a publicly available platform. The paper describes the non-trivial issues of the compilation process, highlighting several shortcomings of some published algorithms, especially where replace rules are concerned. The compiler augments… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2008
2008

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…In particular, we chose XFST, as it is one of the most efficient and certainly the most expressive FST toolbox available. A recent comparison of XFST with the FSA Utilities package (Cohen-Sygal and Wintner 2005) shows that the latter simply cannot handle grammars of the scale of HAMSAH. All experiments were done on a dual 2-GHz processor Linux machine with 2.5 Gb of memory.…”
Section: Comparison and Evaluationmentioning
confidence: 99%
“…In particular, we chose XFST, as it is one of the most efficient and certainly the most expressive FST toolbox available. A recent comparison of XFST with the FSA Utilities package (Cohen-Sygal and Wintner 2005) shows that the latter simply cannot handle grammars of the scale of HAMSAH. All experiments were done on a dual 2-GHz processor Linux machine with 2.5 Gb of memory.…”
Section: Comparison and Evaluationmentioning
confidence: 99%