Total Articles: 38870

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6639

Event-based summarization attempts to select and organize the sentences in a summary with respect to the events or the sub-events that the sentences de- scribe. Each event has its own internal structure, and meanwhile often relates to other events semantically, temporally, spatially, causally or conditionally. In this paper, we define …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6640

We present a novel classifier-based deter- ministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make shift-reduce decisions. Trained and evaluated on the standard training and test sets, our best model (us- ing stacked classifiers) runs in linear …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6641

Accurately representing synonymy using distributional similarity requires large vol- umes of data to reliably represent infre- quent words. However, the na¨ıve nearest- neighbour approach to comparing context vectors extracted from large corpora scales poorly (O(n2) in the vocabulary size). In this paper, we compare several existing approaches to approximating the …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6642

Lexical classes, when tailored to the appli- cation and domain in question, can provide an effective means to deal with a num- ber of natural language processing (NLP) tasks. While manual construction of such classes is difficult, recent research shows that it is possible to automatically induce verb classes from …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6643

Various methods have been proposed for automatic synonym acquisition, as syn- onyms are one of the most fundamen- tal lexical knowledge. Whereas many methods are based on contextual clues of words, little attention has been paid to what kind of categories of contex- tual information are useful for the pur- …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 665

Many grammar checkers in rule-based approach do not handle errors that come from various usages, for example, the usages of prepositions. To study the behavior of prepositions, we introduce the language model into a grammar- checking task. A language model is trained from a large training corpus, which contains many …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 670

MiniJudge is free online open-source software to help theoretical syntacticians collect and analyze native-speaker acceptability judgments in a way that combines the speed and ease of traditional introspective methods with the power and statistical validity afforded by rigorous experimental design. This paper shows why MiniJudge is useful, what it feels …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6727

Statistical parsers trained and tested on the Penn Wall Street Journal (WSJ) treebank have shown vast improvements over the last 10 years. Much of this improvement, however, is based upon an ever-increasing number of features to be trained on (typi- cally) the WSJ treebank data. This has led to concern …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6728

We introduce an error mining technique for automatically detecting errors in re- sources that are used in parsing systems. We applied this technique on parsing re- sults produced on several million words by two distinct parsing systems, which share the syntactic lexicon and the pre-parsing processing chain. We were thus …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6729

In this paper we investigate the benefit of stochastic predictor components for the parsing quality which can be obtained with a rule-based dependency grammar. By in- cluding a chunker, a supertagger, a PP at- tacher, and a fast probabilistic parser we were able to improve upon the baseline by 3.2%, …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6730

We present an unsupervised learning al- gorithm that mines large text corpora for patterns that express implicit semantic re- lations. For a given input word pair X :Y with some unspecified semantic relations, the corresponding output list of patterns Pm P , , 1 � is ranked according to how …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6731

We present BAYESUM (for “Bayesian summarization”), a model for sentence ex- traction in query-focused summarization. BAYESUM leverages the common case in which multiple documents are relevant to a single query. Using these documents as re- inforcement for query terms, BAYESUM is not afflicted by the paucity of information in short …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6732

We present a novel approach for discov- ering word categories, sets of words shar- ing a significant aspect of their mean- ing. We utilize meta-patterns of high- frequency words and content words in or- der to discover pattern candidates. Sym- metric patterns are then identified using graph-based measures, and word …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6734

We investigate the utility of supertag infor- mation for guiding an existing dependency parser of German. Using weighted con- straints to integrate the additionally avail- able information, the decision process of the parser is influenced by changing its preferences, without excluding alternative structural interpretations from being con- sidered. The paper …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6735

A good dictionary contains not only many entries and a lot of information concerning each one of them, but also adequate means to reveal the stored in- formation. Information access depends crucially on the quality of the index. We will present here some ideas of how a dictionary could be …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6736

This paper presents a method for build- ing genetic language taxonomies based on a new approach to comparing lexi- cal forms. Instead of comparing forms cross-linguistically, a matrix of language- internal similarities between forms is cal- culated. These matrices are then com- pared to give distances between languages. We argue …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6737

Spoken language generation for dialogue systems requires a dictionary of mappings between semantic representations of con- cepts the system wants to express and re- alizations of those concepts. Dictionary creation is a costly process; it is currently done by hand for each dialogue domain. We propose a novel unsupervised method …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6738

This paper presents a pilot study of the use of phrasal Statistical Machine Trans- lation (SMT) techniques to identify and correct writing errors made by learners of English as a Second Language (ESL). Using examples of mass noun errors found in the Chinese Learner Error Cor- pus (CLEC) to guide …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6739

Transforming syntactic representations in order to improve parsing accuracy has been exploited successfully in statistical parsing systems using constituency-based representations. In this paper, we show that similar transformations can give sub- stantial improvements also in data-driven dependency parsing. Experiments on the Prague Dependency Treebank show that systematic transformations of coordinate …...

nan

Publication: TIPSTER (2006)

DOI: nan

Paper ID: 6740

We have developed an automated Japanese essay scoring system called Jess. The sys- tem needs expert writings rather than ex- pert raters to build the evaluation model. By detecting statistical outliers of prede- termined aimed essay features compared with many professional writings for each prompt, our system can evaluate essays. …...