📄 pfsg-format.html
字号:
<! $Id: pfsg-format.5,v 1.2 2004/02/27 03:34:36 stolcke Exp $><HTML><HEADER><TITLE>pfsg-format</TITLE><BODY><H1>pfsg-format</H1><H2> NAME </H2>pfsg-format - File format for Decipher(TM) probabilistic finite-state grammars<H2> SYNOPSIS </H2><B>name</B> <I>name</I><BR><B>nodes</B> <I>N</I> <I>w1</I> ... <I>wN</I><BR><B>initial</B> <I>i</I><BR><B>final</B> <I>f</I><BR><B>transitions</B> <I>T</I><BR><I>n1</I> <I>n2</I> <I>p</I><BR>...<H2> DESCRIPTION </H2>Probabilistic finite-state grammars (PFSGs) are a form of finite-stateautomaton or transducer used by the SRI Decipher(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.<P>Since it is usually fairly easy to convert between differentfinite-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<A HREF="fsm.html">fsm(5)</A>format.<P>Each PFSGs is given a<I>name</I>.<I></I>The name is significant if PFSGs are to be composed, in which case the<I> name </I>specifies the category it expands.<P>The<B> nodes </B>line gives the number of nodes in the state graph, followed by theword strings associated with each node.If the node represents a category expanded by another PFSG, then thename string of that PFSG is given here.The token<B> NULL </B>is special and designates the corresponding node as non-emitting.It is conventional to use lowercase strings for words, and uppercasefor categories and PFSG names (``NULL'' must be avoided, of course).<P>The<B> initial </B>and<B> final </B>lines specify the start and end states of the grammar, respectively.Nodes are numbered starting at zero.<P>The <B> transitions </B>line gives the number of arcs (transitions) between states.It is followed by as many lines, each specifying one transitionby its originating state<I>n1</I>,<I></I>its target state<I>n2</I>,<I></I>and the transition cost<I>p</I>.<I></I>The transition cost is usually interpreted as 10000.5 times the naturallogarithm of a probability, and should be normalized and scaledaccordingly.<H2> SEE ALSO </H2><A HREF="pfsg-scripts.html">pfsg-scripts(1)</A>, <A HREF="fsm.html">fsm(1)</A>.<H2> BUGS </H2>File formats are a matter of taste ...<BR>There is no way to specify words with embedded whitespace.<H2> AUTHOR </H2>PFSGs were developed as part of SRI's Decipher(TM) recognition system.Manual page written by Andreas Stolcke <stolcke@speech.sri.com>.<BR>Copyright 1999, 2004 SRI International</BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -