Name
Abstract | ||
|---|---|---|
This paper introduces well-ordered derivation trees and makes use of this concept in a novel axiomatization of the TAG parsing problem as a constraint satisfaction problem. Contrary to prior approaches, our axiomatization focuses on the derivation trees rather than the derived trees. Well-ordered derivation trees are our pri- mary models, whereas the derived trees serve solely to determine word order. |
Year | Venue | Field |
|---|---|---|
2004 | TAG+ | Integer,Rule-based machine translation,Finite set,Satisfiability,Algorithm,Constraint satisfaction problem,Theoretical computer science,Parsing,Rotation formalisms in three dimensions,Mathematics,Encoding (memory) |
DocType | Citations | PageRank |
Conference | 1 | 0.39 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralph Debusmann | 1 | 64 | 8.63 |
| Denys Duchier | 2 | 181 | 23.61 |
| Marco Kuhlmann | 3 | 309 | 23.06 |
| Stefan Thater | 4 | 756 | 38.54 |