Sciweavers

2475 search results - page 75 / 495
» On the accuracy of language trees
Sort
View
IANDC
2011
129views more  IANDC 2011»
13 years 5 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
ACL
2006
13 years 11 months ago
Coreference Handling in XMG
We claim that existing specification languages for tree based grammars fail to adequately support identifier managment. We then show that XMG (eXtensible MetaGrammar) provides a s...
Claire Gardent, Yannick Parmentier
CADE
2005
Springer
14 years 10 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
EACL
1993
ACL Anthology
13 years 11 months ago
Using an Annotated Corpus as a Stochastic Grammar
In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse t...
Rens Bod
COLING
2010
13 years 5 months ago
Dependency Forest for Statistical Machine Translation
We propose a structure called dependency forest for statistical machine translation. A dependency forest compactly represents multiple dependency trees. We develop new algorithms ...
Zhaopeng Tu, Yang Liu, Young-Sook Hwang, Qun Liu, ...