English / Japanese
Open source multi-purpose LVCSR engine
% julius [-C jconffile] [options...]
julius is a high-performance, multi-purpose, open-source speech recognition engine for researchers and developers. It is capable of performing almost real-time recognition of continuous speech with over 60k-word 3-gram language model and triphone HMM model, on most current PCs.
julius can perform recognition on audio files, live microphone input, network input and feature parameter files.
Recognition algorithm of
julius is based on a two-pass strategy. Word 2-gram and reverse word 3-gram is used on the respective passes. The entire input is processed on the first pass, and again the final searching process is performed again for the input, using the result of the first pass to narrow the search space. Specifically, the recognition algorithm is based on a tree-trellis heuristic search combined with left-to-right frame-synchronous beam search and right-to-left stack decoding search.
When using context dependent phones (triphones), interword contexts are taken into consideration. For tied-mixture and phonetic tied-mixture models, high-speed acoustic likelihood calculation is possible using gaussian pruning.
For more details, see the related documents.
julius needs a language model and an acoustic model to run as a speech recognizer.
julius supports the following models.
Sub-word HMM (Hidden Markov Model) in HTK ascii format are supported. Phoneme models (monophone), context dependent phoneme models (triphone), tied-mixture and phonetic tied-mixture models of any unit can be used. When using context dependent models, inter-word context dependency is also handled. Multi-stream feature and MSD-HMM is also supported. You can further use a tool mkbinhmm to convert the ascii HMM file to a compact binary format for faster loading.
julius itself can only extract MFCC features from speech data. If you use acoustic HMM trained for other feature, you should
give the input in HTK parameter file of the same feature type.
Word N-gram LM
Word N-gram language model, up to 10-gram, is supported.
julius uses different N-gram for each pass: left-to-right 2-gram on 1st pass, and right-to-left N-gram on 2nd pass. It is recommended to use both LR 2-gram and RL N-gram for
julius. However, you can use only single LR N-gram or RL N-gram. In such case, approximated LR 2-gram computed from the given N-gram will be applied at the first pass.
The Standard ARPA format is supported. In addition, a binary format is also supported for efficiency. The tool mkbingram(1) can convert ARPA format N-gram to binary format.
julius's grammar format is an original one, and tools to create a recognirion grammar are included in the distribution. A grammar consists of two files: one is a 'grammar' file that describes sentence structures in a BNF style, using word 'category' name as terminate symbols. Another is a 'voca' file that defines words with its pronunciations (i.e. phoneme sequences) for each category. They should be converted by mkdfa.pl(1) to a deterministic finite automaton file (.dfa) and a dictionary file (.dict), respectively. You can also use multiple grammars.
isolated word LM
You can perform isolated word recognition using only word dictionary. With this model type,
julius will perform rapid one pass recognition with static context handling. Silence models will be added at both head and tail of each word. You can also use multiple dictionaries in a process.
Julius has autoconf-based auto configuration script. See the "INSTALL.txt" in the source archive for defailed instruction.
Start recognition with a config file
% julius -C foobar.jconf
All parameters are made configurable, so Julius has over 100 options! The full list of the options are described in Options.md
device name string for ALSA (default: "default")
device name string for OSS (default: "/dev/dsp")
With portaudio, index of capture device to use. The available devices will be listed at startup.
Input latency of microphone input in milliseconds. Smaller value will shorten latency but sometimes make process unstable. Default value will depend on the running OS.
Julius is mainly developed and maintained by Akinobu LEE (Kyoto University, now at Nagoya Institute of Technology). The base algorithm and the name "Julius" was given by Tatsuya Kawahara (Kyoto University).
Many researchers having been engaged in using and developing Julius by giving great ideas, comments and suggestions. Also thanks to all the contributors from speech recognition society and many developers in GitHub!
This tool is licensed under the same license with Julius - see the license term of Julius for defails.