39 search results - page 6 / 8 » Tree Compression Using String Grammars |
IJFCS
2006
13 years 11 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
EACL
2003
ACL Anthology
14 years 8 days ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
VLDB
1987
ACM
14 years 2 months ago
1987
ACM
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
AGTIVE
2003
Springer
14 years 4 months ago
2003
Springer
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...
DAS
2010
Springer
14 years 2 months ago
2010
Springer
We describe a component of a document analysis system for constructing ontologies for domain-specific web tables imported into Excel. This component automates extraction of the Wa...