BIGRAM SEARCH: GOOD COMPROMISE BETWEEN PERFORMANCE AND COMPLEXITY
- A bigram search is still relatively simple:
- A bigram search requires expand and merge:
The search complexity can be N2 with a backoff model
(if any word can follow an other word).
- We can reduce the complexity of a bigram search with backoffs
by using a dynamic expansion:
