877 search results - page 52 / 176 » How to Cover a Grammar |
136
Voted
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
89
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
94
Voted
IJCNLP
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we describe the motivation for and construction of a new Japanese lexical resource: the Hinoki treebank. The treebank is built from dictionary definition sentences, ...
64
Voted
ACL
2007
15 years 2 months ago
2007
A key question facing the parsing community is how to compare parsers which use different grammar formalisms and produce different output. Evaluating a parser on the same resource...
101
click to vote
EMNLP
2007
15 years 2 months ago
2007
This paper presents a tree-to-tree transduction method for text rewriting. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of...