| No | Pattern | Freq | Relations |
|---|---|---|---|
| 1 | [vb mod] [vb infin] there be a | 85 |
|
| 2 | [vb mod] [vb infin] [ex0] be a | 78 |
|
| 3 | [vb mod] [vb infin] [ex0] 's a | 35 |
|
| 4 | [vb mod] [vb infin] [ex0] was a | 23 |
|
| 5 | [vb mod] [vb infin] [ex0] is a | 20 |
|
| 6 | [vb mod] see [ex0] be a | 16 |
|
| 7 | can [vb infin] [ex0] be a | 15 |
|
| 8 | [vb mod] say [ex0] be a | 15 |
|
| 9 | would [vb infin] [ex0] be a | 14 |
|
| 10 | 'll [vb infin] [ex0] be a | 11 |
|
| 11 | could [vb infin] [ex0] be a | 10 |
|
| 12 | [vb mod] think [ex0] be a | 9 |
|
| 13 | will [vb infin] [ex0] be a | 8 |
|
| 14 | [vb mod] [vb infin] [ex0] be an | 7 |
|
| 15 | must [vb infin] [ex0] be a | 7 |
|
| 16 | 'd [vb infin] [ex0] be a | 7 |
|
| 17 | [vb mod] find [ex0] be a | 6 |
|
| 18 | let's [vb infin] [ex0] be a | 5 |
|
| 19 | [vb mod] know [ex0] be a | 5 |
|
