Abstract | ||
---|---|---|
While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators. |
Year | DOI | Venue |
---|---|---|
2001 | 10.3115/1073012.1073040 | ACL |
Keywords | Field | DocType |
tree description,possible structure,formedness principle,constraint-based approach,bigger unit,axiomatic view,invalid linguistic structure,bottom-up generator,tag-like grammar,generative view,language processing,flat semantics,top down,bottom up,constraint programming | Natural language generation,Axiom,Computer science,Constraint programming,Well-formedness,Grammar,Natural language processing,Artificial intelligence,Rewriting,Generative grammar,Semantics | Conference |
Volume | Citations | PageRank |
P01-1 | 2 | 0.59 |
References | Authors | |
10 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Claire Gardent | 1 | 463 | 60.71 |
Stefan Thater | 2 | 756 | 38.54 |