1000 search results - page 111 / 200 » Dependency Tree Automata |
151
Voted
CONCUR
1998
Springer
15 years 5 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
105
click to vote
COLING
1990
15 years 2 months ago
1990
Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because cff its extended domain of locality and its factoring recursion out ...
101
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper, an original solution for shape representation is proposed which relies on a spatial partitioning approach. The representation selects a discrete set of reference po...
90
Voted
ACL
2001
15 years 2 months ago
2001
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
123
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...