656 search results - page 4 / 132 » Marrying Words and Trees |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
ACL
1998
13 years 11 months ago
1998
This paper proposes decoupling the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a word...
NLP
2000
14 years 1 months ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
ANLP
2000
13 years 11 months ago
2000
This paper introduces a system for categorizing unknown words. The system is based on a multicomponent architecture where each component is responsible for identifying one class o...
CSL
2006
Springer
13 years 9 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...