1418 search results - page 125 / 284 » The Dynamic Complexity of Formal Languages |
150
click to vote
LACL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
137
click to vote
ARTS
1999
Springer
15 years 8 months ago
1999
Springer
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
139
click to vote
EACL
2003
ACL Anthology
15 years 5 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
106
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract This paper explores different means of representation for algebraic transductions, i.e., word relations realized by pushdown transducers. The relevance of this work lies m...
158
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
In the semantic web architecture, Web ontology languages are built on top of RDF(S). However, serious difficulties have arisen when trying to layer expressive ontology languages, ...