dictinary − convert dictionary to FSA (Finite State Playground) |
dictionary filename |
The dictionary program creates an FSA from a list of words, returning an XML representation of the FSA. The FSA is not determinized and contains epsilon-arcs. The filename is a text file containing a column of words. The characters making up the words are the same as those accepted by the re program. This program runs fine with toy dictionaries, but is exponentially slower with larger dictionaries. |
The XML syntax is quite simple. An FSA is represented as a net object which is composed of a series of fsanode objects, each of which encodes a separate state in the FSA. Whether the state is a start and/or a final state is encoded with attributes. Arcs between states are represented as arc objects within the fsanode objects, with attributes indicating what the arc symols are and what the destination states are. The full syntax is encoded in the fsanet.dtd file. |
fsp(1) |
http://www.u.arizona.edu/~hammond/ |
Author’s home page |
flbi/src/ |
Distribution source code |
||
flbi/xml/fsanet.dtd |
DTD file for XML specification of FSAs |
||
flbi/man/dictionary.1 |
This man file |
Mike Hammond (hammond@u.arizona.edu) Copyright (C) 2007. All rights reserved. |