522 search results - page 7 / 105 » Automating grammar comparison |
DATE
2009
IEEE
15 years 5 months ago
2009
IEEE
— This paper introduces a graph grammar based approach to automated topology synthesis of analog circuits. A grammar is developed to generate circuits through production rules, t...
131
click to vote
ACL
1990
14 years 11 months ago
1990
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
LACL
2005
Springer
15 years 4 months ago
2005
Springer
LACL
2005
Springer
15 years 4 months ago
2005
Springer
LACL
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...