1404 search results - page 99 / 281 » Complexity of admissible rules |
101
Voted
FEGC
2008
15 years 5 months ago
2008
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...
115
Voted
ANLP
2000
15 years 5 months ago
2000
Arabic inflectional morphology requires infixation, prefixation and suffixation, giving rise to a large space of morphological variation. In this paper we describe an approach to ...
113
Voted
COLING
1992
15 years 4 months ago
1992
This paper focuses on a theory of tense and aspect (the representation of time in natural language) that attempts a formM representation of the relevant liltguistic devices as imp...
95
Voted
MVA
1990
15 years 4 months ago
1990
A new handwriting model is proposed for simulating complex handwriting variation in obedience to individual handwriting tendencies. Individual handwriting t,endency is represented...
128
Voted
GG
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...