Sciweavers

47 search results - page 1 / 10
» Statistical Parsing with an Automatically-Extracted Tree Adj...
Sort
View
ACL
2000
13 years 5 months ago
Statistical Parsing with an Automatically-Extracted Tree Adjoining Grammar
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
David Chiang
COLING
1994
13 years 5 months ago
XTAG System - A Wide Coverage Grammar for English
This paper presents the XTAG system, a grammar development tool based on the Tree Adjoining Grammar (TAG) formalism that includes a wide-coverage syntactic grammar for English. Th...
Christine Doran, Dania Egedi, Beth Ann Hockey, Ban...
IJCAI
2001
13 years 5 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...
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 4 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
IWPT
2001
13 years 5 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...