pfsg-format.5

这是一款很好用的工具包

pfsg-format(5)                                     pfsg-format(5)



NNAAMMEE
       pfsg-format  -  File format for Decipher(TM) probabilistic
       finite-state grammars

SSYYNNOOPPSSIISS
       nnaammee _n_a_m_e
       nnooddeess _N _w_1 ... _w_N
       iinniittiiaall _i
       ffiinnaall _f
       ttrraannssiittiioonnss _T
       _n_1 _n_2 _p
       ...

DDEESSCCRRIIPPTTIIOONN
       Probabilistic finite-state grammars (PFSGs) are a form  of
       finite-state automaton or transducer used by the SRI Deci-
       pher(TM) recognizer.  PFSGs emit words  (outputs)  at  the
       nodes,  not on the arcs.  Certain types of language models
       manipulated by SRILM can  be  translated  into  PFSGs  for
       direct use in the recognizer.

       Since it is usually fairly easy to convert between differ-
       ent finite-state network representations, PFSGs can  serve
       as  an  intermediate  format  for  the generation of other
       finite-state formats.  For example, PFSGs can be converted
       to the AT&T ffssmm(5) format.

       Each  PFSGs  is  given a _n_a_m_e.  The name is significant if
       PFSGs are to be composed, in which case the _n_a_m_e specifies
       the category it expands.

       The  nnooddeess  line  gives  the  number of nodes in the state
       graph, followed by the word strings associated  with  each
       node.   If  the  node  represents  a  category expanded by
       another PFSG, then the name string of that PFSG  is  given
       here.  The token NNUULLLL is special and designates the corre-
       sponding node as non-emitting.  It is conventional to  use
       lowercase  strings for words, and uppercase for categories
       and PFSG names (``NULL'' must be avoided, of course).

       The iinniittiiaall and ffiinnaall lines  specify  the  start  and  end
       states  of  the grammar, respectively.  Nodes are numbered
       starting at zero.

       The ttrraannssiittiioonnss line gives the  number  of  arcs  (transi-
       tions)  between  states.  It is followed by as many lines,
       each specifying one transition by  its  originating  state
       _n_1,  its  target state _n_2, and the transition cost _p.  The
       transition cost is usually interpreted  as  10000.5  times
       the natural logarithm of a probability, and should be nor-
       malized and scaled accordingly.

SSEEEE AALLSSOO
       pfsg-scripts(1), fsm(1).

BBUUGGSS
       File formats are a matter of taste ...
       There is no way to specify words with embedded whitespace.

AAUUTTHHOORR
       PFSGs  were developed as part of SRI's Decipher(TM) recog-
       nition system.  Manual page  written  by  Andreas  Stolcke
       <[e-mail]>.
       Copyright 1999, 2004 SRI International



SRILM File Formats $Date: 2004/02/27 03:34:36 $    pfsg-format(5)