773 search results - page 30 / 155 » Suffix Trees on Words |
119
click to vote
NAACL
2007
15 years 7 months ago
2007
This paper introduces an unsupervised morphological segmentation algorithm that shows robust performance for four languages with different levels of morphological complexity. In p...
139
click to vote
ACL
2004
15 years 7 months ago
2004
Parsing systems which rely on hand-coded linguistic descriptions can only perform adequately in as far as these descriptions are correct and complete. The paper describes an error...
155
click to vote
IPL
2008
15 years 6 months ago
2008
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
174
click to vote
ACL
2007
15 years 7 months ago
2007
Extracting tree transducer rules for syntactic MT systems can be hindered by word alignment errors that violate syntactic correspondences. We propose a novel model for unsupervise...
162
click to vote
MST
2010
15 years 4 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...