Reviewed by
Abstract:
The interaction between theoretical and computational linguistics, while not often acknowledged, undoubtedly had some influence in the relative failure of the previous incarnations of Hudson's Word Grammar (also known as Dependency Grammar and Daughter-Dependency Grammar) to capture the imagination in the same way that the context-free phrase structure grammars of the 1980s did. Who needed nice theories of syntax that had relationships between words expressed with pretty drawings when one could have the infinitely more computable phrase structure rules? But Hudson was undeterred, and perhaps in the vein of the mountain coming to Mohammed, he has valiantly attempted in this volume to bring his theory of Word Grammar (WG) closer to computational linguistics and AI. This is no mean feat for someone whose background is firmly in theoretical linguistics, and a lack of familiarity with computational matters is sometimes painfully clean From the perspective of a computational linguist, some of the explanations and definitions are rather unnecessary, but it must be assumed that the book was primarily written with the theoretical linguist in mind. The theory of WG originally set out to rival phrase-structure theories of gram-
Citations
| 51 | Inference in DATR – EVANS, GAZDAR - 1989 |
| 33 | The semantics of DATR – Evans, Gazdar - 1989 |
| 21 | The DATR papers – Evans, Gazdar - 1990 |
| 1 | A word grammar parser. Progress report 1 – Fraser - 1988 |

