TAILIEUCHUNG - Báo cáo khoa học: "DETERMINISTIC PARSING AND UNBOUNDED DEPENDENCIES"

This paper assesses two new approaches to deterministic parsing with respect to the analysis of unbounded dependencies (UDs). UDs in English are highly locally (and often globally) ambiguous. Several researchers have argued that the difficulty of UDs undermines the programme of deterministic parsing. However, their conclusion is based on critiques of various versions of the Marcus parser which represents only one of many possible approaches to deterministic parsing. We examine the predictions made by a LR(1) deterministic parser and the Lexicat deterministic parser concerning the analysis of UDs. The LR(1) technique is powerful enough to resolve the local ambiguities we. | DETERMINISTIC PARSING - AND f UNBOUNDED DEPENDENCIES Ted Briscoe Dept of Linguistics Lancaster University Bailrigg Lancashừe LAI 4YT UK ABSTRACT This paper assesses two new approaches to deterministic parsing with respect to the analysis of unbounded dependencies UDs . UDs in English are highly locally and often globally ambiguous. Several researchers have argued that the difficulty of UDs undermines the programme of deterministic parsing. However theứ conclusion is based on critiques of various versions of the Marcus parser which represents only one of many possible approaches to deterministic parsing. We examine the predictions made by a LR 1 deterministic parser and the Lexical deterministic parser concerning the analysis of UDs. The LR 1 technique is powerful enough to resolve the local ambiguities we examine. However the Lexical model provides a more psychologically plausible account of the parsing of UDs which also offers a unified account of the resolution of local and global ambiguities in these constructions. INTRODUCTION Church 1980 117 and Johnson-Laird 1983 313 have argued that the high degree of ambiguity in unbounded dependencies undermines the programme of deterministic parsing. Theữ conclusion is based on critiques of various versions of the Marcus parser Marcus 1980 Berwick Weinberg 1984 . This parser represents only one of many possible approaches to deterministic parsing. Therefore the conclusion that deterministic parsing in general is impractical or psychologically implausible may be premature. In the next section we outline the problems for the deterministic analysis of unbounded dependencies. In the succeeding sections we present two alternative parsing techniques and associated grammars which make differing predictions concerning the onset and location of indeterminacy in the analysis of unbounded dependencies. We argue that the LR 1 parser is capable of deterministically resolving the local ambiguities which occur in these constructions .

• Báo cáo khoa học
• DETERMINISTIC PARSING
• UNBOUNDED DEPENDENCIES
• Ted Briscoe
• scientific reports
• model language
• process natural language
• Tree Based Deterministic Dependency Parsing
• Kotaro Kitagawa Kumiko Tanaka Ishii
• Long Papers
• báo cáo khoa học
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• Optimistic Backtracking A Backtracking Overlay
• Deterministic Incremental Parsing
• Discriminative Classifiers
• Deterministic Dependency Parsing
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Syntactic Non fluencies
• Simplifying Deterministic Parsing
• Alan W
• Carter
• DETERMINISTIC LEFT TO RIGHT PARSING
• TREE ADJOINING LANGUAGES
• Yves Schabes
• Spectral Learning
• Non Deterministic Dependency Parsing
• Ariadna Quattoni and Borja Balle
• Deterministic shift reduce parsing
• unification based grammars
• default unification
• Non deterministic Recursive
• Ascent Parsing