Sciweavers

478 search results - page 50 / 96
» Context-Sensitive Dependency Pairs
Sort
View
IANDC
2007
117views more  IANDC 2007»
14 years 11 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
14 years 11 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
CORR
1998
Springer
99views Education» more  CORR 1998»
14 years 11 months ago
Models of Co-occurrence
A model of co-occurrence in bitext is a boolean predicate that indicates whether a given pair of word tokens co-occur in corresponding regions of the bitext space. Co-occurrence i...
I. Dan Melamed
MA
2010
Springer
143views Communications» more  MA 2010»
14 years 10 months ago
The pairwise beta distribution: A flexible parametric multivariate model for extremes
We present a new parametric model for the angular measure of a multivariate extreme value distribution. Unlike many parametric models that are limited to the bivariate case, the ï...
Daniel Cooley, Richard A. Davis, Philippe Naveau
NLE
2010
218views more  NLE 2010»
14 years 10 months ago
Automatic discovery of word semantic relations using paraphrase alignment and distributional lexical semantics analysis
Thesauri, that list the most salient semantic relations between words have mostly been compiled manually. Therefore, the inclusion of an entry depends on the subjective decision o...
Gaël Dias, Rumen Moraliyski, João Cord...