1423 search results - page 117 / 285 » Languages of Nested Trees |
175
click to vote
ACL
1998
15 years 7 months ago
1998
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...
174
click to vote
PPOPP
2006
ACM
16 years 10 days ago
2006
ACM
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
189
click to vote
ICASSP
2008
IEEE
16 years 25 days ago
2008
IEEE
CALL (Computer Assisted Language Learning) systems using ASR (Automatic Speech Recognition) for second language learning have received increasing interest recently. However, it st...
198
click to vote
RTA
2005
Springer
15 years 12 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
159
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...