A number of authors working in the HPSG paradigm (Reape, 1990, 1994, 1996; Richter and Sailer, 1995; Kathol, 1995; Müller, 1995, 1999a; Penn, 1999, and others) have argued on linguistic grounds that constituent structure should not be directly linked to word order properties. While the formal realizations of the proposals differ, all these so-called linearization approaches have in common that ...

Here is the history of linguistics in one sentence: once upon a time linguists (i.e. syntacticlans) used augmented phrase structure grammars, then they went over to transformational grammars, and then some of them started using augmented phrase structure grammars again, (space for moral~. Whilst we are in this careful scholarly mode, let us do the same service for computational linguistics: onc...

This paper formulates a novel problem on graphs: find the minimal subset of edges in a fully connected graph, such that the resulting graph contains all spanning trees for a set of specified subgraphs. This formulation is motivated by an unsupervised grammar induction problem from computational linguistics. We present a reduction to some known problems and algorithms from graph theory, provide ...

Each grammar formalism speciies a domain of locality, i.e., a domain over which various dependencies (syntactic and semantic) can be speci-ed. It turns about that the various properties of a formalism (syntactic, semantic, computational , and even psycholinguistic), follow, to a large extent, from the initial speciication of the domain of locality. In this paper, we will brieey explore the exte...

While the morphology of Modern Hebrew is well accounted for computationally, there are few computational grammars describing the syntax of the language. Existing grammars are scarcely based on solid linguistic grounds: they do not conform to any particular linguistic theory and do not provide a linguistically plausible analysis for the data they cover. This paper presents a first attempt toward...

In this paper we investigate the phenomenon of verb-particle constructions, discussing their characteristics and the challenges that they present for a computational grammar. We concentrate our discussion on the treatment adopted in a wide-coverage HPSG grammar: the LinGO ERG. Given the constantly growing number of verb-particle combinations, possible ways of extending this treatment are invest...

Functional unification (FU) grammar is a general linguistic formalism based on the merging of feature-sets. An informal outline is given of how the definition of derivation within FU grammar can be used to represent the satisfiability of an arbitrary logical formula in conjunctive normal form. This suggests that the generation of a structure from an arbitrary FU g~ammar is NP-hard, which is an ...

Natural Language Parsing has been the most prominent research area since the genesis of Natural Language Processing. Probabilistic Parsers are being developed to make the process of parser development much easier, accurate and fast. In Indian context, identification of which Computational Grammar Formalism is to be used is still a question which needs to be answered. In this paper we focus on t...

We describe an experimental text-to-speech system that uses information about syntactic constituency, adjacency to a verb, and constituent length to determine prosodic phrasing for synthetic speech. A central goal of our work has been to characterize "discourse neutral" phrasing, i.e. sentence-level phrasing patterns that are independent of discourse semantics. Our account builds on Bachenko et...

The tag set for the CGN syntactic annotation is designed in such a way as to enable a transparent mapping to the derivational structures of current ‘lexicalized’ grammar formalisms. Through such translations, the CGN tree bank can be used to train and evaluate computational grammars within these frameworks. In this paper we will discuss some preliminary work on the mapping between the CGN annot...