Name
Abstract | ||
|---|---|---|
In this paper we present a fully lexicalized grammar formalism as a
particularly attractive framework for the specification of natural language
grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining
Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We
illustrate the advantages of lexicalized grammars in various contexts of
natural language processing, ranging from wide-coverage grammar development to
parsing and machine translation. We also present a method for compact and
efficient representation of lexicalized trees. |
Year | Venue | Keywords |
|---|---|---|
1994 | CoRR | machine translation,natural language processing,natural language |
Field | DocType | Volume |
Tree-adjoining grammar,Context-sensitive grammar,Programming language,Context-free grammar,L-attributed grammar,Extended Affix Grammar,Computer science,Phrase structure grammar,Indexed grammar,Artificial intelligence,Categorial grammar,Natural language processing | Journal | abs/cmp-lg/9410015 |
ISSN | Citations | PageRank |
Proceedings of KONVENS 94, Vienna, Austria, September 1994 | 1 | 0.35 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Srinivas | 1 | 152 | 17.90 |
| Dania Egedi | 2 | 114 | 30.16 |
| Christy Doran | 3 | 85 | 11.93 |
| Tilman Becker | 4 | 1 | 0.69 |