Name
Abstract | ||
|---|---|---|
Wide-coverage grammars in Lexicalised TreeAdjoiningGrammar (ltag) and related formalismsare structurally complex, containingmany hundreds of elementary trees. In the contextof the development of a full-scale ltag-likegrammar and parsing system, we have investigatedthe claim that because many of thesetrees have a great deal of structure in common,a parser that manipulates trees individuallyperforms a considerable amount of redundantcomputation. This claim has been used to motivatea... |
Year | Venue | Keywords |
|---|---|---|
1998 | TAPD | structural complexity |
Field | DocType | Citations |
Programming language,Computer science,Automaton,Grammar,Theoretical computer science,Parsing,Computation | Conference | 4 |
PageRank | References | Authors |
0.67 | 1 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Carroll | 1 | 1971 | 222.19 |
| Nicolas Nicolov | 2 | 400 | 76.27 |
| Olga Shaumyan | 3 | 13 | 3.04 |
| Martine Smets | 4 | 100 | 10.09 |
| David J. Weir | 5 | 840 | 83.84 |