Discovery of frequent word sequences in text

DOI10.1007/3-540-45728-3_14MaRDI QIDQ4409799zbMATH OpenFDO

Authors Helena Ahonen-Myka

Publication date 1 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2447/24470180.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• Finding maximal sequential patterns in text document collections and single documents
• Rough Sets and Current Trends in Computing
• scientific article; zbMATH DE number 2113956
• Algorithm for enumerating all maximal frequent tree patterns among words in tree-structured documents and its application
• A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence

Cited in

(4)

• Finding maximal sequential patterns in text document collections and single documents
• Discovery of maximal analogies between stories
• Computing discriminating and generic words
• Rough Sets and Current Trends in Computing

This page was built for publication: Discovery of frequent word sequences in text

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