grammar rule 0.0032671270000000003
new grammar 0.002921089
dynamic grammar 0.002891451
grammar compilation 0.002878643
grammar nonterminals 0.002848232
example grammar 0.0028310930000000002
input grammar 0.002822845
grammar con 0.002809644
grammar tools 0.0026804330000000003
grammar configuration 0.002677726
put grammar 0.002654631
grammar mechanisms 0.002652073
date grammar 0.002643987
grammar ules 0.002642432
grammar com 0.002641936
namic grammar 0.0026414990000000003
grammar changes 0.0026414900000000002
location grammar 0.002639341
unrestricted grammar 0.002639341
grammar 0.00238548
weighted language 0.0016294389999999999
weighted grammars 0.001555203
other speech 0.0014217119999999999
dynamic rule 0.0013876180000000002
weighted automaton 0.0013556129999999999
dynamic grammars 0.001306963
weighted automata 0.0012955900000000001
regular language 0.001285853
speech recognition 0.0012253
language processing 0.001221173
language models 0.001221143
new algorithm 0.001212504
rule probabilities 0.001205832
other information 0.001197369
appropriate grammars 0.001194167
weighted cfg 0.001183621
recognition applications 0.001173421
compilation algorithm 0.0011700579999999999
general algorithm 0.00115978
weighted transducer 0.001155699
other areas 0.0011468609999999999
other recursively 0.0011468609999999999
linear grammars 0.0011386270000000001
rule acti 0.0011366570000000001
language gener 0.001136209
compilation step 0.001090384
many speech 0.001079001
vocabulary model 0.00107438
nonterminal symbol 0.001071037
nonterminal symbols 0.001069654
namic grammars 0.001057011
allowed grammars 0.0010548620000000002
tion rules 0.00105234
weighted cfgs 0.001048784
same way 0.001040357
recognition models 0.001039648
simple automaton 0.0010385260000000001
rammar rules 0.001030136
recognition hypotheses 0.00102685
ofour algorithm 0.001026215
weighted substitution 0.001019529
transformation algorithm 0.001017413
weighted automa 0.0010166469999999999
weighted transducers 0.00101286
weighted transduc 0.001008084
weighted eterminization 0.001008084
recognition sys 9.94652E-4
recognition hypothesis 9.80315E-4
input string 9.78899E-4
tion algorithm 9.78418E-4
ofthe algorithm 9.724709999999999E-4
same states 9.700889999999999E-4
compilation time 9.686849999999999E-4
standard methods 9.50717E-4
recognition compo 9.495809999999999E-4
finite automaton 9.487359999999999E-4
uating recognition 9.48363E-4
peech recognition 9.48363E-4
main compilation 9.46164E-4
cient algorithm 9.325359999999999E-4
pilation algorithm 9.313689999999999E-4
lazy automata 9.295880000000001E-4
cabulary model 9.275010000000001E-4
general case 9.26686E-4
acoustic model 9.23064E-4
cfg compilation 9.225730000000001E-4
case time 9.19323E-4
general cfg 9.12295E-4
finite set 9.073130000000001E-4
corresponding automata 8.885400000000001E-4
lazy compilation 8.813720000000001E-4
compilation condition 8.800030000000001E-4
language 8.75228E-4
word sequence 8.72903E-4
final state 8.70221E-4
terminal symbol 8.60354E-4
initial state 8.59975E-4
terminal symbols 8.58971E-4
dependency graph 8.448360000000001E-4
transducer representation 8.44441E-4
