摘要
花园幽径句是临时的歧义句,整个的句子是没有歧义的,但是,这个句子的前段是有歧义的。当人在理解花园幽径句的前面的歧义段的过程中,不同的歧义结果之间有优先性,有的歧义解释是人们所乐于接受的,有的歧义解释是人们不太愿意接受的。但是,人们不愿意接受的解释恰恰是这个句子的正确分析结果。花园幽径句的歧义段分析,由于总是选择非优先的结构作为正确的结果,当分析结果为优先的结果时,就必须回到句子开头重新进行分析,以便得到非优先的分析结果。因此,花园幽径句的自动句法分析中,往往会出现大量的回溯(backtracking),严重影响自动分析的效率。在种种自然语言分析算法中,Earley算法可以避免回溯,因此,本文采用Earley算法来分析花园幽径句,完全避免了回溯。
The garden-path sentence is a sentence with a property of temporary ambiguity. The ambiguity lies only in the initial part. One of the two or more parses in the initial portion is somehow preferable to the human parsing mechanism. But the dispreferred parse is the correct one for the sentence. Parsing a garden-path sentence, the parser has to return to the initial portion to get the dispreferred but correct result, so there will be a lot of backtrackings in the parsing of garden-path sentences. The backtracking severely reduces the effectiveness of parsing. The Ear-ley algorithm is a good parsing algorithm in the natural language processing that can avoid the backtracking. Earley algorithm is tested in this paper.
出处
《当代语言学》
CSSCI
北大核心
2003年第4期339-349,共11页
Contemporary Linguistics
