Sciweavers

1000 search results - page 31 / 200
» Dependency Tree Automata
Sort
View
EMNLP
2007
13 years 11 months ago
A Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
Sander Canisius, Erik Tjong Kim Sang
COLING
2010
13 years 4 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, ...
ACL
2012
12 years 3 days ago
Semantic Parsing with Bayesian Tree Transducers
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-...
Bevan K. Jones, Mark Johnson, Sharon Goldwater
AUSAI
2003
Springer
14 years 2 months ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
Frédéric Maire, Frank Wathne, Alain ...
DLT
2003
13 years 11 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer