1064 search results - page 94 / 213 » Single Tree Grammars |
110
Voted
PODS
2004
ACM
16 years 3 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
133
Voted
CALCO
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
127
Voted
DLS
2007
15 years 7 months ago
2007
This paper introduces OMeta, a new object-oriented language for pattern matching. OMeta is based on a variant of Parsing Expression Grammars (PEGs) [5]--a recognitionbased foundat...
137
Voted
ACL
2006
15 years 5 months ago
2006
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
122
Voted
EMNLP
2004
15 years 5 months ago
2004
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...