Searching for "The Case for Precision Sharing." – sorted by Relevance.
-
The Case for Precision Sharing
- The Case for Precision Sharing ∗ Sailesh Krishnamurthy ∗ Michael J. Franklin ∗ Joseph M
- Cited by 13 (1 self) – Add To MetaCart
-
Pattern Matching as a Dynamic Facility to get Aboutness
- form by an and-or graph that in our case is precisely the shared-forest [5]. Formally, given = ffi
- Add To MetaCart
-
Efficient Incremental Parsing for Context-Free Languages
- be represented by AND-OR graphs that in our case are precisely the shared-forest graph. In this graph, ANDnodes
- Cited by 34 (14 self) – Add To MetaCart
-
An Efficient Context-Free Backbone for Natural Language Analyzers
- that in our case are precisely the shared-forest graph. To generate it, items are used as non
- Add To MetaCart
-
Approximate Pattern Matching in Shared-Forest
- be represented by and-or graphs that in our case are precisely the shared-forest graph. In this graph, and
- Add To MetaCart
-
Approximate VLDC Pattern Matching in Shared-Forest
- that allows them to share common parts. Although in the case of the query, language ambiguity could probably
- Add To MetaCart

