Sciweavers

656 search results - page 12 / 132
» Marrying Words and Trees
Sort
View
ICALP
2011
Springer
14 years 28 days ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
LREC
2008
77views Education» more  LREC 2008»
14 years 11 months ago
Word-Based or Morpheme-Based? Annotation Strategies for Modern Hebrew Clitics
Morphologically rich languages pose a challenge to the annotators of treebanks with respect to the status of orthographic (spacedelimited) words in the syntactic parse trees. In s...
Reut Tsarfaty, Yoav Goldberg
MICAI
2004
Springer
15 years 2 months ago
Automatic Enrichment of Very Large Dictionary of Word Combinations on the Basis of Dependency Formalism
The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sen...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
ACL
2006
14 years 11 months ago
Soft Syntactic Constraints for Word Alignment through Discriminative Training
Word alignment methods can gain valuable guidance by ensuring that their alignments maintain cohesion with respect to the phrases specified by a monolingual dependency tree. Howev...
Colin Cherry, Dekang Lin
DLT
2009
14 years 7 months ago
Factorization Forests
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
Mikolaj Bojanczyk