Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
G r a m m a r formalisms based on the encoding of grammatical information in complex-valued feature systems enjoy some currency both in linguistics and natural-language-processing research. Such formalisms can be thought of by analogy to context-free grammars as generalizing the notion of nonterminal symbol from a finite domain of atomic elements to a possibly infinite domain of directed graph structures nf a certain sort. | Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms Stuart M. Shieber Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford University Abstract 1 Introduction Grammar formalisms based on the encoding of grammatical information in complex-valued feature systems enjoy some currency both in linguistics and natural-language-processing research. Such formalisms can be thought of by analogy to context-free grammars as generalizing the notion of nonterminal symbol from a finite domain of atomic elements to a possibly infinite domain of directed graph structures of a certain sort. Unfortunately in moving to an infinite nonterminal domain standard methods of parsing may no longer be applicable to the formalism. Typically the problem manifests itself as gross inefficiency or even nontermination of the algorithms. In this paper we discuss a solution to the problem of extending parsing algorithms to formalisms with possibly infinite nonterminal domains a solution based on a general technique we call restriction. As a particular example of such an extension we present a complete correct terminating extension of Earley s algorithm that uses restriction to perform top-down filtering. Our implementation of this algorithm demonstrates the drastic elimination of chart edges that can be achieved by this technique. Finally. we describe further uses for the technique including parsing other grammar formalisms including definite-clause grammars extending other parsing algorithms including LR methods and syntactic preference modeling algorithms and efficient indexing. This research has been made possible in part by a girt from the Systems Development Foundation and was also supported by the Defense Advanced Research Projects Agency under Contract N 000.39-84-K-0078 with the Naval Electronics Systems Command. The views and conclusions contained in this document should not be interpreted as .
