Sciweavers

102 search results - page 14 / 21
» Tile Rewriting Grammars
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
13 years 6 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
13 years 6 months ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
COLING
2008
13 years 8 months ago
Sentence Compression Beyond Word Deletion
In this paper we generalise the sentence compression task. Rather than simply shorten a sentence by deleting words or constituents, as in previous work, we rewrite it using additi...
Trevor Cohn, Mirella Lapata
EMNLP
2007
13 years 8 months ago
Large Margin Synchronous Generation and its Application to Sentence Compression
This paper presents a tree-to-tree transduction method for text rewriting. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of...
Trevor Cohn, Mirella Lapata
LREC
2010
160views Education» more  LREC 2010»
13 years 8 months ago
FrAG, a Hybrid Constraint Grammar Parser for French
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
Eckhard Bick