Lines Matching refs:CHECK
89 VLOG(1) << "Check destructive and delayed union are equivalent.";
93 CHECK(Equiv(U1, U2));
98 VLOG(1) << "Check destructive and delayed concatenation are equivalent.";
102 CHECK(Equiv(C1, C2));
105 CHECK(Equiv(C3, C2));
109 VLOG(1) << "Check destructive and delayed closure* are equivalent.";
113 CHECK(Equiv(C1, C2));
117 VLOG(1) << "Check destructive and delayed closure+ are equivalent.";
121 CHECK(Equiv(C1, C2));
125 VLOG(1) << "Check union is associative (destructive).";
135 CHECK(Equiv(U1, U4));
139 VLOG(1) << "Check union is associative (delayed).";
146 CHECK(Equiv(U2, U4));
151 VLOG(1) << "Check union is associative (destructive delayed).";
158 CHECK(Equiv(U1, U4));
162 VLOG(1) << "Check concatenation is associative (destructive).";
172 CHECK(Equiv(C1, C4));
176 VLOG(1) << "Check concatenation is associative (delayed).";
183 CHECK(Equiv(C2, C4));
187 VLOG(1) << "Check concatenation is associative (destructive delayed).";
194 CHECK(Equiv(C1, C4));
198 VLOG(1) << "Check concatenation left distributes"
213 CHECK(Equiv(C1, U2));
217 VLOG(1) << "Check concatenation right distributes"
231 CHECK(Equiv(C1, U2));
235 VLOG(1) << "Check concatenation left distributes over union (delayed).";
243 CHECK(Equiv(C1, U2));
247 VLOG(1) << "Check concatenation right distributes over union (delayed).";
255 CHECK(Equiv(C1, U2));
260 VLOG(1) << "Check T T* == T+ (destructive).";
269 CHECK(Equiv(C, P));
274 VLOG(1) << "Check T* T == T+ (destructive).";
283 CHECK(Equiv(C, P));
287 VLOG(1) << "Check T T* == T+ (delayed).";
293 CHECK(Equiv(C, P));
297 VLOG(1) << "Check T* T == T+ (delayed).";
303 CHECK(Equiv(C, P));
311 VLOG(1) << "Check destructive and delayed projection are equivalent.";
315 CHECK(Equiv(P1, P2));
320 VLOG(1) << "Check destructive and delayed inversion are equivalent.";
324 CHECK(Equiv(I1, I2));
328 VLOG(1) << "Check Pi_1(T) = Pi_2(T^-1) (destructive).";
334 CHECK(Equiv(P1, I1));
338 VLOG(1) << "Check Pi_2(T) = Pi_1(T^-1) (destructive).";
344 CHECK(Equiv(P1, I1));
348 VLOG(1) << "Check Pi_1(T) = Pi_2(T^-1) (delayed).";
352 CHECK(Equiv(P1, P2));
357 VLOG(1) << "Check Pi_2(T) = Pi_1(T^-1) (delayed).";
361 CHECK(Equiv(P1, P2));
366 VLOG(1) << "Check destructive relabeling";
391 CHECK(Equiv(R, T));
393 VLOG(1) << "Check on-the-fly relabeling";
397 CHECK(Equiv(RRdelay, T));
401 VLOG(1) << "Check encoding/decoding (destructive).";
411 CHECK(Equiv(D, T));
415 VLOG(1) << "Check encoding/decoding (delayed).";
425 CHECK(Equiv(D, T));
429 VLOG(1) << "Check gallic mappers (constructive).";
436 CHECK(Equiv(T, F));
440 VLOG(1) << "Check gallic mappers (delayed).";
447 CHECK(Equiv(T, F));
469 VLOG(1) << "Check composition is associative.";
476 CHECK(Equiv(C2, C4));
480 VLOG(1) << "Check composition left distributes over union.";
488 CHECK(Equiv(C1, U2));
492 VLOG(1) << "Check composition right distributes over union.";
500 CHECK(Equiv(C1, U2));
511 VLOG(1) << "Check intersection is commutative.";
514 CHECK(Equiv(I1, I2));
518 VLOG(1) << "Check all epsilon filters leads to equivalent results.";
528 CHECK(Equiv(C1, C2));
529 CHECK(Equiv(C1, C3));
539 VLOG(1) << "Check arc sorted Fst is equivalent to its input.";
542 CHECK(Equiv(T, S1));
546 VLOG(1) << "Check destructive and delayed arcsort are equivalent.";
550 CHECK(Equiv(S1, S2));
554 VLOG(1) << "Check ilabel sorting vs. olabel sorting with inversions.";
561 CHECK(Equiv(S1, S2));
565 VLOG(1) << "Check topologically sorted Fst is equivalent to its input.";
568 CHECK(Equiv(T, S1));
572 VLOG(1) << "Check reverse(reverse(T)) = T";
577 CHECK(Equiv(T, R2));
590 VLOG(1) << "Check connected FST is equivalent to its input.";
593 CHECK(Equiv(T, C1));
598 VLOG(1) << "Check epsilon-removed FST is equivalent to its input.";
601 CHECK(Equiv(T, R1));
603 VLOG(1) << "Check destructive and delayed epsilon removal"
606 CHECK(Equiv(R1, R2));
608 VLOG(1) << "Check an FST with a large proportion"
620 // Check that epsilon-removal preserves the shortest-distance
629 CHECK(ApproxEqual(w, w1, kTestDelta));
633 CHECK(ApproxEqual(w, w2, kTestDelta));
637 VLOG(1) << "Check determinized FSA is equivalent to its input.";
639 CHECK(Equiv(A, D));
644 VLOG(1) << "Check size(min(det(A))) <= size(det(A))"
649 CHECK(Equiv(D, M));
650 CHECK(M.NumStates() <= n);
656 VLOG(1) << "Check that Revuz's algorithm leads to the"
676 VLOG(1) << "Check reweight(T) equiv T";
684 CHECK(Equiv(T, RI));
687 CHECK(Equiv(T, RF));
691 VLOG(1) << "Check pushed FST is equivalent to input FST.";
696 CHECK(Equiv(T, P1));
700 CHECK(Equiv(T, P2));
704 CHECK(Equiv(T, P3));
711 CHECK(Equiv(T, P1));
715 CHECK(Equiv(T, P2));
718 CHECK(Equiv(T, P3));
723 VLOG(1) << "Check pruning algorithm";
725 VLOG(1) << "Check equiv. of constructive and destructive algorithms";
731 CHECK(Equiv(P1,P2));
735 VLOG(1) << "Check prune(reverse) equiv reverse(prune)";
744 CHECK(Equiv(P1, P2));
747 VLOG(1) << "Check: ShortestDistance(T- prune(T))"
759 CHECK(Plus(sum1, sum2) == sum1);
763 VLOG(1) << "Check synchronize(T) equiv T";
765 CHECK(Equiv(T, S));
777 VLOG(1) << "Check 1-best weight.";
782 CHECK(ApproxEqual(tsum, psum, kTestDelta));
786 VLOG(1) << "Check n-best weights";
805 CHECK(ApproxEqual(nsum, dsum, kTestDelta));
818 VLOG(1) << "Check FSTs for sanity (including property bits).";
819 CHECK(Verify(fst1));
820 CHECK(Verify(fst2));
917 VLOG(1) << "Check the union contains its arguments (destructive).";
921 CHECK(Subset(A1, U));
922 CHECK(Subset(A2, U));
926 VLOG(1) << "Check the union contains its arguments (delayed).";
929 CHECK(Subset(A1, U));
930 CHECK(Subset(A2, U));
934 VLOG(1) << "Check if A^n c A* (destructive).";
942 CHECK(Subset(C, S));
946 VLOG(1) << "Check if A^n c A* (delayed).";
955 CHECK(Subset(*C, S));
974 VLOG(1) << "Check the intersection is contained in its arguments.";
976 CHECK(Subset(I1, S1));
977 CHECK(Subset(I1, S2));
981 VLOG(1) << "Check union distributes over intersection.";
990 CHECK(Equiv(U1, I2));
1002 VLOG(1) << "Check S U S' = Sigma*";
1004 CHECK(Equiv(U, univ_fsa_));
1008 VLOG(1) << "Check S n S' = {}";
1010 CHECK(Equiv(I, zero_fsa_));
1014 VLOG(1) << "Check (S1' U S2') == (S1 n S2)'";
1020 CHECK(Equiv(U, C3));
1024 VLOG(1) << "Check (S1' n S2') == (S1 U S2)'";
1030 CHECK(Equiv(I, C3));
1037 VLOG(1) << "Check determinized FSA is equivalent to its input.";
1039 CHECK(Equiv(A, D));
1043 VLOG(1) << "Check minimized FSA is equivalent to its input.";
1050 CHECK(Equiv(A, M));
1055 VLOG(1) << "Check that Hopcroft's and Revuz's algorithms lead to the"
1073 VLOG(1) << "Check FSAs for sanity (including property bits).";
1074 CHECK(Verify(fsa1));
1075 CHECK(Verify(fsa2));
1102 // Check two equivalence tests match
1103 CHECK((equiv1 && equiv2) || (!equiv1 && !equiv2));
1110 VLOG(1) << "Check FSAs (incl. property bits) for sanity";
1111 CHECK(Verify(fsa1));
1112 CHECK(Verify(fsa2));
1246 VLOG(1) << "Check FST for sanity (including property bits).";
1247 CHECK(Verify(*fst));
