Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ACL
1997
11 years 11 months ago
A Uniform Approach to Underspecification and Parallelism
We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express e...
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg
ACL
1997
11 years 11 months ago
Applying Explanation-based Learning to Control and Speeding-up Natural Language Generation
This paper presents a method for the automatic extraction of subgrammars to control and speeding-up natural language generation NLG. The method is based on explanation-based learn...
Günter Neumann
ACL
1997
11 years 11 months ago
A Word-to-Word Model of Translational Equivalence
Many multilingual NLP applications need to translate words between different languages, but cannot afford the computational expense of inducing or applying a full translation mode...
I. Dan Melamed
ACL
1997
11 years 11 months ago
A Portable Algorithm for Mapping Bitext Correspondence
The first step in most empirical work in multilingual NLP is to construct maps of the correspondence between texts and their translations (bitext maps). The Smooth Injective Map R...
I. Dan Melamed
ACL
1997
11 years 11 months ago
Using Syntactic Dependency as Local Context to Resolve Word Sense Ambiguity
Most previous corpus-based algorithms disambiguate a word with a classifier trained from previous usages of the same word. Separate classifiers have to be trained for different wo...
Dekang Lin
ACL
1997
11 years 11 months ago
Generative Power of CCGs with Generalized Type-Raised Categories
This paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to ...
Nobo Komagata
ACL
1997
11 years 11 months ago
Ambiguity Resolution for Machine Translation of Telegraphic Messages
Telegraphic messages with numerous instances of omission pose a new challenge to parsing in that a sentence with omission causes a higher degree of ambi6uity than a sentence witho...
Young-Suk Lee, Clifford J. Weinstein, Stephanie Se...
ACL
1997
11 years 11 months ago
Machine Transliteration
Kevin Knight, Jonathan Graehl
ACL
1997
11 years 11 months ago
Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
Lillian Lee
books