Using multiset discrimination to solve language processing problems without hashing
type: Item
instance of: scholarly article
title: Using multiset discrimination to solve language processing problems without hashing
zbMATH Open document ID: 0874.68165
DOI: 10.1016/0304-3975(94)00183-J
author: Jiazhen Cai
author: Robert Paige
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 985372
zbMATH Keywords: hashing
zbMATH Keywords: language processing problems
describes a project that uses: SETL
MaRDI profile type: Publication
cites work: Q4091421
cites work: Universal classes of hash functions
cites work: An algorithm for reduction of operator strength
cites work: Variations on the Common Subexpression Problem
cites work: High level iterators and a method for automatically designing data structure representation
cites work: Pattern Matching in Trees
cites work: Q4045961
cites work: Q5585020
cites work: Q4122730
cites work: Q4038655
cites work: Three Partition Refinement Algorithms
cites work: A linear time solution to the single function coarsest partition problem
cites work: Linear unification
cites work: Minimisation of acyclic deterministic automata in linear time
cites work: Q3922128
cites work: Q3741005
cites work: Depth-First Search and Linear Graph Algorithms
cites work: A class of algorithms which require nonlinear time to maintain disjoint sets
cites work: A Theorem on Boolean Matrices
full work available at URL: 0304-3975(94)00183-j
OpenAlex ID: W2086323458
Recommended article: Discrete Hashing With Multiple Supervision
Recommended article: Language comprehension as a multi‐label classification problem
Recommended article: On modeling of linguistic information using random sets
Recommended article: Q5399640
Recommended article: A Normalized Numerical Scaling Method for the Unbalanced Multi-Granular Linguistic Sets
description: scientific article; zbMATH DE number 985372