Lines Matching full:graph
40 - WORDGRAPH(NA,NA)graph
60 - WORDGRAPH(POSes,NA)graph
61 - graph not in lex, POSes determined with dtree, or
62 - graph in lex - single entry without phone (:G2P), POSes from lex
64 - graph in lex - {1,4} entries with phone, pos1...posN from lex,
76 - graph, len>0, utf8 graphemes, %s
85 - POS GRAPH PHON, all mandatory, but
88 - (POS,GRAPH) is a uniq key (only one entry allowed)
89 - (GRAPH) is almost a uniq key (2-4 entries with the same GRAPH, and
91 - for one graph we can have 2-4 solutions from the lex which all
93 - in this case GRAPH, POS, and PHON all must be available in lex
