3729 search results - page 493 / 746 » On Formal Modeling of Agent Computations |
156
click to vote
ACL
2010
15 years 4 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
176
click to vote
NAACL
2010
15 years 4 months ago
2010
This paper contributes a formalization of frame-semantic parsing as a structure prediction problem and describes an implemented parser that transforms an English sentence into a f...
232
click to vote
TGC
2010
Springer
15 years 4 months ago
2010
Springer
We propose a formal semantics for distributed transactions inspired by the attribute mechanisms of the Java Transaction API. Technically, we model services in a process calculus fe...
172
click to vote
ACL
2009
15 years 4 months ago
2009
This paper presents the first stochastic finite-state morphological parser for Turkish. The non-probabilistic parser is a standard finite-state transducer implementation of two-le...
194
click to vote
ECCC
2008
15 years 6 months ago
2008
We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...