4 search results - page 1 / 1 » An Efficient Pattern Matching Algorithm on a Subclass of Con... |
DLT
2004
13 years 6 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
ACL
1996
13 years 5 months ago
1996
This paper proposes the use of "patternbased" context-free grammars as a basis for building machine translation (MT) systems, which are now being adopted as personal too...
ICDT
2010
ACM
13 years 7 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
ISMB
1994
13 years 5 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...