julian.txt

about sound recognition.i want to downlod

              The possibility that the optimum hypothesis is  correctly  found
              increases  as this value gets increased, but the processing time
              also becomes longer.

              Default value depends on the  engine setup on compilation time:
                10  (standard)
                 1  (fast, v2.1)

       -output N
              The top N sentence hypothesis will  be  Output  at  the  end  of
              search.  Use with "-n" option. (default: 1)

       -cmalpha float
              This  parameter decides smoothing effect of word confidence mea-
              sure.  (default: 0.05)

       -sb score
              Score envelope width for enveloped  scoring.   When  calculating
              hypothesis  score  for  each  generated  hypothesis, its trellis
              expansion and viterbi operation will be pruned in the middle  of
              the speech if score on a frame goes under [current maximum score
              of the frame- width].  Giving small value makes the second  pass
              faster, but computation error may occur.  (default: 80.0)

       -s stack_size
              The maximum number of hypothesis that can be stored on the stack
              during the search.  A larger value may give more stable results,
              but increases the amount of memory required. (default: 500)

       -m overflow_pop_times
              Number  of  expanded  hypotheses  required  to  discontinue  the
              search.  If the number of expanded hypotheses  is  greater  then
              this  threshold  then, the search is discontinued at that point.
              The larger this value is, The longer  Julius  gets  to  give  up
              search (default: 2000)

       -lookuprange nframe
              When  performing  word expansion on the second pass, this option
              sets the number of frames before and after to look up next  word
              hypotheses  in  the word trellis.  This prevents the omission of
              short words, but with a large  value,  the  number  of  expanded
              hypotheses increases and system becomes slow. (default: 5)

       -looktrellis
              Expand  only  the  words  survived  on the first pass instead of
              expanding all the words predicted by grammar.  This option makes
              second pass decoding slightly faster especially for large vocab-
              ulary condition, but may increase deletion error of short words.
              (default: disabled)

   Graph Output
       -graphrange nframe
              When  graph  output  is  enabled (--enable-graphout), merge same
              words at neighbor position.  If the position of same words  dif-
              fers  smaller than this value, they will be merged.  The default
              is 0 (allow merging on exactly the same location) and specifying
              larger value will result in smaller graph output.  Setting to -1
              will disable merging, in that case same words on the same  loca-
              tion of different scores will be left as they are. (default: 0)

       -graphcut depth
              Cut  the  resulting  graph  by its word depth at post-processing
              stage.  The depth value is the number of words to be allowed  at
              a frame.  Setting to -1 disables this feature. (default: 80)

       -graphboundloop num
              Limit  the number of boundary adjustment loop at post-processing
              stage. This parameter prevents Julius from blocking by  infinite
              adjustment loop by short word oscillation.  (default: 20)

       -graphsearchdelay

       -nographsearchdelay
              When  "-graphsearchdelay"  option  is  set,  Julius modifies its
              graph generation alogrithm on the  2nd  pass  not  to  terminate
              search  by  graph merging, until the first sentence candidate is
              found.  This option may improve graph accuracy, especially  when
              you  are  going  to  generate a huge word graph by setting broad
              search.  Namely, it may result in better graph accuracy when you
              set  wide  beams  on  both 1st pass "-b" and 2nd pass "-b2", and
              large number for "-n".  (default: disabled)

   Forced Alignment
       -walign
              Do viterbi alignment per word units from the recognition result.
              The  word  boundary  frames  and the average acoustic scores per
              frame are calculated.

       -palign
              Do viterbi alignment per phoneme (model) units from the recogni-
              tion result.  The phoneme boundary frames and the average acous-
              tic scores per frame are calculated.

       -salign
              Do viterbi alignment per HMM state from the recognition  result.
              The  state  boundary  frames and the average acoustic scores per
              frame are calculated.

   Server Module Mode
       -module [port]
              Run Julian on "Server Module Mode".  After startup, Julian waits
              for  tcp/ip  connection  from client.  Once connection is estab-
              lished, Julian start communication with the  client  to  process
              incoming  commands  from  the  client,  or to output recognition
              results, input trigger information and other  system  status  to
              the  client.   The  multi-grammar mode is only supported at this
              Server Module Mode.  The default port number is 10500.  jcontrol
              is sample client contained in this package.

       -outcode [W][L][P][S][C][w][l][p][s]
              (Only for Server Module Mode) Switch which symbols of recognized
              words to be sent to client.  Specify 'W' for output symbol,  'L'
              for  grammar entry, 'P' for phoneme sequence, 'S' for score, and
              'C' for confidence score, respectively.  Capital letters are for
              the  second  pass  (final  result),  and  small  letters are for
              results of the first pass.  For example, if  you  want  to  send
              only  the  output  symbols  and phone sequences as a recognition
              result to a client, specify "-outcode WP".

   Message Output
       -multigramout
              Enable multiple grammar output.  Usually, Julian will search for
              the  best  hypothesis  among  the  grammars.   This options will
              change the search to find the best result one by  one  for  each
              grammar.

       -quiet Omit  phoneme  sequence  and  score,  only  output the best word
              sequence hypothesis.

       -progout
              Enable progressive output of the partial results  on  the  first
              pass.

       -proginterval msec
              set the output time interval of "-progout" in milliseconds.

       -demo  Equivalent to "-progout -quiet"

       -charconv from to
              Enable  output  character  set  conversion. "from" is the source
              character set used in the language model, and "to" is the target
              character set you want to get.
              On  Linux,  the arguments should be a code name.  You can obtain
              the list of available code names by invoking the command  "iconv
              --list".   On  Windows,  the  arguments should be a code name or
              codepage number.  Code name should  be  one  of  "ansi",  "mac",
              "oem",  "utf-7", "utf-8", "sjis", "euc".  Or you can specify any
              codepage number supported at your environment.

   OTHERS
       -debug (For debug) output enoumous internal status and  debug  informa-
              tion.

       -C jconffile
              Load  the  jconf  file.   The  options  written  in the file are
              included and expanded at the point.  This  option  can  also  be
              used within other jconf file.

       -check wchmm
              (For  debug)  turn  on  interactive  check  mode of tree lexicon
              structure at startup.

       -check triphone
              (For debug) turn on interactive  check  mode  of  model  mapping
              between Acoustic model, HMMList and dictionary at startup.

       -setting
              Display compile-time engine configuration and exit.

       -help  Display a brief description of all options.

