| 155 | } |
| 156 | |
| 157 | LevenshteinDFA BuildLevenshteinDFA(UniString const & s) |
| 158 | { |
| 159 | ASSERT(!s.empty(), ()); |
| 160 | // In search we use LevenshteinDFAs for fuzzy matching. But due to |
| 161 | // performance reasons, we limit prefix misprints to fixed set of substitutions defined in |
| 162 | // kAllowedMisprints and skipped letters. |
| 163 | return LevenshteinDFA(s, 1 /* prefixSize */, kAllowedMisprints, GetMaxErrorsForToken(s)); |
| 164 | } |
| 165 | |
| 166 | LevenshteinDFA BuildLevenshteinDFA_Category(UniString const & s) |
| 167 | { |