Sciweavers

1736 search results - page 8 / 348
» String Extension Learning
Sort
View
IJCNLP
2004
Springer
15 years 3 months ago
Improving Noun Phrase Coreference Resolution by Matching Strings
In this paper we present a noun phrase coreference resolution system which aims to enhance the identification of the coreference realized by string matching. For this purpose, we ...
Xiaofeng Yang, Guodong Zhou, Jian Su, Chew Lim Tan
ICCS
2007
Springer
15 years 1 months ago
A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules
We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of th...
Jean-François Baget
BIRD
2008
Springer
221views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
Comparison of Exact String Matching Algorithms for Biological Sequences
Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In additi...
Petri Kalsi, Hannu Peltola, Jorma Tarhio
RTA
2007
Springer
15 years 4 months ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
ICML
2004
IEEE
15 years 10 months ago
Extensions of marginalized graph kernels
Jean-Luc Perret, Jean-Philippe Vert, Nobuhisa Ueda...