A view of parsing

Government-Binding Parsing has become attractive in the last few years. A variety of systems have been designed in view of a correspondence as direct as possible with linguistic theory ([Johnson, 1989], [Pollard and Sag, 1991], [Kroch, 1989]). These approaches can be classified by their method of handling global constraints. Global constraints are syntactic in nature: They cover more than one projection. In contrast, local constraints can be checked inside a projection and, thus, lend themselves to a treatment in the lexicon. ...

6p buncha_1 08-05-2013 45 2   Download

In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.

6p buncha_1 08-05-2013 40 2   Download

This work is concerned with the development of instruments for GB parsing. An alternative to the well known indexation system of (Chomsky, 1981) will be proposed and then used to formalize the view of Binding Theory in terms of the generation of constraints on the referential properties of the NPs of a sentence. Finally the problems of verification and satisfiability of BT will be addressed within the proposed framework.

6p buncha_1 08-05-2013 38 3   Download

This paper discusses the consequences of allowing discontinuous constituents in syntactic representions and phrase-structure rules, and the resulting complications for a standard parser of phrase-structure grammar. It is argued, first, that discontinuous constituents seem inevitable in a phrase-structure grammar which is acceptable from a semantic point of view. It is shown that tree-like constituent structures with discontinuities can be given a precise definition which makes them just as acceptable for syntactic representation as ordinary trees.

8p buncha_1 08-05-2013 43 2   Download

We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise to clean analyses and compact descriptions that can serve as the basis for modular implementations. We illustrate this with several examples, showing how to build search spaces for several disparate phrase-based search strategies, integrate non-local features, and devise novel models.

9p bunthai_1 06-05-2013 49 1   Download

By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses. The efficiency of this approach for an interesting class of grammars is discussed. 1. I n t r o d u c t i o n The aim of this paper is to explore the relationship between parsing and deduction. The basic notion, which goes back to Kowaiski (Kowalski, 1980} and Colmerauer {Colmeraucr, 1978), h'zs seen a very...

8p bungio_1 03-05-2013 34 0   Download

The questions before this panel presuppose a distinction between parsing and interpretation. T h e r e are two other simple and obvious distinctions that I think are necessary for a reasonable discussion of the issues. First, we must clearly distinguish between the static specification of a process and its dynamic execution. Second, we must clearly distinguish two purposes that a natural language processing system might serve: one legitimate goal of a system is to perform some practical ~sk efficiently and well. ...

2p bungio_1 03-05-2013 25 1   Download

One reason for the wide variety of views on many subjects in computational linguistics (such as parsing) is the diversity of objectives which lead people to do research in this area. Some researchers are motivated primarily by potential applications - the development of natural language interfaces for computer systems. Others are primarily concerned with the psychological processes which underlie human language, and view the computer as a tool for modeling and thus improving our understanding of these processes. ...

2p bungio_1 03-05-2013 44 1   Download

Bernard Lang defines parsing as ~ calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input (rather than a word string). Furthermore, certain techniques for robust parsing can be modelled as finite state transducers. In this paper we investigate how we can generalize this approach for unification grammars. In particular we will concentrate on how we might the calculation of the intersection of a FSA and...

7p bunmoc_1 20-04-2013 36 2   Download

We provide a logical definition of Minimalist grammars, that are Stabler’s formalization of Chomsky’s minimalist program. Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-asdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of the logical form. ...

8p bunrieu_1 18-04-2013 47 5   Download

Semantic role labeling is the process of annotating the predicate-argument structure in text with semantic labels. In this paper we present a state-of-the-art baseline semantic role labeling system based on Support Vector Machine classifiers. We show improvements on this system by: i) adding new features including features extracted from dependency parses, ii) performing feature selection and calibration and iii) combining parses obtained from semantic parsers trained using different syntactic views. ...

8p bunbo_1 17-04-2013 44 1   Download

We introduce a framework for syntactic parsing with latent variables based on a form of dynamic Sigmoid Belief Networks called Incremental Sigmoid Belief Networks. We demonstrate that a previous feed-forward neural network parsing model can be viewed as a coarse approximation to inference with this class of graphical model. By constructing a more accurate but still tractable approximation, we significantly improve parsing accuracy, suggesting that ISBNs provide a good idealization for parsing. ...

8p hongvang_1 16-04-2013 36 1   Download

A key question facing the parsing community is how to compare parsers which use different grammar formalisms and produce different output. Evaluating a parser on the same resource used to create it can lead to non-comparable accuracy scores and an over-optimistic view of parser performance. In this paper we evaluate a CCG parser on DepBank, and demonstrate the difficulties in converting the parser output into DepBank grammatical relations.

8p hongvang_1 16-04-2013 39 1   Download