ICS3 Exam Study Guide: - Toronto District School Board

2002-12-06 · The key is simply a Python tuple of strings. (*, *) -> the=1 (*, the) brown=1 (the, brown) dog=.5, fox=.5 (brown, dog) jumps=1 (dog, jumps) over=1 (jumps, over) the=1 (over, the) brown=1 (brown, fox) .=1. However, this approach was more useful when n was small. A different implementation was used in order to generalize the algorithm for n-grams of n > 3. A tree of initial n - 1 words was used ... ................
................