关键词: 浅层句法分析, 随机森林, 决策树, Bootstrap

Abstract: This paper first points out that shallow parsing problems can be converted into categorizaion problems，then we show how to cope with shallow parsing with random forests.Next，one variant of random forests is given，namely Base+Bootstrap.The experiment result shows that Fβ can reach the value of 92.25% under the model of Base+Bootstrap.

Key words: shallow parsing, random forests, decision trees, Bootstrap