Sciweavers

2111 search results - page 97 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CICLING
2003
Springer
15 years 3 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
SIGCSE
1998
ACM
102views Education» more  SIGCSE 1998»
15 years 2 months ago
Design patterns for data structures
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
Dung Nguyen
ICTAI
1996
IEEE
15 years 2 months ago
Binary CSP Solving as an Inference Process
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understan...
Carlos Castro
LREC
2008
70views Education» more  LREC 2008»
14 years 11 months ago
An Approach to Modeling Heterogeneous Resources for Information Extraction
In this paper, we describe an approach that aims to model heterogeneous resources for information extraction. Document is modeled in graph representation that enables better under...
Lei Xia, José Iria
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 10 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala