Articles

The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treat- ments of implication, universal quantifi- cation, negation and disjunction that are more "dynamic" (in a precise sense) than the usual reductions to tests from quanti- fied dynamic logic (which, nonetheless, can …...

As the acquisition problem of bilingual lists of terminological expressions is formidable, it is worthwhile to investigate methods to compile such lists as automatically as pos- sible. In this paper we discuss experimen- tal results for a number of methods, which operate on corpora of previously translated texts. Keywords: parallel …...

In the paper it is argued that for some lin- guistic phenomena, current discourse repre- sentation structures are insufficiently fine- grained, both from the perspective of serv- ing as representation in NLP and from a truth conditional perspective. One such semantic phenomenon is uniqueness. It is demonstrated that certain elements …...

Semantic theories of natural language as- sociate meanings with utterances by pro- viding meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Traditionally, meanings are com- bined via function composition, which works well when constituent structure trees are used to …...

In this paper we present a means of defin- ing morphonological phenomena in an in- heritance based lexicon. We make use of the theory behind the formal language MOLUSC, in which morphological alterna- tions were defined as mappings between se- quences of tree-structured syllables. We discuss how the alternations can …...

We present evidence that head-driven pars- ing strategies lead to efficiency gains over standard parsing strategies, for lexicalist, concatenative and unification-based gram- mars. A head-driven parser applies a rule only after a phrase matching the head has been derived. By instantiating the head of the rule important information is ob- …...

Substantial efforts have been made in or- der to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990].). This paper describes the roles of disjunctions and inheritance in the use of feature structures and their formal semantics. With the notion …...

It is traditionally assumed that various sources of linguistic knowledge and their in- teraction should be formalised in order to be able to convert words into their phone- mic representations with reasonable accu- racy. We show that using supervised learn- ing techniques, based on a corpus of tran- scribed words, …...

In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse tree can usually be generated by several derivations that involve different subtrces. This leads to a statistics where the probability …...

This paper investigates the complexity of the satisfiability problem for feature logics strong enough to code entire grammars un- aided. We show that feature logics capable of both enforcing re-entrancy and stating linguistic generalisations will have undecid- able satisfiability problems even when most Boolean expressivity has been discarded. We exhibit …...

In this paper we introduce a modal lan- guage L T for imposing constraints on trees, and an extension LT(L r) for imposing con- straints on trees decorated with feature structures. The motivation for introducing these languages is to provide tools for for- malising grammatical frameworks perspic- uously, and the …...

This paper is a country report of the current progress of the research and development efforts in machine translation in Malaysia with emphasis on the work being carried out at the Malaysian National Institute of Translation. 1...

In this paper, we describe the most recent implementation and evaluation of the proper noun categorization and standardization module of the DR- LINK document detection system being developed at Syracuse University, under the auspices of ARPA's TIPSTER program. We also discuss the expansion of group common nouns and group proper …...

This paper represents initial work on corpus methods for ac- quiring lexical/semantic pattern lexicons for text understand- ing. Recently, implementors of information extraction (IE) systems have moved away from using conventional syntac- tic parsing methods, instead adopting a variety of pattern based approaches for complex IE tasks. While there has …...

Bootstrap methods (unsupervised classification) that generate word classes without requiring pretagging have had notable success in the last few years. The methods described here strengthen these approaches and produce excellent word classes from a 200,000 word corpus. The method uses mutual information measures plus positional information from the words in …...

We describe a mechanism for automatically acquiring verb subcategorization frames and their frequencies in a large corpus. A tagged corpus is first partially parsed to identify noun phrases and then a finear grammar is used to estimate the appropri- ate subcategorization frame for each verb token in the corpus. In …...

This paper discusses automatic acquisition of predicate-argument mapping in- formation from multilingual texts. The lexicon of our NLP system abstracts the language-dependent portion of predicate-argument mapping information from the core meaning of verb senses (i.e. semantic concepts as defined in the knowledge base). We represent this mapping information in terms …...

. In this paper we present an unsupervised learning algorithm for incremental concept formation, based on an augmented version of COBWEB. The algorithm is applied to the task of acquiring a verb taxonomy through the systematic observation of verb usages in corpora. Using a Machine Learning methodology for a Natural …...

As large on-line corpora become more prevalent, a number of attempts have been made to automatically extract thesaurus-like relations directly from text using knowl- edge poor methods. In the absence of any specific application, comparing the results of these attempts is difficult. Here we propose an evaluation method using gold …...

We discuss a method for augmenting and rearranging a structured lexicon in order to make it more suitable for a topic labefing task, by making use of lexical association information from a large text corpus. We first describe an algorithm for converting the hierarchical structure of WordNet [13] into a …...