268 search results - page 31 / 54 » Linear Context Free Languages |
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
ISMB
1994
13 years 8 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...
PLANX
2008
13 years 8 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
LREC
2010
13 years 8 months ago
2010
Named Entity Recognition (NER) plays a relevant role in several Natural Language Processing tasks. Question-Answering (QA) is an example of such, since answers are frequently name...
LREC
2008
13 years 8 months ago
2008
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...