We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deï...
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x Ï ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
Abstract. Parallel texts are enriched by alignment algorithms, thus establishing a relationship between the structures of the implied languages. Depending on the alignment level, t...
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
We employ Maximum Entropy model to conduct sub-tree alignment between bilingual phrasal structure trees. Various lexical and structural knowledge is explored to measure the syntac...