Sciweavers

3653 search results - page 94 / 731
» On Recognizable Timed Languages
Sort
View
FUIN
2007
133views more  FUIN 2007»
15 years 5 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood
HCI
2009
15 years 2 months ago
Composing Visual Syntax for Domain Specific Languages
With the increasing interest in metamodeling techniques for Domain Specific Modeling Languages (DSML) definition, there is a strong need to improve the language modeling process. O...
Luis Pedro, Matteo Risoldi, Didier Buchs, Bruno Ba...
CIKM
2011
Springer
14 years 5 months ago
Supervised language modeling for temporal resolution of texts
We investigate temporal resolution of documents, such as determining the date of publication of a story based on its text. We describe and evaluate a model that build histograms e...
Abhimanu Kumar, Matthew Lease, Jason Baldridge
EACL
1993
ACL Anthology
15 years 6 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
SAC
2010
ACM
15 years 12 months ago
CNL4DSA: a controlled natural language for data sharing agreements
A Data Sharing Agreement (DSA) is an agreement among contracting parties regulating how they share data. A DSA represents a flexible mean to assure privacy of data exchanged on t...
Ilaria Matteucci, Marinella Petrocchi, Marco Luca ...