NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
AN EFFICIENT PARSING ALGORITHM FOR TREE ADJOINING GRAMMARS
Karin Harbusch
|
Paper Details:
Month: June
Year: 1990
Location: Pittsburgh, Pennsylvania, USA
Venue:
ACL |
Citations
URL
BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS
Alberto Lavelli
|
Giorgio Satta
|
Comparison between CFG Filtering Techniques for LTAG and HPSG
Naoki Yoshinaga
|
Kentaro Torisawa
|
Jun’ichi Tsujii
|
No URLs Found
Field Of Study
Linguistic Trends
Syntax
Language
English
Similar Papers
DATR: A Language for Lexical Knowledge Representation
Roger Evans
|
Gerald Gazdar
|
Generating and Interpreting Referring Expressions as Belief State Planning and Plan Recognition
Dustin Smith
|
Henry Lieberman
|
RECSA: Resource for Evaluating Cross-lingual Semantic Annotation
Achim Rettinger
|
Lei Zhang
|
Daša Berović
|
Danijela Merkler
|
Matea Srebačić
|
Marko Tadić
|
Exploiting Lexical Regularities in Designing Natural Language Systems
Boris Katz
|
Beth Levin
|
Book Reviews: Speaking: From Intention to Articulation
M. Martin Taylor
|
Insup Taylor
|