Sciweavers

5 search results - page 1 / 1
» LTAG Dependency Parsing with Bidirectional Incremental Const...
Sort
View
EMNLP
2008
13 years 6 months ago
LTAG Dependency Parsing with Bidirectional Incremental Construction
In this paper, we first introduce a new architecture for parsing, bidirectional incremental parsing. We propose a novel algorithm for incremental construction, which can be applie...
Libin Shen, Aravind K. Joshi
LRE
2008
100views more  LRE 2008»
13 years 4 months ago
LTAG-spinal and the Treebank
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
Libin Shen, Lucas Champollion, Aravind K. Joshi
12
Voted
EMNLP
2007
13 years 6 months ago
Incremental Dependency Parsing Using Online Learning
We describe an incremental parser that was trained to minimize cost over sentences rather than over individual parsing actions. This is an attempt to use the advantages of the two...
Richard Johansson, Pierre Nugues
ANLP
1997
106views more  ANLP 1997»
13 years 5 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
SMALLTALK
2007
Springer
13 years 10 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz