| W01-0807 | stages of processing in parallel | graph rewriting | . Section 4 explains the search |
| P01-1011 | More gen - erally , the naive " | graph rewriting | " approach is unsound ; the resulting |
| P04-1040 | corpus . The method is based on | graph rewriting | using memory - based learning |
| W01-0807 | present a parallel context sensitive | graph rewriting | formalism for a dependency-oriented |
| W01-0807 | appropriate one . In a sequential | graph rewriting | approach , this requires a non-trivial |
| W01-0807 | formalism , while we use a parallel | graph rewriting | formalism . Sec - ond , we strictly |
| P98-1060 | mechanism can be formalized as a | graph rewriting | process . Applying the rule set |
| P98-1056 | nodes of a graph . The result is a | graph rewriting | process . over feature structures |
| W01-0807 | . First , Nicolov et al. use a | graph rewriting | grammar formalism , while we |
| W01-0807 | accepted . Fourth , the parallel | graph rewriting | approach allows for ( but does |
| W01-0807 | produced so far . The sequential | graph rewriting | approach bears some disadvantages |
| W01-0807 | the more constrained version of | graph rewriting | has been central in transfer-oriented |
| W01-0807 | rules in the same way sequential | graph rewriting | systems do . However , unlike |
| W01-0807 | structure pro- cessing . Parallel | graph rewriting | systems identify parts of the |
| P01-1011 | essentially the same as the naive | graph rewriting | approach in this case ; but the |
| W01-0807 | faces when following the parallel | graph rewriting | approach is thus to find optimal |
| W01-0807 | paper , we presented a parallel | graph rewriting | formalism and illustrated how |
| W01-0807 | when following the sequential | graph rewriting | approach is thus to figure out |
| W01-0807 | advantages when compared to sequential | graph rewriting | ( see Section 3 ) , sequential |
| W01-0807 | the implementation of a parallel | graph rewriting | formalism for the grammar of |
