Sciweavers

773 search results - page 94 / 155
» Suffix Trees on Words
Sort
View
ACL
2008
15 years 1 months ago
A Single Generative Model for Joint Morphological Segmentation and Syntactic Parsing
Morphologicalprocesses in Semitic languages deliver space-delimited words which introduce multiple, distinct, syntactic units into the structure of the input sentence. These words...
Yoav Goldberg, Reut Tsarfaty
LREC
2008
131views Education» more  LREC 2008»
15 years 1 months ago
Developing a TT-MCTAG for German with an RCG-based Parser
Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues. Furthermore some l...
Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yann...
IPL
2010
94views more  IPL 2010»
14 years 10 months ago
A compact data structure for representing a dynamic multiset
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
Jyrki Katajainen, S. Srinivasa Rao
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 5 days ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
CORR
1998
Springer
113views Education» more  CORR 1998»
14 years 11 months ago
Letter to Sound Rules for Accented Lexicon Compression
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
V. Pagel, Kevin Lenzo, Alan W. Black