Articles

This paper describes a program which revises a draft text by aggregating together descriptions of discourse entities, in addition to deleting ex- traneous information. In contrast to knowledge- rich sentence aggregation approaches explored in the past, this approach exploits statistical parsing and robust coreference detection. In an evaluation involving revision …...

We present a method to automatically generate a concise summary by identifying and synthe- sizing similar elements across related text from a set of multiple documents. Our approach is unique in its usage of language generation to reformulate the wording of the summary. 1...

Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic push- down automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two formalisms, showing that, while they define the same classes of probabilis- tic languages, they appear to impose different inductive biases. …...

Log-linear models provide a statistically sound framework for Stochastic "Unification-Based" Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters of such grammars from a train- ing corpus of syntactic analyses, and apply these to estimate a stochastic version of Lexical- …...

STRAND (Resnik, 1998) is a language- independent system for automatic discovery of text in parallel translation on the World Wide Web. This paper extends the prelim- inary STRAND results by adding automatic language identification, scaling up by orders of magnitude, and formally evaluating perfor- mance. The most recent end-product is …...

Best-first chart parsing utilises a figure of merit (FOM) to efficiently guide a parse by first attending to those edges judged better. In the past it has usually been static; this paper will show that with some extra infor- mation, a parser can compensate for FOM flaws which otherwise slow …...

Algorithms for the alignment of words in translated texts are well established. How- ever, only recently new approaches have been proposed to identify word translations from non-parallel or even unrelated texts. This task is more difficult, because most statistical clues useful in the processing of parallel texts cannot be applied …...

The distinction between achievements and accomplishments is known to be an empirically important but subtle one. It is argued here to depend on the atomicity (rather than punctuality) of events, and to be strongly related to incrementality (i.e., to event-object mapping functions). A computational treatment of incrementality and atomicity is …...

We exploit and extend the Generative Lexicon The- ory to develop a formal description of adnominal constituents in a lexicon which can deal with linguis- tic phenomena found in Japanese adnominal con- stituents. We classify the problematic behavior into "static disambiguation" and "dynamic disambigua- tion" tasks. Static disambiguation can be …...

This paper presents a new method of analyz- ing Japanese noun phrases of the form N1 no 5/2. The Japanese postposition no roughly cor- responds to of, but it has much broader us- age. The method exploits a definition of N2 in a dictionary. For example, rugby no coach can …...

This paper describes new and improved tech- niques which help a unification-based parser to process input efficiently and robustly. In com- bination these methods result in a speed-up in parsing time of more than an order of magni- tude. The methods are correct in the sense that none of them …...

This paper considers statistical parsing of Czech, which differs radically from English in at least two respects: (1) it is a highly inflected language, and (2) it has relatively free word order. These dif- ferences are likely to pose new problems for tech- niques that have been developed on English. …...

We present a new chart parsing method for Lambek grammars, inspired by a method for D- Tree grammar parsing. The formulae of a Lam- bek sequent are firstly converted into rules of an indexed grammar formalism, which are used in an Earley-style predictive chart algorithm. The method is non-polynomial, but …...

Several recent stochastic parsers use bilexical grammars, where each word type idiosyncrat- ically prefers particular complements with par- ticular head words. We present O(n 4) parsing algorithms for two bilexical formalisms, improv- ing the prior upper bounds of O(n5). For a com- mon special case that was known to allow …...

Many real-world texts contain tables. In order to process these texts correctly and extract the infor- mation contained within the tables, it is important to identify the presence and structure of tables. In this paper, we present a new approach that learns to recognize tables in free text, including the …...

This paper examines efficient predictive broad- coverage parsing without dynamic program- ming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left context, from which any kind of non-local dependency or partial semantic inter- pretation can in principle be read. …...

We describe a novel method for coping with un- grammatical input based on the use of chart-like data structures, which permit anytime process- ing. Priority is given to deep syntactic anal- ysis. Should this fail, the best partial analy- ses are selected, according to a shortest-paths algorithm, and assembled in …...

The processes through which readers evoke mental representations of phonological forms from print constitute a hotly debated and controversial issue in current psycholinguistics. In this paper we present a computational analysis of the grapho-phonological system of written French, and an empirical validation of some of the obtained descriptive statistics. The …...

This paper examines the extent to which verb diathesis alternations are empirically attested in corpus data. We automatically acquire alternating verbs from large balanced corpora by using partial- parsing methods and taxonomic information, and discuss how corpus data can be used to quantify lin- guistic generalizations. We estimate the productiv- …...

This paper describes a new efficient speech act type tagging system. This system cov- ers the tasks of (1) segmenting a turn into the optimal number of speech act units (SA units), and (2) assigning a speech act type tag (SA tag) to each SA unit. Our method is based …...