Sciweavers

273 search results - page 19 / 55
» Extensible Grammars for Language Specialization
Sort
View
DLS
2007
138views Languages» more  DLS 2007»
13 years 11 months ago
OMeta: an object-oriented language for pattern matching
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...
Alessandro Warth, Ian Piumarta
CSLP
2004
Springer
13 years 11 months ago
Multi-dimensional Graph Configuration for Natural Language Processing
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
Ralph Debusmann, Denys Duchier, Marco Kuhlmann
CALCO
2005
Springer
126views Mathematics» more  CALCO 2005»
14 years 1 months ago
Context-Free Languages via Coalgebraic Trace Semantics
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...
Ichiro Hasuo, Bart Jacobs
ALT
2007
Springer
14 years 4 months ago
Learning in Friedberg Numberings
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar e...
Sanjay Jain, Frank Stephan
EACL
2003
ACL Anthology
13 years 9 months ago
Describing Syntax with Star-Free Regular Expressions
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...
Anssi Yli-Jyrä