14403 search results - page 198 / 2881 » Dynamical Systems Trees |
123
click to vote
ACL
2006
15 years 6 months ago
2006
We present the implementation of a system which extracts not only lexicalized grammars but also feature-based lexicalized grammars from Korean Sejong Treebank. We report on some p...
169
click to vote
ENTCS
2002
15 years 4 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
165
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
142
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 10 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
127
click to vote
DLT
2008
15 years 6 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...