Sciweavers

2475 search results - page 71 / 495
» On the accuracy of language trees
Sort
View
NAACL
2010
13 years 8 months ago
Learning Translation Boundaries for Phrase-Based Decoding
Constrained decoding is of great importance not only for speed but also for translation quality. Previous efforts explore soft syntactic constraints which are based on constituent...
Deyi Xiong, Min Zhang, Haizhou Li
ACL
2009
13 years 8 months ago
Mining Bilingual Data from the Web with Adaptively Learnt Patterns
Mining bilingual data (including bilingual sentences and terms1 ) from the Web can benefit many NLP applications, such as machine translation and cross language information retrie...
Long Jiang, Shiquan Yang, Ming Zhou, Xiaohua Liu, ...
ICALP
2007
Springer
14 years 4 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
SIGCSE
1996
ACM
136views Education» more  SIGCSE 1996»
14 years 2 months ago
Thinking about binary trees in an object-oriented world
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
A. Michael Berman, Robert C. Duvall
EMNLP
2004
13 years 11 months ago
Dependencies vs. Constituents for Tree-Based Alignment
Given a parallel parsed corpus, statistical treeto-tree alignment attempts to match nodes in the syntactic trees for a given sentence in two languages. We train a probabilistic tr...
Daniel Gildea