Using multiset discrimination to solve language processing problems without hashing

DOI10.1016/0304-3975(94)00183-JzbMATH Open0874.68165OpenAlexW2086323458MaRDI QIDQ673099FDOQ673099

Authors: Jiazhen Cai, Robert Paige 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00183-j

Recommendations

• Discrete Hashing With Multiple Supervision
• Language comprehension as a multi‐label classification problem
• On modeling of linguistic information using random sets
• scientific article; zbMATH DE number 6263500
• A normalized numerical scaling method for the unbalanced multi-granular linguistic sets

zbMATH Keywords

hashinglanguage processing problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Depth-First Search and Linear Graph Algorithms
• A Theorem on Boolean Matrices
• Universal classes of hash functions
• Three Partition Refinement Algorithms
• Variations on the Common Subexpression Problem
• Linear unification
• Pattern Matching in Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimisation of acyclic deterministic automata in linear time
• A linear time solution to the single function coarsest partition problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm for reduction of operator strength
• High level iterators and a method for automatically designing data structure representation

Cited In (7)

• Generic discrimination: sorting and partitioning unshared data in linear time
• From regular expressions to DFA's using compressed NFA's
• Reordering columns for smaller indexes
• Efficient and flexible matching of recursive types
• Constant-time tree traversal and subtree equality check for grammar-compressed trees
• Generic top-down discrimination for sorting and partitioning in linear time
• An NSF proposal

Uses Software

• SETL

This page was built for publication: Using multiset discrimination to solve language processing problems without hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673099)