102 search results - page 16 / 21 » Tile Rewriting Grammars |
ACL
1994
13 years 8 months ago
1994
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose inter...
ECEASST
2006
13 years 6 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
MFCS
2007
Springer
14 years 25 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
BIRTHDAY
2005
Springer
14 years 7 days ago
2005
Springer
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
CLEF
2005
Springer
14 years 7 days ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...