Head-Driven Phrase Structure Grammar (HPSG), a unification-based formal language for describing linguistic phenomena, has a declarative semantics which makes it amenable to specification as a logic program. The HPSG formalism has undergone significant modification, becoming more declarative and incorporating greater lexicalization, since Proudian and Pollard first introduced a LISP-based HPSG c...

This study presents a comparison between syntactic and prosodic phrasing. A parser is used to calculate the syntactic structures from the orthographic text the prosodic structures of which are given by means of ToBI label files. For the automatic evaluation the prosodic break indices "3" (intermediate phrase boundary) and "4" (intonation phrase boundary) are compared with the terminals extracte...

This paper describes a structure-sharing method for the representation of complex phrase types in a parser for PATR-[I, a unification-based grammar formalism. In parsers for unification-based grammar formalisms, complex phrase types are derived by incremental refinement of rite phrase types defined in grammar rules and lexical entries. In a naive implementation, a new phrase type is built by co...

In this paper, we propose a method for analyzing word-word dependencies using deterministic bottom-up manner using Support Vector machines. We experimented with dependency trees converted from Penn treebank data, and achieved over 90% accuracy of word-word dependency. Though the result is little worse than the most up-to-date phrase structure based parsers, it looks satisfactorily accurate cons...

In this paper, we concern ourselves with an application of text-to-speech for speech-impaired, deaf, and hard of hearing people. The application is unusual because it requires real-time synthesis of unedited, spontaneously generated conversational texts transmitted via a Telecommunications Device for the Deaf (TDD). We describe a parser that we have implemented as a front end for a version of t...

This paper presents a formalism for natural language grammars , with accompanying parser. The grammars are called slot grammars because they are organized around slots (grammatical relations) and rules for filling them. The parser works bo t tom-up and maintains, for each phrase being built up, a list called the available slots list, ASLOTS. A phrase can grow by having one of the slots in its A...

MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a ~;hift-reduce parser which is doterministically guided by a parsing table. A parsing table can be obtained automatically from a context-free phrase structure grammar. LR parsers cannot manage antl)iguous grammars such as natural language grammars, because their I)arsing tab...

A noun phrase parser is useful for several purposes, e.g. for index term generation in an information retrieval application; for the extraction of collocational knowledge from large corpora for the development of computational tools for language analysis; for providing a shallow but accurately analysed input for a more ambitious parsing system; for the discovery of translation units, and so on....

We introduce a technique for inducing a refinement of the set of part of speech tags related to verbs. We cluster verbs according to their syntactic behavior in a dependency structure setting. The set of clusters is automatically determined by means of a quality measure over the probabilistic automata that describe words in a bilexical grammar. Each of the resulting clusters defines a new part ...

Data-driven parsing has been a main method for analyzing natural languages. We aim at exploring a data-driven Chinese parser, by basing it on Head-driven Phrase Structure Grammar (HPSG). Unlike for English, there is still no available Chinese HPSG framework. As the first step of our work, we design a Chinese HPSG framework, which can be used as the basis for a practical parser. In this paper, 1...