Sciweavers

555 search results - page 32 / 111
» Decompositions of Grammar Constraints
Sort
View
EACL
1989
ACL Anthology
13 years 11 months ago
Expressing generalizations in unification-based grammar formalisms
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...
ACL
2009
13 years 7 months ago
Asynchronous Binarization for Synchronous Grammars
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
John DeNero, Adam Pauls, Dan Klein
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 9 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
DAGSTUHL
2004
13 years 11 months ago
Multi-Domain Integration with MOF and extended Triple Graph Grammars
One aim of tool integration is designing an integrated development environment that accesses the data/models of different tools and keeps them consistent throughout a project bein...
Alexander Königs, Andy Schürr
FUIN
2008
102views more  FUIN 2008»
13 years 9 months ago
Some Aspects of Parsing Expression Grammar
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...
Roman R. Redziejowski