Sciweavers

IWPT
2001
13 years 10 months ago
Bidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
Miguel A. Alonso, Víctor J. Díaz, Ma...
IJCAI
2001
13 years 10 months ago
Automatically Extracting and Comparing Lexicalized Grammars for Different Languages
In this paper, we present a quantitative comparison between the syntactic structures of three languages: English, Chinese and Korean. This is made possible by first extracting Lex...
Fei Xia, Chung-hye Han, Martha Stone Palmer, Aravi...