EXAMPLES
       For  examples  of  system  usage,  refer to the tutorial section in the
       Julian documents.

NOTICE
       Note about jconf files: relative paths in a jconf file are  interpreted
       as relative to the jconf file itself, not to the current directory.

SEE ALSO
       julius(1),  jcontrol(1), adinrec(1), adintool(1), mkdfa(1), mkbinhmm(1)
       mkgsmm(1), wav2mfcc(1), mkss(1)

       http://julius.sourceforge.jp/en/

DIAGNOSTICS
       Julian normally will return the exit status 0.   If  an  error  occurs,
       Julian exits abnormally with exit status 1.  If an input file cannot be
       found or cannot be loaded for some reason then Julian  will  skip  pro-
       cessing for that file.

BUGS
       There  are  some restrictions to the type and size of the models Julian
       can use.  For a detailed explanation refer to the Julius documentation.
       For    bug-reports,    inquires    and    comments    please    contact
       julius-info at lists.sourceforge.jp.

COPYRIGHT
       Copyright (c) 1991-2006 Kawahara Lab., Kyoto University
       Copyright (c) 2000-2005 Shikano Lab., Nara  Institute  of  Science  and
       Technology
       Copyright  (c) 2005-2006 Julius project team, Nagoya Institute of Tech-
       nology

AUTHORS
       Rev.1.0 (1998/07/20)
              Designed by Tatsuya KAWAHARA and Akinobu LEE (Kyoto University)

       Rev.2.0 (1999/02/20)

       Rev.2.1 (1999/04/20)

       Rev.2.2 (1999/10/04)

       Rev.3.1 (2000/05/11)
              Development of above versions by Akinobu LEE (Kyoto University)

       Rev.3.2 (2001/08/15)

       Rev.3.3 (2002/09/11)

       Rev.3.4 (2003/10/01)

       Rev.3.4.1 (2004/02/25)

       Rev.3.4.2 (2004/04/30)
              Development of above versions by Akinobu LEE (Nara Institute  of
              Science and Technology)

       Rev.3.5 (2005/11/11)

       Rev.3.5.1 (2006/03/31)

       Rev.3.5.2 (2006/07/31)
              Development  of  above versions by Akinobu LEE (Nagoya Institute
              of Technology)

THANKS TO
       From rev.3.2, Julian is released to the member of the "Information Pro-
       cessing  Society,  Continuous Speech Consortium".  From rev.3.4, Julian
       becomes an open-source products incorporated with Julius.

       The Windows Microsoft Speech API compatible version  was  developed  by
       Takashi SUMIYOSHI (Kyoto University).



4.3 Berkeley Distribution            LOCAL                           JULIAN(1)