Sciweavers

110 search results - page 10 / 22
» Restrictions on Tree Adjoining Languages
Sort
View
NAACL
2010
13 years 5 months ago
Why Synchronous Tree Substitution Grammars?
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
Andreas Maletti
CADE
2005
Springer
14 years 8 months ago
Regular Protocols and Attacks with Regular Knowledge
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
Tomasz Truderung
ENTCS
2006
117views more  ENTCS 2006»
13 years 7 months ago
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
Hans-Jörg Tiede, Stephan Kepser
IEICET
2008
67views more  IEICET 2008»
13 years 7 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
COLING
2002
13 years 7 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...