Sciweavers

113 search results - page 22 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
DLT
2006
13 years 6 months ago
Closure of Language Classes Under Bounded Duplication
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
TSD
2007
Springer
13 years 11 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an
AGTIVE
1999
Springer
13 years 9 months ago
Support for Design Patterns Through Graph Transformation Tools
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...
Ansgar Radermacher
EMNLP
2008
13 years 6 months ago
Phrase Translation Probabilities with ITG Priors and Smoothing as Learning Objective
The conditional phrase translation probabilities constitute the principal components of phrase-based machine translation systems. These probabilities are estimated using a heurist...
Markos Mylonakis, Khalil Sima'an
EACL
2006
ACL Anthology
13 years 6 months ago
Inheritance and the CCG Lexicon
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
Mark McConville