Sciweavers

643 search results - page 10 / 129
» Parsing And Derivational Equivalence
Sort
View
FOSSACS
2004
Springer
14 years 26 days ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
ACL
1998
13 years 8 months ago
An Alternative LR Algorithm for TAGs
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
Mark-Jan Nederhof
ACL
1996
13 years 8 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
NAACL
2010
13 years 5 months ago
Can Recognising Multiword Expressions Improve Shallow Parsing?
There is significant evidence in the literature that integrating knowledge about multiword expressions can improve shallow parsing accuracy. We present an experimental study to qu...
Ioannis Korkontzelos, Suresh Manandhar
ACL
2009
13 years 5 months ago
K-Best A* Parsing
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
Adam Pauls, Dan Klein