Sciweavers

1343 search results - page 8 / 269
» Learning to Complete Sentences
Sort
View
IALP
2009
13 years 4 months ago
A Modular Cascaded Approach to Complete Parsing
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
Samar Husain, Phani Gadde, Bharat Ram Ambati, Dipt...
ACL
1996
13 years 8 months ago
Resolving Anaphors in Embedded Sentences
We propose an Mgorithm to resolve anaphors, tackling mainly the problem of intrasentential antecedents. We base our methodology on the fact that such antecedents are likely to occ...
Saliha Azzam
CICLING
2003
Springer
13 years 12 months ago
Sentence Co-occurrences as Small-world Graphs: A Solution to Automatic Lexical Disambiguation
This paper presents a graph-theoretical approach to lexical disambiguation on word co-occurrences. Producing a dictionary similar to WordNet, this method is the counterpart to word...
Stefan Bordag
STACS
1999
Springer
13 years 11 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
AI
2006
Springer
13 years 10 months ago
Beyond the Bag of Words: A Text Representation for Sentence Selection
Sentence selection shares some but not all the characteristics of Automatic Text Categorization. Therefore some but not all the same techniques should be used. In this paper we stu...
Maria Fernanda Caropreso, Stan Matwin